Related papers: Stable and Efficient Algorithms for the Fermion De…
A possible solution of the notorious sign problem preventing direct Monte Carlo calculations for systems with non-zero chemical potential is to deform the integration region in the complex plane to a Lefschetz thimble. We investigate this…
This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections…
We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…
Finding the ground state of a fermionic Hamiltonian using quantum Monte Carlo is a very difficult problem, due to the Fermi sign problem. While still scaling exponentially, full configuration-interaction Monte Carlo (FCI-QMC) mitigates some…
In contrast to the determinant, no algorithm is known for the exact determination of the permanent of a square matrix that runs in time polynomial in its dimension. Consequently, non interacting fermions are classically efficiently…
We consider quantum spin chains with a hidden free fermionic structure, distinct from the Jordan-Wigner transformation and its generalizations. We express selected local operators with the hidden fermions. This way we can exactly solve the…
The recently developed density matrix quantum Monte Carlo (DMQMC) algorithm stochastically samples the N -body thermal density matrix and hence provides access to exact properties of many-particle quantum systems at arbitrary temperatures.…
We describe and discuss a recently proposed quantum Monte Carlo algorithm to compute the ground-state properties of various systems of interacting fermions. In this method, the ground state is projected from an initial wave function by a…
Quantum Monte Carlo (QMC) methods represent a powerful family of computational techniques for tackling complex quantum many-body problems and performing calculations of stationary state properties. QMC is among the most accurate and…
Improved staggered fermion formulations are a popular choice for lattice QCD calculations. Historically, the algorithm used for such calculations has been the inexact R algorithm, which has systematic errors that only vanish as the square…
In this paper, we show that there is a large class of fermionic systems for which it is possible to find, for any dimension, a finite closed set of eigenoperators and eigenvalues of the Hamiltonian. Then, the hierarchy of the equations of…
Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of…
Quantum Monte Carlo (QMC) is an advanced simulation methodology for studies of manybody quantum systems. In this review, we focus on the electronic structure QMC, i.e., methods relevant for systems described by the electron-ion…
We present a new quantum Monte Carlo algorithm suitable for generically complex problems, such as systems coupled to external magnetic fields or anyons in two spatial dimensions. We find that the choice of gauge plays a nontrivial role, and…
A new algorithm for simulation of theories with dynamical fermions is presented. The algorithm is based on obtaining the new configuration U' from the old one U by solving the equation M(U')\eta= \omega M(U)\eta, where M is fermionic…
A compression algorithm is introduced for multi-determinant wave functions which can greatly reduce the number of determinants that need to be evaluated in quantum Monte Carlo calculations. We have devised an algorithm with three levels of…
We describe a simple method to find the ground state energy without calculating the expectation value of the Hamiltonian in the time-evolving block decimation algorithm with tensor network states. For example, we consider quantum…
An overview over the current state of algorithms for dynamical fermion simulations is given. In particular some insight into the functioning of the determinant spitting techniques is discussed. The critical slowing down of the simulations…
Fermions are the building blocks of matter, forming atoms and nuclei, complex materials and neutron stars. Our understanding of many-fermion systems is however limited, as classical computers are often insufficient to handle the intricate…
We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…