Robustness of diabatic enhancement in quantum annealing (2402.13811v1)
Abstract: In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state fidelity, is dictated by the size of the minimum gap that appears between the ground and first excited state in the annealing spectrum. To avoid the exponential slowdown associated with exponentially closing gaps, diabatic transitions to higher energy levels may be exploited in such a way that the system returns to the ground state before the end of the anneal. In certain cases, this is facilitated by the original annealing spectrum. However, there are also examples where careful manipulation of the annealing Hamiltonian has been used to alter the spectrum to create a diabatic path to the ground state. Since diabatic transitions depend on the evolution rate and the gap sizes in the spectrum, it is important to consider the sensitivity of any potential enhancement to changes in the anneal time as well as any parameters involved in the manipulation of the spectrum. We explore this sensitivity using annealing spectra containing an exponentially closing gap and an additional, tuneable, small gap created by a catalyst. We find that there is a trade-off between the precision needed in the catalyst strength and the anneal time in order to maintain the enhancement to the final ground state fidelity.
- B. Apolloni and D. D. Falco, Quantum Stochastic Optimization, Stochastic Processes and their Applications 33, 233 (1989).
- T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58, 5355 (1998), arXiv:9804280 [cond-mat] .
- Tosio Kato, On the Adiabatic Theorem of Quantum Mechanics, Journal of the Physical Society of Japan 5, 435 (1950).
- V. N. Smelyanskiy, U. V. Toussaint, and D. A. Timucin, Simulations of the adiabatic quantum optimization for the set partition problem (2002), arXiv:quant-ph/0112143 [quant-ph] .
- A. P. Young, S. Knysh, and V. N. Smelyanskiy, First-order phase transition in the quantum adiabatic algorithm, Physical Review Letters 104, 1 (2010), arXiv:0910.1378 .
- I. Hen and A. P. Young, Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems, Physical Review E 84, 10.1103/physreve.84.061152 (2011).
- V. Choi, The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization, Quantum Information Processing 19, 90 (2020), arXiv:1910.02985 .
- V. Choi, Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing (2021), arXiv:2105.02110 .
- B. Altshuler, H. Krovi, and J. Roland, Anderson localization makes adiabatic quantum optimization fail, Proceedings of the National Academy of Sciences 107, 12446 (2010).
- M. H. Amin and V. Choi, First-order quantum phase transition in adiabatic quantum computation, Phys. Rev. A 80, 062326 (2009), arXiv:0904.1387 .
- M. H. Amin, Effect of local minima on adiabatic quantum optimization, Physical Review Letters 100, 130503 (2008), arXiv:0709.0528 .
- B. Seoane and H. Nishimori, Many-body transverse interactions in the quantum annealing of the p-spin ferromagnet, Journal of Physics A: Mathematical and Theoretical 45, 435301 (2012), arXiv:1207.2909 .
- S. Knysh, Zero-temperature quantum annealing bottlenecks in the spin-glass phase, Nature Communications 7, 12370 (2016).
- T. Zanca and G. E. Santoro, Quantum annealing speedup over simulated annealing on random ising chains, Physical Review B 93, 10.1103/PhysRevB.93.224431 (2016).
- J. Roland and N. J. Cerf, Quantum search by local adiabatic evolution, Physical Review A 65, 10.1103/physreva.65.042308 (2002).
- A. Villanueva, P. Najafi, and H. J. Kappen, Why adiabatic quantum annealing is unlikely to yield speed-up (2022), arXiv:2212.13649 [quant-ph] .
- R. D. Somma, D. Nagaj, and M. Kieferová, Quantum speedup by quantum annealing, Physical Review Letters 109, 050501 (2012), arXiv:1202.6257 .
- D. Wecker, M. B. Hastings, and M. Troyer, Training a quantum optimizer, Physical Review A 94, 10.1103/physreva.94.022309 (2016).
- S. Muthukrishnan, T. Albash, and D. A. Lidar, Tunneling and speedup in quantum optimization for permutation-symmetric problems, Physical Review X 6, 10.1103/physrevx.6.031010 (2016).
- L. T. Brady and W. van Dam, Necessary adiabatic run times in quantum optimization, Physical Review A 95, 10.1103/physreva.95.032335 (2017).
- N. G. Dickson and M. H. Amin, Does adiabatic quantum optimization fail for NP-complete problems?, Physical Review Letters 106, 050502 (2011), arXiv:1010.0669 .
- L. Gupta and I. Hen, Elucidating the interplay between non-stoquasticity and the sign problem (2019), arXiv:1910.13867 [quant-ph] .
- J. Preskill, Adiabatic quantum computation is equivalent to standard quantum computation, SIAM J. Comput. 37, 1 (2007).
- D-WAVE, D-WAVE qpu solver datasheet, annealing implementation and controls, https://docs.dwavesys.com/docs/latest/c_qpu_annealing.html, accessed: 2023-02-07.
- H. Munoz-Bauza, H. Chen, and D. Lidar, A double-slit proposal for quantum annealing, npj Quantum Information 5, 10.1038/s41534-019-0160-0 (2019).
- T. Albash, Role of nonstoquastic catalysts in quantum adiabatic optimization, Phys. Rev. A 99, 042334 (2019), arXiv:1811.09980 .
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.