You could run Grover's algorithm on a database with 2^5=32 elements. https://en.wikipedia.org/wiki/Grover's_algorithm Or Shor's algorithm to factor a 5-bit number. https://en.wikipedia.org/wiki/Shor%27s_algorithm

Pinky: Gee, Brain, what do you want to do tonight?

Brain: The same thing we do every night, Pinky - try to take over the world!

______

Currently, I'm not aware of anything that's not able to be done with QC qubits that not able to be done with classical binary computation.

If you wanted, you can download quantum computer simulator, write some QC'ish code, run the code, and you'll never write any code that won't resolve with crashing or taking forever, though it'd be faster on the 5 qubits though.

I think David Deutsch came up with some simple algorithms back in the early 90's that are exponentially faster in a QC. I don't know if they implemented Hadamard/XOR gates in this thing.

1. Shor's algorithm

2. Grover's algorithm

3. Quantum simulation

If you're not doing those three things, throw it in the trash, more or less.