Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing

Abstract

Simulated Quantum Annealing (SQA) is a Markov Chain Monte-Carlo algorithm that samples the equilibrium thermal state of a Quantum Annealing (QA) Hamiltonian. In addition to simulating quantum systems, SQA has also been proposed as another physics-inspired classical algorithm for combinatorial optimization, alongside classical simulated annealing. However, in many cases it remains an open challenge to determine the performance of both QA and SQA. One piece of evidence for the strength of QA over classical simulated annealing comes from an example by Farhi, Goldstone and Gutmann . There a bit-symmetric cost function with a thin, high energy barrier was designed to show an exponential seperation between classical simulated annealing, for which thermal fluctuations take exponential time to climb the barrier, and quantum annealing which passes through the barrier and reaches the global minimum in poly time, arguably by taking advantage of quantum tunneling. In this work we apply a comparison method to rigorously show that the Markov chain underlying SQA efficiently samples the target distribution and finds the global minimum of this spike cost function in polynomial time. Our work provides evidence for the growing consensus that SQA inherits at least some of the advantages of tunneling in QA, and so QA is unlikely to achieve exponential speedups over classical computing solely by the use of quantum tunneling. Since we analyze only a particular model this evidence is not decisive. However, techniques applied here---including warm starts from the adiabatic path and the use of the quantum ground state probability distribution to understand the stationary distribution of SQA---may be valuable for future studies of the performance of SQA on cost functions for which QA is efficient.

21 pages, revised analysis includes worldline updates and spikes with polynomial width

References in corpus (5)

• Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing
• Markov chain comparison
• Adiabatic optimization versus diffusion Monte Carlo
• Simulated quantum annealing of double-well and multi-well potentials
• Spectral Gap Analysis for Efficient Tunneling in Quantum Adiabatic Optimization

Cited by in corpus (22)

• Quantum machine learning: a classical perspective
• Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
• Quantum annealing versus classical machine learning applied to a simplified computational biology problem
• Qibo: a framework for quantum simulation with hardware acceleration
• Biology and medicine in the landscape of quantum advantages
• Accurate Lindblad-Form Master Equation for Weakly Damped Quantum Systems Across All Regimes
• Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
• A cross-disciplinary introduction to quantum annealing-based algorithms
• Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing
• Building an iterative heuristic solver for a quantum annealer
• Machine learning \& artificial intelligence in the quantum domain
• Quantum simulation with just-in-time compilation
• Direct comparison of quantum and simulated annealing on a fully-connected Ising ferromagnet
• Heterogeneous Quantum Computing for Satellite Constellation Optimization: Solving the Weighted K-Clique Problem
• Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
• On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
• Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end
• Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians
• Towards Transfer Learning for Large-Scale Image Classification Using Annealing-based Quantum Boltzmann Machines
• Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing
• The Short Path Algorithm Applied to a Toy Model
• Classical Simulation of High Temperature Quantum Ising Models