Dissipation and decoherence in quantum systems have important practical implications, from stabilizing superconductivity in granular materials, to the loss of information stored in qubits. In the models we consider in this chapter, energy dissipation is introduced by coupling a quantum mechanical degree of freedom to a bath of suitably chosen harmonic oscillators. The degrees of freedom of this bath can be integrated out analytically, which leads to an effective action with long-range interactions in imaginary time. We will review and present a number of recently developed efficient cluster Monte Carlo algorithms for various dissipative quantum systems. This chapter is based in large part on Refs. [1, 2] but has been updated with more recent developments, especially in the applications section.
Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.
Over the past several decades, computational approaches to studying strongly-interacting systems have become increasingly varied and sophisticated. This book provides a comprehensive introduction to state-of-the-art quantum Monte Carlo techniques relevant for applications in correlated systems. Providing a clear overview of variational wave functions, and featuring a detailed presentation of stochastic samplings including Markov chains and Langevin dynamics, which are developed into a discussion of Monte Carlo methods. The variational technique is described, from foundations to a detailed description of its algorithms. Further topics discussed include optimisation techniques, real-time dynamics and projection methods, including Green's function, reptation and auxiliary-field Monte Carlo, from basic definitions to advanced algorithms for efficient codes, and the book concludes with recent developments on the continuum space. Quantum Monte Carlo Approaches for Correlated Systems provides an extensive reference for students and researchers working in condensed matter theory or those interested in advanced numerical methods for electronic simulation.
The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of
(Nε−1)O(logΔ), where
N is the system size,
ε the desired precision, and
Δ the interaction-graph degree. This becomes particularly severe in long-range systems, where
Δ≡N, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime
O~(N4ε−3). For quantum partition functions at temperatures
β≤βsampling≡O(1), this improves to
O~(N3+1/Dε−3), where
D is the lattice dimension. The framework directly applies to long-range quantum systems with interactions
∝1/rα, including
2-local models with
α>2D.
Complex quantum phenomena can often be understood more easily by identifying a relevant system and an environment which interacts with the system. Numerically exact methods for these dissipative quantum systems are discussed with particular focus on their dynamics. Using the dissipative two‐state system and charge transport through a mesoscopic metallic island as illustrative examples, we present algorithms based on the importance sampling of Feynman path integrals as well as novel techniques relying on the numerical simulation of stochastic Liouville‐von Neumann equations.