I have to object, while not many algorithms exists, one of the most famous ones, Grovers algorithm [0] is also one of the most general ones and quite powerful. It reduces search of 2^n items to about 2^(n/2) while using n q-bits. Thats just the square root of a classical algorithm.