Optimizing Quantum Adiabatic Algorithm
arXiv:1508.05089 · doi:10.1103/PhysRevA.93.012345
Abstract
In quantum adiabatic algorithm, as the adiabatic parameter changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this computational error depends not only on the total computation time but also on the time derivatives of the adiabatic parameter at the beginning and the end of evolution. Previous work (Phys. Rev. A \textbf{82}, 052305) also suggested this result. With six typical paths, we systematically demonstrate how to optimally design an adiabatic path to reduce the computational errors. Our method has a clear physical picture and also explains the pattern of computational error. In this paper we focus on quantum adiabatic search algorithm although our results are general.
arXiv comment8 pages, 9 figures
References in corpus (11)
- Quantum Mechanics helps in searching for a needle in a haystack
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Search by Local Adiabatic Evolution
- Robustness of adiabatic quantum computation
- Quantum algorithms for algebraic problems
- Adiabatic Theory of Nonlinear Evolution of Quantum States
- Quantum Adiabatic Brachistochrone
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Accuracy vs run time in adiabatic quantum search
- Berry Phase in Atom-Molecule Conversion Systems and Fractional Monopole
- Hierarchical Theory of Quantum Adiabatic Evolution
Cited by in corpus (6)
- Hybrid scheme for factorization: Factoring 551 using a 3-qubit NMR quantum adiabatic processor
- Quantum battery supercharging via counter-diabatic dynamics
- Quantum search in many-body interacting system with long-range interaction
- Hard instance learning for quantum adiabatic prime factorization
- Quantum annealing sampling with a bias field
- Accelerated spin-adapted ground-state preparation with nonvariational quantum algorithms