Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCluster Monte Carlo Algorithms for Dissipative Quantum Systems
115
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We review efficient Monte Carlo methods for simulating quantum systems which couple to a dissipative environment. A brief introduction of the Caldeira-Leggett model and the Monte Carlo method will be followed by a detailed discussion of cluster algorithms and the treatment of long-range interactions. Dissipative quantum spins and resistively shunted Josephson junctions will be considered.
rate research
Read More
We generalize the rejection-free event-chain Monte Carlo algorithm from many particle systems with pairwise interactions to systems with arbitrary three- or many-particle interactions. We introduce generalized lifting probabilities between particles and obtain a general set of equations for lifting probabilities, the solution of which guarantees maximal global balance. We validate the resulting three-particle event-chain Monte Carlo algorithms on three different systems by comparison with conventional local Monte Carlo simulations: (i) a test system of three particles with a three-particle interaction that depends on the enclosed triangle area; (ii) a hard-needle system in two dimensions, where needle interactions constitute three-particle interactions of the needle end points; (iii) a semiflexible polymer chain with a bending energy, which constitutes a three-particle interaction of neighboring chain beads. The examples demonstrate that the generalization to many-particle interactions broadens the applicability of event-chain algorithms considerably.
Machine learning is becoming widely used in analyzing the thermodynamics of many-body condensed matter systems. Restricted Boltzmann Machine (RBM) aided Monte Carlo simulations have sparked interest recently, as they manage to speed up classical Monte Carlo simulations. Here we employ the Convolutional Restricted Boltzmann Machine (CRBM) method and show that its use helps to reduce the number of parameters to be learned drastically by taking advantage of translation invariance. Furthermore, we show that it is possible to train the CRBM at smaller lattice sizes, and apply it to larger lattice sizes. To demonstrate the efficiency of CRBM we apply it to the paradigmatic Ising and Kitaev models in two-dimensions.
Efficient sampling of complex high-dimensional probability densities is a central task in computational science. Machine Learning techniques based on autoregressive neural networks have been recently shown to provide good approximations of probability distributions of interest in physics. In this work, we propose a systematic way to remove the intrinsic bias associated with these variational approximations, combining it with Markov-chain Monte Carlo in an automatic scheme to efficiently generate cluster updates, which is particularly useful for models for which no efficient cluster update scheme is known. Our approach is based on symmetry-enforced cluster updates building on the neural-network representation of conditional probabilities. We demonstrate that such finite-cluster updates are crucial to circumvent ergodicity problems associated with global neural updates. We test our method for first- and second-order phase transitions in classical spin systems, proving in particular its viability for critical systems, or in the presence of metastable states.
We consider quantum nonlinear systems with dissipation described within the Caldeira-Leggett model, i.e., by a nonlocal action in the path integral for the density matrix. Approximate classical-like formulas are derived in order to evaluate thermal averages of observables: the cases of linear and nonlinear dissipation are considered, and the framework is extended to the case of many degrees of freedom.
We present a rigorous efficient event-chain Monte Carlo algorithm for long-range interacting particle systems. Using a cell-veto scheme within the factorized Metropolis algorithm, we compute each single-particle move with a fixed number of operations. For slowly decaying potentials such as Coulomb interactions, screening line charges allow us to take into account periodic boundary conditions. We discuss the performance of the cell-veto Monte Carlo algorithm for general inverse-power-law potentials, and illustrate how it provides a new outlook on one of the prominent bottlenecks in large-scale atomistic Monte Carlo simulations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
