Being able to quickly solve NP-complete problems has enormous consequences. A fairly well-known NP-complete problem is the travelling salesman problem, which has real-world implications for logistics. NP-complete problems are present in such diverse fields as medicine, biology, computing, mathematics, and finance. Of immediate concern is quantum computers' potential for cryptanalysis (codebreaking). Specifically, a quantum computer could factor very large numbers in a fraction of the time needed by current computers. That BTW, is just what you need for cracking the RSA cipher and other widely-used ciphers that depend on one-way mathematical functions. Perhaps this will light a fire under quantum cryptography efforts."