2000 character limit reached
Fast Simulated Annealing inspired by Quantum Monte Carlo
Published 6 Sep 2023 in quant-ph | (2309.02735v2)
Abstract: Quantum Monte Carlo (QMC) is commonly used in simulations for Quantum Annealing (QA), but QMC as a heuristic approach has great difficulty in that it takes much time to find minimum energy. It mainly depends on the existence of a trotter layer derived from Suzuki-Trotter decomposition. In this paper, I propose a new approach to calculate it in short time, although it isn't rigorous mathematically. Its validity and advantageous points are also discussed, in comparison with conventional QMC methods.
- T. Kadowaki and H. Nishimori ”Quantum annealing in the transverse Ising model”, Phys. Rev. E 58, 5355 (1998).
- ”Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model”, Phys. Rev. B 66, 094203 (2002).
- E. Savard ”Quantum Monte Carlo for Quantum-dot Cellular Automata”, https://open.library.ubc.ca/media/stream/pdf/52966/1.0304646/5
- ”A GPU-Based Quantum Annealing Simulator for Fully-Connected Ising Models Utilizing Spatial and Temporal Parallelism”, https://ieeexplore.ieee.org/document/9057502
- ”Replica Monte Carlo Simulation”, Phys. Rev. Lett. 57, 2607 (1986).
- ”Quantum critical dynamics in a 5000-qubit programmable spin glass”, https://arxiv.org/abs/2207.13800
- ”Quantum Monte Carlo Loop Algorithm for the t-J Model”, Phys. Rev. B 58, 4304 (1998).
- ”The sign problem in Monte Carlo simulations of frustrated quantum spin systems”, Phys. Rev. B 62, 1102 (2000).
- GSET https://web.stanford.edu/~yyye/yyye/Gset/
- ”Breakout Local Search for the Max-Cutproblem”, Engineering Applications of Artificial Intelligence, 26, 1162, (2013).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.