Related papers: Loop algorithms for quantum simulations of fermion…
We suggest and implement a new Monte Carlo strategy for correlated models involving fermions strongly coupled to classical degrees of freedom, with accurate handling of quenched disorder as well. Current methods iteratively diagonalise the…
Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to…
We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest. Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of…
Rydberg atom arrays have emerged as a powerful platform to simulate a number of exotic quantum ground states and phase transitions. To verify these capabilities numerically, we develop a versatile quantum Monte Carlo sampling technique…
A classical Monte Carlo algorithm based on the quasi-classical approximation is applied to the pseudospin Hamiltonian of the model cuprate. The model takes into account both local and non-local correlations, Heisenberg spin-exchange…
The loop gas approach to lattice field theory provides an alternative, geometrical description in terms of fluctuating loops. Statistical ensembles of random loops can be efficiently generated by Monte Carlo simulations using the worm…
Many experimentally-accessible, finite-sized interacting quantum systems are most appropriately described by the canonical ensemble of statistical mechanics. Conventional numerical simulation methods either approximate them as being coupled…
Exponential observables, formulated as $\log \langle e^{\hat{X}}\rangle$ where $\hat{X}$ is an extensive quantity, play a critical role in study of quantum many-body systems, examples of which include the free-energy and entanglement…
The complicated ways in which electrons interact in many-body systems such as molecules and materials have long been viewed through the lens of local electron correlation and associated correlation functions. However, quantum information…
We report the results of simulations of the Lebwohl-Lasher model of the nematic-isotropic transition using a new cluster Monte Carlo algorithm. The algorithm is a modification of the Wolff algorithm for spin systems, and greatly reduces…
We introduce fast algorithms for correlation clustering with respect to the Min Max objective that provide constant factor approximations on complete graphs. Our algorithms are the first purely combinatorial approximation algorithms for…
We present a sub-matrix update algorithm for the continuous-time auxiliary field method that allows the simulation of large lattice and impurity problems. The algorithm takes optimal advantage of modern CPU architectures by consistently…
Recent work has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian $H$ for a given simulation problem into subsets $A$ and $B$ such that $H=A+B$, where the terms in $A$ are simulated with a…
On the basis of quantum Monte Carlo (QMC) simulations we study the formation of Mott domains in the one-dimensional Hubbard model with an additional confining potential. We find evidences of quantum critical behavior at the boundaries of…
Various physical models can be expressed in terms of matrices. A valuable tool for analysing matrix models is numerical simulations, often the Metropolis algorithm with various improvements. The downside of this approach is that the…
Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods to find optimal values for these parameters. Solving a quantum computational problem with such…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
Using a map between the Lindbladian evolution of dephasing in free fermions and the time evolution of imaginary-interaction Fermi-Hubbard models in bipartite lattices, we present an efficient classical algorithm to solve the Schr\"{o}dinger…
We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric…