Quantum Computing [electronic resource] : Solving Complex Problems
- Washington, D.C. : United States. Dept. of Energy. Office of Science, 2007.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy
- Physical Description:
- 1:12:50 : digital, PDF file
- Additional Creators:
- Fermi National Accelerator Laboratory
United States. Department of Energy. Office of Science
United States. Department of Energy. Office of Scientific and Technical Information
- 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.
- Published through SciTech Connect.
Fermilab Colloquia, Fermi National Accelerator Laboratory (FNAL), Batvia, Illinois (United States), presented on April 11, 2007.
DiVincenzo, David [IBM Watson Research Center].
- Funding Information:
View MARC record | catkey: 23504603