Simulated quantum annealing of double-well and multi-well potentials
arXiv:1510.04650 · doi:10.1103/PhysRevE.92.053304
Abstract
We analyze the performance of quantum annealing as a heuristic optimization method to find the absolute minimum of various continuous models, including landscapes with only two wells and also models with many competing minima and with disorder. The simulations performed using a projective quantum Monte Carlo (QMC) algorithm are compared with those based on the finite-temperature path-integral QMC technique and with classical annealing. We show that the projective QMC algorithm is more efficient than the finite-temperature QMC technique, and that both are inferior to classical annealing if this is performed with appropriate long-range moves. However, as the difficulty of the optimization problem increases, classical annealing looses efficiency, while the projective QMC algorithm keeps stable performance and is finally the most effective optimization tool. We discuss the implications of our results for the outstanding problem of testing the efficiency of adiabatic quantum computers using stochastic simulations performed on classical computers.
arXiv comment11 pages, 7 figures
References in corpus (23)
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Defining and detecting quantum speedup
- Mathematical Foundation of Quantum Annealing
- Experimental signature of programmable quantum annealing
- Entanglement in a quantum annealing processor
- Quantum versus Classical Annealing of Ising Spin Glasses
- Optimized simulated annealing for Ising spin glasses
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Optimization by Quantum Annealing: Lessons from hard 3-SAT cases
- Universal nonequilibrium quantum dynamics in imaginary time
- Reexamining classical and quantum models for the D-Wave One processor
- Optimization by Quantum Annealing: Lessons from Simple Cases
- Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs
- Population size bias in Diffusion Monte Carlo
- Convergence theorems for quantum annealing
- Diffusion Monte Carlo: Exponential scaling of computational cost for large systems
- Monte Carlo studies of quantum and classical annealing on a double-well
- Quantum annealing of an Ising spin-glass by Green's function Monte Carlo
Cited by in corpus (11)
- Adiabatic Quantum Computing
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing
- Projective quantum Monte Carlo simulations guided by unrestricted neural network states
- Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing
- Self-learning projective quantum Monte Carlo simulations guided by restricted Boltzmann machines
- Quantum annealing speedup over simulated annealing on random Ising chains
- Understanding Quantum Tunneling using Diffusion Monte Carlo Simulations
- Effectiveness of quantum annealing for continuous-variable optimization
- Tunneling in projective quantum Monte Carlo simulations with guiding wave functions
- Quantum Monte Carlo simulation of BEC-impurity tunneling