HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
From MaRDI portal
Publication:3534111
DOI10.1142/S021974990800358XzbMath1192.81064arXivquant-ph/0512159OpenAlexW2011679439WikidataQ59482330 ScholiaQ59482330MaRDI QIDQ3534111
Jeffrey Goldstone, Daniel Nagaj, Sam Gutmann, Edward Farhi
Publication date: 3 November 2008
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0512159
Quantum computation (81P68) Adiabatic invariants for problems in Hamiltonian and Lagrangian mechanics (70H11)
Related Items
Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing, Computational complexity of the landscape. I., Why adiabatic quantum annealing is unlikely to yield speed-up, A study of heuristic guesses for adiabatic quantum computation, Elimination of perturbative crossings in adiabatic quantum optimization, Resonances and partial delocalization on the complete graph, Unnamed Item, Anderson localization makes adiabatic quantum optimization fail, Vibration analysis of cyclic symmetrical systems by quantum algorithms
Cites Work
