Accession Number N20130011150
Title Complexity of the Quantum Adiabatic Algorithm.
Publication Date Mar 2013
Media Count 53p
Personal Author I. Hen
Abstract The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.
Keywords Algorithms
Complex systems
Computer systems programs
Eigenvalues
Hamiltonian functions
Interpolation
Isomorphism
Mathematical models
Monte carlo method
Optimization
Perturbation
Quantum computers


 
Source Agency National Aeronautics and Space Administration
NTIS Subject Category 62 - Computers, Control & Information Theory
72B - Algebra, Analysis, Geometry, & Mathematical Logic
Corporate Author National Aeronautics and Space Administration, Moffett Field, CA. Ames Research Center.
Document Type Technical report
Title Note N/A
NTIS Issue Number 1321
Contract Number NNA08CG83C

Science and Technology Highlights

See a sampling of the latest scientific, technical and engineering information from NTIS in the NTIS Technical Reports Newsletter

Acrobat Reader Mobile    Acrobat Reader