Related papers: Quantum Monte Carlo determinantal algorithm withou…
We present a quantum Monte-Carlo algorithm for computing the perturbative expansion in power of the coupling constant $U$ of the out-of-equilibrium Green's functions of interacting Hamiltonians of fermions. The algorithm extends the one…
We extend the recently proposed Time-Dependent Multi-Determinant approach (ref.[1]) to the description of fermionic propagators. The method hinges on equations of motions obtained using variational principles of Dirac type. In particular we…
Analog quantum simulation based on ultracold atoms in optical lattices has catalyzed significant breakthroughs in the study of quantum many-body systems. These simulations rely on the statistical sampling of electronic Fock states, which…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
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…
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
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…
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…
Quantum nanosystems involve the coupled dynamics of fermions or bosons across multiple scales in space and time. Examples include quantum dots, superconducting or magnetic nanoparticles, molecular wires, and graphene nanoribbons. The number…
We extend the scope of full configuration interaction quantum Monte Carlo (FCIQMC) to be applied to coupled fermion-boson hamiltonians, alleviating the a priori truncation in boson occupation which is necessary for many other wave function…
In this study we present an optimization method based on the quantum Monte Carlo diagonalization for many-fermion systems. Using the Hubbard-Stratonovich transformation, employed to decompose the interactions in terms of auxiliary fields,…
A review of the Loop Algorithm, its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a Quantum Monte Carlo procedure which employs nonlocal changes of worldline configurations,…
The path integral formulation of quantum mechanical problems including fermions is often affected by a severe numerical sign problem. We show how such a sign problem can be alleviated by a judiciously chosen constant imaginary offset to the…
In the absence of a fermion sign problem, auxiliary field (or determinantal) quantum Monte Carlo (DQMC) approaches have long been the numerical method of choice for unbiased, large-scale simulations of interacting many-fermion systems. More…
We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…
One bottleneck of quantum Monte Carlo (QMC) simulation of strongly correlated electron systems lies at the scaling relation of computational complexity with respect to the system sizes. For generic lattice models of interacting fermions,…
We propose a new projector quantum Monte-Carlo method to investigate the ground state of ultracold fermionic atoms modeled by a lattice Hamiltonian with on-site interaction. The many-body state is reconstructed from Slater determinants that…
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time…
We discuss the Fermion sign problem and, by examining a very general Hubbard-Stratonovich (HS) transformation, argue that the sign problem cannot be solved with such methods. We propose a different kind of transformation which, while not…
Strongly correlated fermionic systems are of great interest in condensed matter physics and numerical methods are indispensable tools for their study. However, existing approaches such as exact diagonalization (ED) and stochastic quantum…