Permutation matrix representation quantum Monte Carlo
From MaRDI portal
Abstract: We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its off-diagonal terms and is both parameter-free and Trotter error-free. In our approach, the quantum dimension consists of products of elements of a permutation group. As such, it allows for the study of a very wide variety of models on an equal footing. To demonstrate the utility of our technique, we use it to clarify the emergence of the sign problem in the simulations of non-stoquastic physical models. We showcase the flexibility of our algorithm and the advantages it offers over existing state-of-the-art by simulating transverse-field Ising model Hamiltonians and comparing the performance of our technique against that of the stochastic series expansion algorithm. We also study a transverse-field Ising model augmented with randomly chosen two-body transverse-field interactions.
Recommendations
- Quantum Monte Carlo methods. Algorithms for lattice models
- Transition-Matrix Monte Carlo Method for Quantum Systems
- Quantum speedup of Monte Carlo methods
- A quantum kinetic Monte Carlo method for quantum many-body spin dynamics
- Generalization of the Fortuin-Kasteleyn transformation and its application to quantum spin simulations.
Cites work
- scientific article; zbMATH DE number 5789115 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 1782878 (Why is no real title available?)
- scientific article; zbMATH DE number 2166298 (Why is no real title available?)
- scientific article; zbMATH DE number 3194199 (Why is no real title available?)
- A Guide to Monte Carlo Simulations in Statistical Physics
- Calculating the divided differences of the exponential function by addition and removal of inputs
- Off-diagonal series expansion for quantum partition functions
- Quantum Monte Carlo annealing with multi-spin dynamics
- The cold atom Hubbard toolbox
- The complexity of stoquastic local Hamiltonian problems
- Ultracold atoms in optical lattices. Simulating quantum many-body systems
Cited in
(5)- Calculating elements of matrix functions using divided differences
- scientific article; zbMATH DE number 1421047 (Why is no real title available?)
- Calculating the divided differences of the exponential function by addition and removal of inputs
- Advanced measurement techniques in quantum Monte Carlo: the permutation matrix representation approach
- A quantum Monte Carlo algorithm for arbitrary high-spin Hamiltonians
This page was built for publication: Permutation matrix representation quantum Monte Carlo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856858)