Faster annealing schedules for quantum annealing

Abstract

New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional to the square of the annealing time, is shown to be determined only by the information at the initial and final times. Our annealing schedules make it possible to drop this term, thus leading to a higher order (smaller) excitation probability. We verify these results by solving numerically the time-dependent Schrodinger equation for small size systems

10 pages, 5 figures, minor corrections

Cited by in corpus (13)

• Shortcuts to adiabaticity: concepts, methods, and applications
• Quantum Annealing and Analog Quantum Computation
• Mathematical Foundation of Quantum Annealing
• Shortcuts to adiabaticity for quantum annealing
• Performance Evaluation of Adiabatic Quantum Computation via Quantum Speed Limits and Possible Applications to Many-Body Systems
• On The Power Of Coherently Controlled Quantum Adiabatic Evolutions
• Unitary deformations of counterdiabatic driving
• Quantum and classical annealing in a continuous space with multiple local minima
• Reservoir-engineering shortcuts to adiabaticity
• Exotic quantum holonomy in Hamiltonian systems
• Failure of the geometric approach prediction of excess work scaling for open and isolated quantum systems
• Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling
• Optimization of conveyance of quantum particles by moving potential well