Zeno machines and hypercomputation
Theoretical Computer Science
Improved Gap Estimates for Simulating Quantum Circuits by Adiabatic Evolution
Quantum Information Processing
Quantum Algorithms: Philosophical Lessons
Minds and Machines
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Quantum Information Processing
Bounding run-times of local adiabatic algorithms
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Adiabatic quantum counting by geometric phase estimation
Quantum Information Processing
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Quantum Information Processing
The role of symmetries in adiabatic quantum algorithms
Quantum Information & Computation
The complexity of stoquastic local Hamiltonian problems
Quantum Information & Computation
Problems of adiabatic quantum program design
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Faithful representations of graphs by islands in the extended grid
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The complexity of the local hamiltonian problem
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Consistency of local density matrices is QMA-Complete
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Quantum speed-up for unsupervised learning
Machine Learning
Adapting the traveling salesman problem to an adiabatic quantum computer
Quantum Information Processing
Adiabatic quantum optimization with qudits
Quantum Information Processing
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
Proceedings of the ACM International Conference on Computing Frontiers
Guest column: the quantum PCP conjecture
ACM SIGACT News
| Hi-index | 0.00 |
The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown. We settle this question and describe an efficient adiabatic simulation of any given quantum algorithm. This implies that the adiabatic computation model and the standard quantum circuit model are polynomially equivalent. We also describe an extension of this result with implications to physical implementations of adiabatic computation. We believe that our result highlights the potential importance of the adiabatic computation model in the design of quantum algorithms and in their experimental realization.