The burgeoning field of quantum information science is not only about building a working device. Already we can learn a lot by thinking about how computation works under the rule of quantum mechanics.

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...