A study of heuristic guesses for adiabatic quantum computation
- 14 March 2010
- journal article
- research article
- Published by Springer Nature in Quantum Information Processing
- Vol. 10 (1) , 33-52
Abstract
No abstract availableKeywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Quantum Adiabatic BrachistochronePhysical Review Letters, 2009
- Size Dependence of the Minimum Excitation Gap in the Quantum Adiabatic AlgorithmPhysical Review Letters, 2008
- Construction of model Hamiltonians for adiabatic quantum computation and its application to finding low-energy conformations of lattice protein modelsPhysical Review A, 2008
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAILInternational Journal of Quantum Information, 2008
- Towards Fault Tolerant Adiabatic Quantum ComputationPhysical Review Letters, 2008
- Exponential complexity of an adiabatic algorithm for an NP-complete problemPhysical Review A, 2006
- Adiabatic quantum computing for random satisfiability problemsPhysical Review A, 2003
- Quantum search by local adiabatic evolutionPhysical Review A, 2002
- Robustness of adiabatic quantum computationPhysical Review A, 2001
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001