Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians

Path integral quantum Monte Carlo (PIMC) is a method for estimating thermal equilibrium properties of stoquastic quantum spin systems by sampling from a classical Gibbs distribution using Markov chain Monte Carlo. The PIMC method has been widely used to study the physics of materials and for simulated quantum annealing, but these successful applications are rarely accompanied by formal proofs that the Markov chains underlying PIMC rapidly converge to the desired equilibrium distribution. In this work we analyze the mixing time of PIMC for 1D stoquastic Hamiltonians, including disordered transverse Ising models (TIM) with long-range algebraically decaying interactions as well as disordered XY spin chains with nearest-neighbor interactions. By bounding the convergence time to the equilibrium distribution we rigorously justify the use of PIMC to approximate partition functions and expectations of observables for these models at inverse temperatures that scale at most logarithmically with the number of qubits. The mixing time analysis is based on the canonical paths method applied to the single-site Metropolis Markov chain for the Gibbs distribution of 2D classical spin models with couplings related to the interactions in the quantum Hamiltonian. Since the system has strongly nonisotropic couplings that grow with system size, it does not fall into the known cases where 2D classical spin models are known to mix rapidly.

[1]  W. Hager,et al.  and s , 2019, Shallow Water Hydraulics.

[2]  H. Nishimori,et al.  Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field , 2018, 1801.02005.

[3]  Alan Mink,et al.  Diffusion Monte Carlo approach versus adiabatic computation for local Hamiltonians , 2017, 1709.03971.

[4]  T. Cubitt,et al.  Universal quantum Hamiltonians , 2017, Proceedings of the National Academy of Sciences.

[5]  Daniel A. Lidar,et al.  Adiabatic quantum computation , 2016, 1611.04471.

[6]  Y. Peres,et al.  Markov Chains and Mixing Times: Second Edition , 2017 .

[7]  Daniel A. Lidar,et al.  Non-stoquastic Hamiltonians in quantum annealing via geometric phases , 2017 .

[8]  Michael Jarret,et al.  Substochastic Monte Carlo Algorithms , 2017, ArXiv.

[9]  Evgeny Andriyash,et al.  Can quantum Monte Carlo simulate quantum annealing , 2017, 1703.09277.

[10]  Daniel A. Lidar,et al.  Non-stoquastic Hamiltonians in quantum annealing via geometric phases , 2017, npj Quantum Information.

[11]  Gene Wagenbreth,et al.  Off-diagonal expansion quantum Monte Carlo. , 2017, Physical review. E.

[12]  David Gosset,et al.  Polynomial-time classical simulation of quantum ferromagnets , 2016, Physical review letters.

[13]  M. Troyer,et al.  Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass , 2016, 1609.06558.

[14]  H. Neven,et al.  Scaling analysis and instantons for thermally assisted tunneling and quantum Monte Carlo simulations , 2016, 1603.01293.

[15]  Umesh Vazirani,et al.  Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D , 2016, Communications in Mathematical Physics.

[16]  S. Jordan,et al.  Adiabatic optimization versus diffusion Monte Carlo methods , 2016, 1607.03389.

[17]  Aram Wettroth Harrow,et al.  Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[18]  W. V. Dam,et al.  Spectral-gap analysis for efficient tunneling in quantum adiabatic optimization , 2016, 1601.01720.

[19]  Wim van Dam,et al.  Quantum Monte Carlo simulations of tunneling in quantum adiabatic optimization , 2016 .

[20]  E. Crosson,et al.  The performance of the quantum adiabatic algorithm on spike Hamiltonians , 2015, 1511.06991.

[21]  Daniel A. Lidar,et al.  Tunneling and speedup in quantum optimization for permutation-symmetric problems , 2015, 1511.03910.

[22]  BravyiSergey.  Monte Carlo simulation of stoquastic hamiltonians , 2015 .

[23]  U. Vazirani,et al.  A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians , 2015, Nature Physics.

[24]  Sergey Bravyi,et al.  Monte Carlo simulation of stoquastic Hamiltonians , 2014, Quantum Inf. Comput..

[25]  M. Hastings,et al.  On Complexity of the Quantum Ising Model , 2014, 1410.0703.

[26]  Cedric Yen-Yu Lin,et al.  Different Strategies for Optimization Using the Quantum Adiabatic Algorithm , 2014, 1401.7320.

[27]  Umesh Vazirani,et al.  A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians , 2013, 1307.5143.

[28]  Matthew B. Hastings,et al.  Obstructions to classically simulating the quantum adiabatic algorithm , 2013, Quantum Inf. Comput..

[29]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[30]  F. Martinelli,et al.  Glauber Dynamics for the Quantum Ising Model in a Transverse Field on a Regular Tree , 2011, 1105.5970.

[31]  Decay of Correlations for Quantum Spin Systems with a Transverse Field: A Dynamic Approach , 2010, 1005.3547.

[32]  M. Hastings.  Quantum adiabatic computation with a constant gap is not useful in one dimension. , 2009, Physical review letters.

[33]  Barbara M. Terhal,et al.  Complexity of Stoquastic Frustration-Free Hamiltonians , 2008, SIAM J. Comput..

[34]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[35]  F. Verstraete,et al.  Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems , 2008, 0907.2796.

[36]  David P. DiVincenzo,et al.  The complexity of stoquastic local Hamiltonian problems , 2006, Quantum Inf. Comput..

[37]  L. Stella,et al.  Quantum annealing of an Ising spin-glass by Green's function Monte Carlo. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  Eric Vigoda,et al.  Accelerating simulated annealing for the permanent and combinatorial counting problems , 2006, SODA '06.

[39]  Ben Reichardt,et al.  The quantum adiabatic optimization algorithm and local minima , 2004, STOC '04.

[40]  Erio Tosatti,et al.  Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model , 2002 .

[41]  E. Farhi,et al.  Quantum Adiabatic Evolution Algorithms versus Simulated Annealing , 2002, quant-ph/0201031.

[42]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[43]  R. Needs,et al.  Quantum Monte Carlo simulations of solids , 2001 .

[44]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[45]  A. Sandvik.  Stochastic series expansion method with operator-loop update , 1999, cond-mat/9902226.

[46]  H. Nishimori,et al.  Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.

[47]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[48]  B. Chakrabarti,et al.  Quantum Ising Phases and Transitions in Transverse Ising Models , 1996 .

[49]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[50]  M. Suzuki,et al.  Quantum statistical monte carlo methods and applications to spin systems , 1986 .

[51]  Sudip Chakravarty,et al.  Monte Carlo Simulation of Quantum Spin Systems , 1982 .

[52]  Seiji Miyashita,et al.  Monte Carlo Simulation of Quantum Spin Systems. I , 1977 .

[53]  W. Hoeffding.  Probability inequalities for sum of bounded random variables , 1963 .

[54]  K. Fan,et al.  Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators. , 1951, Proceedings of the National Academy of Sciences of the United States of America.