Fast Simulated Annealing inspired by Quantum Monte Carlo

TL;DR

This paper introduces a faster heuristic inspired by Quantum Monte Carlo for quantum annealing, proposing a new approach to reduce computation time despite lacking rigorous mathematical proof.

Contribution

It presents a novel, less time-consuming method inspired by QMC for quantum annealing, with discussion on its validity and advantages over traditional QMC.

Findings

Proposes a new heuristic approach inspired by QMC.

Demonstrates reduced computation time compared to conventional QMC.

Discusses advantages and validity despite lack of rigorous proof.

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.