Lower Bounds on Quantum Annealing Times
- Univ. of Maryland, College Park, MD (United States). Joint Quantum Institute and Joint Center for Quantum Information and Computer Science; Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- NASA Ames Research Center, Moffett Field, CA (United States). Quantum Artificial Intelligence Laboratory; KBR, Houston, TX (United States)
- Univ. of Maryland, College Park, MD (United States). Joint Quantum Institute and Joint Center for Quantum Information and Computer Science
- Univ. of Maryland, College Park, MD (United States). Joint Center for Quantum Information and Computer Science; National Inst. of Standards and Technology (NIST), Gaithersburg, MD (United States)
The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Herein, our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); National Science Foundation (NSF)
- Grant/Contract Number:
- 89233218CNA000001; AC52-06NA25396; PHY-1748958; SC0020312; OMA-2120757
- OSTI ID:
- 2008288
- Report Number(s):
- LA-UR-23-21139; TRN: US2406435
- Journal Information:
- Physical Review Letters, Vol. 130, Issue 14; ISSN 0031-9007
- Publisher:
- American Physical Society (APS)Copyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution
Bounding the Minimum Time of a Quantum Measurement