Diabatic quantum and classical annealing of the Sherrington-Kirkpatrick model

Abstract

Quantum annealing is a contender to solve combinatorial optimization problems based on quantum dynamics. While significant efforts have been undertaken to investigate the quality of the solutions and the required runtimes, much less attention has been paid to understanding the dynamics of quantum annealing and the process leading to the solution during the sweep itself. In this comprehensive study, we investigate various aspects of the quantum annealing dynamics using different approaches. We perform quantum annealing, simulated quantum annealing, and classical annealing on several hundred instances of the Sherrington-Kirkpatrick model with intermediate system sizes up to 22 spins using numerical simulations. We observe qualitative differences between the quantum and classical methods, in particular at intermediate times, where a peak in the fidelity, also known as diabatic bump, appears for hard instances. Furthermore, we investigate the two-point correlation functions, which feature differences at intermediate times as well. At short times, however, the methods are similar again, which can be explained by relating the short-time expansion of quantum annealing to a high-temperature expansion, thus allowing in principle to find the classical solution already at short times, albeit at prohibitive sampling cost.

revised version: 22 pages, 11 figures

References in corpus (15)

• The NumPy array: a structure for efficient numerical computation
• The Magnus expansion and some of its applications
• Mathematical Foundation of Quantum Annealing
• Quantum critical dynamics in a 5000-qubit programmable spin glass
• Quantum Annealing: An Overview
• Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
• Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve
• The quantum adiabatic algorithm and scaling of gaps at first order quantum phase transitions
• On quantum mean-field models and their quantum annealing
• Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs
• Quantum annealing: the fastest route to quantum computation?
• Simulated quantum annealing as a simulator of non-equilibrium quantum dynamics
• Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity
• On the hardness of quadratic unconstrained binary optimization problems

Cited by in corpus (2)

• Classical Annealing of Sherrington-Kirkpatrick Spin Glass Using Suzuki-Kubo Mean-field Ising Dynamics
• Quantum Annealing with chaotic driver Hamiltonians