Skip to main content Accessibility help
×
Home
  • Print publication year: 2013
  • Online publication date: April 2013

10 - Quantum computing

Summary

Alright, so now we've got this beautiful theory of quantum mechanics, and the possibly-even-more-beautiful theory of computational complexity. Clearly, with two theories this beautiful, you can't just let them stay single – you have to set them up, see if they hit it off, etc.

And that brings us to the class BQP: Bounded-Error Quantum Polynomial-Time. We talked in Chapter 7 about BPP, or Bounded-Error Probabilistic Polynomial-Time. Informally, BPP is the class of computational problems that are efficiently solvable in the physical world if classical physics is true. Now we ask, what problems are efficiently solvable in the physical world if (as seems more likely) quantum physics is true?

To me it’s sort of astounding that it took until the 1990s for anyone to really seriously ask this question, given that all the tools for asking it were in place by the 1960s or even earlier. It makes you wonder, what similarly obvious questions are there today that no one’s asking?

L. M. Adleman, J. DeMarrais, and M.-D. A. Huang, Quantum Computability, SIAM Journal on Computing, 26:5 (1997), 1524–1540.
D. R. Simon, On the Power of Quantum Cryptography, Proceedings of IEEE Symposium on Foundations of Computer Science, (1994), 116–123
Proceedings of Annual ACM Symposium on Theory of Computing (2010), pp. 141–50.