The complexity of the quantum adiabatic algorithm

DOI10.1016/j.cpc.2010.06.001zbMath1219.81081OpenAlexW2026173446MaRDI QIDQ546837

Yong-Cai Geng, Sumit K. Garg

Publication date: 30 June 2011

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2010.06.001

zbMATH Keywords

complexityalgorithmquantum

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Computational methods for problems pertaining to quantum theory (81-08) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

A study of heuristic guesses for adiabatic quantum computation ⋮ An introduction to quantum annealing

Cites Work

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Unnamed Item