On the dynamics of Simulated Quantum Annealing in random Ising chains

Abstract

Simulated Quantum Annealing (SQA), that is emulating a Quantum Annealing (QA) dynamics on a classical computer by a Quantum Monte Carlo whose parameters are changed during the simulation, is a well established computational strategy to cope with the exponentially large Hilbert space. It has enjoyed some early successes but has also raised more recent criticisms. Here we investigate, on the paradigmatic case of a one-dimensional transverse field Ising chain, two issues related to SQA in its Path-Integral implementation: the question of Monte Carlo vs physical (Schrödinger) dynamics and the issue of the imaginary-time continuum limit to eliminate the Trotter error. We show that, while a proper time-continuum limit is able to restitute the correct Kibble-Zurek scaling of the residual energy ${\epsilon }_{\mathrm{res}}(\tau )\sim {\tau }^{-1/2}$ for the ordered case --- $\tau$ being the total annealing time ---, the presence of disorder leads to a characteristic sampling crisis for a large number of Trotter time-slices, in the low-temperature ordered phase. Such sampling problem, in turn, leads to SQA results which are apparently unrelated to the coherent Schrödinger QA even at intermediate $\tau$.

arXiv comment8 pages, 8 figures

References in corpus (35)

• Nonequilibrium dynamics of closed interacting quantum systems
• Quantum Annealing in the Transverse Ising Model
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Cosmological Experiments in Condensed Matter Systems
• Quantum annealing with more than one hundred qubits
• Theory of Quantum Annealing of an Ising Spin Glass
• Dynamics of quantum phase transition: exact solution in quantum Ising model
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Defining and detecting quantum speedup
• Experimental signature of programmable quantum annealing
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• What is the Computational Value of Finite Range Tunneling?
• A Numerical Study of the Random Transverse-Field Ising Spin Chain
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Entanglement in a quantum annealing processor
• Quantum versus Classical Annealing of Ising Spin Glasses
• Adiabatic quantum dynamics of a random Ising chain across its quantum critical point
• Adiabatic dynamics in open quantum critical many-body systems
• Dynamics of a quantum phase transition in the random Ising model
• Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
• Reexamining classical and quantum models for the D-Wave One processor
• Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
• Higher order and infinite Trotter-number extrapolations in path integral Monte Carlo
• Tunneling and speedup in quantum optimization for permutation-symmetric problems
• Efficiency of quantum versus classical annealing in non-convex learning problems
• Macroscopic Resonant Tunneling in the Presence of Low Frequency Noise
• Dissipative Landau-Zener problem and thermally assisted Quantum Annealing
• Reexamination of the evidence for entanglement in the D-Wave processor
• Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing
• Relation between quantum fluctuations and the performance enhancement of quantum annealing in a nonstoquastic Hamiltonian
• Cooling dynamics of pure and random Ising chains
• Direct comparison of quantum and simulated annealing on a fully-connected Ising ferromagnet
• Quantum annealing speedup over simulated annealing on random Ising chains
• On the optimal working point in dissipative quantum annealing
• Understanding Quantum Tunneling using Diffusion Monte Carlo Simulations

Cited by in corpus (8)

• Scaling advantage in quantum simulation of geometrically frustrated magnets
• Variational Neural Annealing
• Simulated quantum annealing as a simulator of non-equilibrium quantum dynamics
• Optimal working point in digitized quantum annealing
• Minimal Constraints in the Parity Formulation of Optimization Problems
• Tunneling in projective quantum Monte Carlo simulations with guiding wave functions
• Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
• Transfer Learning for Deep-Unfolded Combinatorial Optimization Solver with Quantum Annealer