someone already mentioned the NP bit, but I also don't think its that disappointing [or surprising]. There's plenty difficult problems outside of NP complete that a quantum computer could conceivably be quite handy at. e.g. shor's algorithm for factoring an integer into primes. or grover's search. or a universal quantum simulator (as mentioned)
