DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Diabatic quantum annealing for the frustrated ring model

Journal Article · · Quantum Science and Technology

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
National Science Foundation (NSF); Natural Sciences and Engineering Research Council of Canada (NSERC); USDOE; USDOE Laboratory Directed Research and Development (LDRD) Program; USDOE National Nuclear Security Administration (NNSA); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
Grant/Contract Number:
89233218CNA000001
OSTI ID:
2007964
Report Number(s):
LA-UR--22-32570
Journal Information:
Quantum Science and Technology, Journal Name: Quantum Science and Technology Journal Issue: 4 Vol. 8; ISSN 2058-9565
Publisher:
IOP PublishingCopyright Statement
Country of Publication:
United Kingdom
Language:
English

References (41)

Beweis des Adiabatensatzes journal March 1928
Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems journal June 1976
Barren plateaus in quantum neural network training landscapes journal November 2018
Cost function dependent barren plateaus in shallow parametrized quantum circuits journal March 2021
Prospects for quantum enhancement with diabatic quantum annealing journal May 2021
Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks journal March 2022
Theory of overparametrization in quantum neural networks journal June 2023
Bounds for the adiabatic approximation with applications to quantum computation journal October 2007
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator journal October 2020
Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems journal July 2016
Deep learning optimal quantum annealing schedules for random Ising models journal July 2023
Transitionless quantum driving journal August 2009
Schedule path optimization for adiabatic quantum computing and optimization journal March 2016
On the product of semi-groups of operators journal April 1959
Noise amplification at spin-glass bottlenecks of quantum annealing: A solvable model journal April 2020
Variationally scheduled quantum simulation journal May 2021
Genetic optimization of quantum annealing journal January 2022
Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz journal December 2022
Nested quantum search and structured problems journal February 2000
Quantum search by local adiabatic evolution journal March 2002
First-order quantum phase transition in adiabatic quantum computation journal December 2009
Robust quantum control for adiabatic quantum computation journal June 2019
Optimally Stopped Optimization journal November 2016
Quantum annealing in the transverse Ising model journal November 1998
Quantum Speedup by Quantum Annealing journal July 2012
Quantum Algorithm for Data Fitting journal August 2012
Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems journal February 2021
Quantum Mechanics Helps in Searching for a Needle in a Haystack journal July 1997
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices journal June 2020
Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle journal May 2017
Shortcuts to adiabaticity: Concepts, methods, and applications journal October 2019
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem journal April 2001
Defining and detecting quantum speedup journal June 2014
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation journal January 2007
On the Adiabatic Theorem of Quantum Mechanics journal November 1950
Quantum search algorithms journal June 2004
Applying quantum algorithms to constraint satisfaction problems journal July 2019
Faster quantum and classical SDP approximations for quadratic binary optimization journal January 2022
Diagnosing Barren Plateaus with Tools from Quantum Optimal Control journal September 2022
Quantum-Walk Speedup of Backtracking Algorithms journal December 2018
Data for "Diabatic Quantum Annealing for the Frustrated Ring Model" dataset January 2023