Classical simulated annealing using quantum analogues

DOI10.1007/S10955-016-1570-4zbMATH Open1348.82021arXiv2104.14502OpenAlexW3158361142WikidataQ59478137 ScholiaQ59478137MaRDI QIDQ321328FDOQ321328

Authors: Brian R. La Cour, James E. Troupe, Hans M. Mark 

Publication date: 13 October 2016

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: In this paper we consider the use of certain classical analogues to quantum tunneling behavior to improve the performance of simulated annealing on a discrete spin system of the general Ising form. Specifically, we consider the use of multiple simultaneous spin flips at each annealing step as an analogue to quantum spin coherence as well as modifications of the Boltzmann acceptance probability to mimic quantum tunneling. We find that the use of multiple spin flips can indeed be advantageous under certain annealing schedules, but only for long anneal times.

Full work available at URL: https://arxiv.org/abs/2104.14502

Recommendations

• Quantum annealing of hard problems
• Quantum versus classical annealing of Ising spin glasses
• scientific article
• Quantum Monte Carlo annealing with multi-spin dynamics
• Quantum spin glasses, annealing and computation

zbMATH Keywords

simulated annealingoptimization methodsquantum annealingcoherent tunneling

Mathematics Subject Classification ID

Stochastic programming (90C15) Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Optimised simulated annealing for Ising spin glasses
• Optimization by simulated annealing
• Title not available (Why is that?)
• Monte Carlo sampling methods using Markov chains and their applications
• Equation of state calculations by fast computing machines
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Error detecting and error correcting codes
• Colloquium: Quantum annealing and analog quantum computation
• Very fast simulated re-annealing
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Title not available (Why is that?)
• Facts, Conjectures, and Improvements for Simulated Annealing

Cited In (9)

• Efficiency of quantum vs. classical annealing in nonconvex learning problems
• Quantum Monte Carlo annealing with multi-spin dynamics
• Title not available (Why is that?)
• Quantum versus classical annealing of Ising spin glasses
• Quantum computation: from the sequential approach to simulated annealing
• Quantum vs. classical algorithms for solving the heat equation
• Spiking neural network dynamic system modeling for computation of quantum annealing and its convergence analysis
• Quantum approach to classical statistical mechanics
• Simulated annealing and quantum detailed balance

Uses Software

• SimAn

This page was built for publication: Classical simulated annealing using quantum analogues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321328)