Quantum Computing: Solving Complex Problems

Multimedia · Thu Apr 12 04:00:00 EDT 2007

DOI:https://doi.org/10.1007/978-3-540-74559-4_12· OSTI ID:987211

DiVincenzo, David ^[1]

---

1. OSTI/ DOE

One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.

• Research Organization: FNAL (Fermi National Accelerator Laboratory (FNAL), Batavia, IL (United States))
• Sponsoring Organization: USDOE Office of Science (SC)
• DOE Contract Number: AC02-07CH11359
• OSTI ID: 987211
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
97 MATHEMATICS AND COMPUTING