Quantum algorithms do exist, which are the closest thing we have to quantum programs. In order for a complete quantum program to exist, we would have to have a large-scale quantum computer (which we don’t have). However, people have figured out exactly how the programs would work once we are able to create them.
Examples include Shor’s algorithm (which factors numbers very quickly) and Grover’s algorithm (which finds stuff in a list very quickly). Neither of these are particularly “fun” (or “understandable”) for a typical person, but they are both examples of things which quantum computers do faster than normal computers.