Related papers: Pseudoparticle vertex solver for quantum impurity …
We present a very efficient solver for the general Anderson impurity problem. It is based on the perturbation around a solution obtained from exact diagonalization using a small number of bath sites. We formulate a perturbation theory which…
We present a new approach for Monte Carlo simulations of lattice quantum spin systems which is able to eliminate the negative sign problem. Its complexity is linear in the volume of the lattice. Its efficiency is tested on a simple…
The diagramatic Monte Carlo method has so far been primarily used in connection with the weak coupling expansion. Here we show that the strong coupling expansion offers a significant advantage: it can be efficiently implemented on both the…
We present an impurity solver based on adaptively truncated Hilbert spaces. The solver is particularly suitable for dynamical mean-field theory in circumstances where quantum Monte Carlo approaches are ineffective. It exploits the sparsity…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
We investigate the attractive Fermi polaron problem in two dimensions using non-perturbative Monte Carlo simulations. We introduce a new Monte Carlo algorithm called the impurity lattice Monte Carlo method. This algorithm samples the path…
We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models via the non-Abelian ab initio version of the density matrix renormalization group method on state-of-the-art…
In this work we solve the sign problem of a frustrated quantum impurity model consisting of three quantum spin-half chains interacting through an anti-ferromagnetic Heisenberg interaction at one end. We first map the model into a repulsive…
We present ComCTQMC, a GPU accelerated quantum impurity solver. It uses the continuous-time quantum Monte Carlo (CTQMC) algorithm wherein the partition function is expanded in terms of the hybridisation function (CT-HYB). ComCTQMC supports…
We experimentally study the two-dimensional Fermi-Hubbard model using a Rydberg-based quantum processing unit in the analog mode. Our approach avoids encoding directly the original fermions into qubits and instead relies on reformulating…
Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its application to most fermion systems…
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based…
Current nonequilibrium Monte Carlo methods suffer from a dynamical sign problem that makes simulating real-time dynamics for long times exponentially hard. We propose a new `Inchworm Algorithm', based on iteratively reusing information…
A simple impurity solver is shown to capture the impurity-induced superconducting subgap states in quantitative agreement with the numerical renormalization group and quantum Monte-Carlo simulations. The solver is based on the exact…
We develop a strong-coupling perturbation scheme for a generic Hubbard model around a half-filled particle-hole-symmetric reference system, which is free from the fermionic sign problem. The approach is based on the lattice determinantal…
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…
A previously-developed hybrid particle-continuum method [J. B. Bell, A. Garcia and S. A. Williams, SIAM Multiscale Modeling and Simulation, 6:1256-1280, 2008] is generalized to dense fluids and two and three dimensional flows. The scheme…
Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further understanding of essential features in such systems. Quantum Monte Carlo…
We present an efficient separation of variables algorithm for the evaluation of imaginary time Feynman diagrams appearing in the bold pseudo-particle strong coupling expansion of the Anderson impurity model. The algorithm uses a fitting…