Engineering local optimality in quantum Monte Carlo algorithms
From MaRDI portal
Publication:2381271
Abstract: Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic models. Both algorithms work in the grand-canonical ensemble and have a non-zero winding number. However, they retain a lot of intrinsic degrees of freedom which can be used to optimize the algorithm. We let us guide by the rigorous statements on the globally optimal form of Markov chain Monte Carlo simulations in order to devise a locally optimal formulation of the worm algorithm while incorporating ideas from the directed loop algorithm. We provide numerical examples for the soft-core Bose-Hubbard model and various spin-S models.
Recommendations
- The quantum adiabatic optimization algorithm and local minima
- Optimal Monte Carlo and quantum algorithms for parametric integration.
- Quantum speedup of Monte Carlo methods
- Quantum stochastic optimization
- Optimization of quantum Monte Carlo wave function: steepest descent method
- Localization of Search in Quasi-Monte Carlo Methods for Global Optimization
- scientific article; zbMATH DE number 822321
- Quantum separation of local search and fixed point computation
- Quantum Separation of Local Search and Fixed Point Computation
Cites work
Cited in
(6)- Recent Developments of World-Line Monte Carlo Methods
- DSQSS: Discrete space quantum systems solver
- A classical fluctuation theory of the superfluid, Mott, and normal phases of correlated bosons
- Haldane insulator in the 1D nearest-neighbor extended Bose-Hubbard model with cavity-mediated long-range interactions
- A path integral ground state Monte Carlo algorithm for entanglement of lattice bosons
- Quantum phases of hardcore bosons with repulsive dipolar density-density interactions on two-dimensional lattices
This page was built for publication: Engineering local optimality in quantum Monte Carlo algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381271)