Quantum Computing: Solving Complex Problems
Abstract
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.
 Authors:
 IBM Watson Research Center
 Publication Date:
 Research Org.:
 FNAL (Fermi National Accelerator Laboratory (FNAL), Batavia, IL (United States))
 Sponsoring Org.:
 USDOE Office of Science (SC)
 OSTI Identifier:
 987211
 DOE Contract Number:
 AC0207CH11359
 Resource Type:
 Multimedia
 Resource Relation:
 Conference: Fermilab Colloquia, Fermi National Accelerator Laboratory (FNAL), Batvia, Illinois (United States), presented on April 11, 2007
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; 99 GENERAL AND MISCELLANEOUS
Citation Formats
DiVincenzo, David. Quantum Computing: Solving Complex Problems. United States: N. p., 2007.
Web.
DiVincenzo, David. Quantum Computing: Solving Complex Problems. United States.
DiVincenzo, David. Thu .
"Quantum Computing: Solving Complex Problems". United States.
doi:. https://www.osti.gov/servlets/purl/987211.
@article{osti_987211,
title = {Quantum Computing: Solving Complex Problems},
author = {DiVincenzo, David},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Apr 12 00:00:00 EDT 2007},
month = {Thu Apr 12 00:00:00 EDT 2007}
}

Many challenging problems in computer science and related fields can be formulated as constraint satisfaction problems. Such problems consist of a set of discrete variables and a set of constraints between those variables, and represent a general class of socalled NPcomplete problems. The goal is to find a value assignment to the variables that satisfies all constraints, generally requiring a search through and exponentially large space of variablevalue assignments. Models for disordered systems, as studied in statistical physics, can provide important new insights into the nature of constraint satisfaction problems. Recently, work in this area has resulted in the discoverymore »

Rebecca Erikson – Solving Problems with Love for Science
Rebecca Erikson’s love for science began at a young age. Today, she’s a senior scientist at PNNL trying to solve problems that address national security concerns. Through one project, she developed a sleek, simple and inexpensive way to turn a cellphone into a highpowered, highquality microscope that helps authorities determine if white powder that falls from an envelope is anthrax or something simple like baby powder. Listen as Rebecca describes her work in this Energy Department video. 
Solving Problems with Sequences (Closing Keynote Address  2010 JGI User Meeting)
Rita Colwell, recipient of the 2010 Stockholm Water Prize, delivers the closing keynote at the 5th Annual DOE JGI User Meeting on March 26, 2010. 
Computing with quantum knots: Marjorana modes, nonAbelian anyons, and topological quantum computation
I will discuss the revolutionary new concept of topological quantum computation, which is faulttolerant at the hardware level with no need, in principle, of any quantum error correction protocols. Errors simply do not occur since the physical qubits and the computation steps are protected against decoherence by nonlocal topological correlations in the underlying physical system. The key idea is nonAbelian statistics of the quasiparticles (called 'anyons' as opposed to fermions or bosons), where the spacetime braiding of the anyons around each other, i.e. quantum 'knots', form topologically protected quantum gate operations. I will describe in detail the theoretical principles guidingmore »