相关论文: Application of Bootstrap to $\theta$-term

We study cluster perturbation theory [Phys. Rev. Lett. \textbf{84}, 522 (2000)] when auxiliary field quantum Monte Carlo method is used for solving the cluster hamiltonian. As a case study, we calculate the spectral functions of the Hubbard…

A method for analytic continuation of imaginary-time correlation functions (here obtained in quantum Monte Carlo simulations) to real-frequency spectral functions is proposed. Stochastically sampling a spectrum parametrized by a large…

We solve a variety of sign problems for models in lattice field theory using the Hamiltonian formulation, including Yukawa models and simple lattice gauge theories. The solutions emerge naturally in continuous time and use the dual…

This manuscript discusses computation of the Partition Function (PF) and the Minimum Weight Perfect Matching (MWPM) on arbitrary, non-bipartite graphs. We present two novel problem formulations - one for computing the PF of a Perfect…

We present novel Monte Carlo methods for treating the interacting shell model that allow exact calculations much larger than those heretofore possible. The two-body interaction is linearized by an auxiliary field; Monte Carlo evaluation of…

We demonstrate that combining the positivity of density matrices with steady-state conditions yields a systematic bootstrap method for studying open quantum many-body systems governed by Lindblad master equations on infinite lattices, which…

Quantum Monte Carlo simulations are powerful and versatile tools for the quantum many-body problem. In addition to the usual calculations of energies and eigenstate observables, quantum Monte Carlo simulations can in principle be used to…

A bootstrap approach to the effective action in quantum field theory is discussed which entails the invariance under quantum fluctuations of the effective action describing physical reality (via the S-matrix).

Recently, we have proposed a novel approach (arxiv:1205.3996) to deal with the sign problem that hinders Monte Carlo simulations of many quantum field theories (QFTs). The approach consists in formulating the QFT on a Lefschetz thimble. In…

Modern problems in statistics tend to include estimators of high computational complexity and with complicated distributions. Statistical inference on such estimators usually relies on asymptotic normality assumptions, however, such…

Stoquastic Hamiltonians are characterized by the property that their off-diagonal matrix elements in the standard product basis are real and non-positive. Many interesting quantum models fall into this class including the Transverse field…

It is shown that a class of separately frustration-free (SFF) Hamiltonians can be Monte Carlo simulated efficiently on a classical computing machine, because such an SFF Hamiltonian corresponds to a Gibbs wavefunction whose nodal structure…

A Path Integral Monte Carlo method is used to investigate the thermodynamics of nuclear like systems. Systems composed of bosons or fermions interracting via a Lennard-Jones potential with periodic boundary conditions were simulated and the…

In this paper, we present a framework for the analytic bootstrap of three-point energy correlators, a crucial observable in $\mathcal{N}=4$ super Yang-Mills theory and quantum chromodynamics (QCD). Our approach combines spherical contour…

We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole…

A Monte Carlo algorithm for computing quantum mechanical expectation values of coordinate operators in many body problems is presented. The algorithm, that relies on the forward walking method, fits naturally in a Green's Function Monte…

We introduce a quantum Monte Carlo inspired reweighting scheme to accurately compute energies from optimally short quantum circuits. This effectively hybrid quantum-classical approach features both entanglement provided by a short quantum…

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…

In this article, we discuss how a kind of hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Hartree-Fock electronic structure computation of molecules. In the proposed algorithm, we…

Designing and implementing algorithms for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learning techniques to train a quantum system such that the desired…