Related papers: A quantum Monte Carlo algorithm for Bose-Hubbard m…
We present a method for direct hybrid Monte Carlo simulation of graphene on the hexagonal lattice. We compare the results of the simulation with exact results for a unit hexagonal cell system, where the Hamiltonian can be solved…
We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
We study the pseudogap Bose-Fermi Anderson model with a continuous-time quantum Monte Carlo (CT-QMC) method. We discuss some delicate aspects of the transformation from this model to the Bose-Fermi Kondo model. We show that the CT-QMC…
Hamiltonian Monte Carlo (HMC) is an efficient Bayesian sampling method that can make distant proposals in the parameter space by simulating a Hamiltonian dynamical system. Despite its popularity in machine learning and data science, HMC is…
This article outlines how the quantum Monte Carlo directed loop update recently introduced can be applied to a wide class of quantum lattice models. Several models are considered: Spin-S XXZ models with longitudinal and transverse magnetic…
In this work, we decompose the time-evolution of the Bose-Hubbard model into a sequence of logic gates that can be implemented on a continuous-variable photonic quantum computer. We examine the structure of the circuit that represents this…
High-energy physics simulations traditionally rely on classical Monte Carlo methods to model complex particle interactions, often incurring significant computational costs. In this paper, we introduce a novel quantum-enhanced simulation…
We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…
We present a Hamiltonian Monte Carlo algorithm to sample from multivariate Gaussian distributions in which the target space is constrained by linear and quadratic inequalities or products thereof. The Hamiltonian equations of motion can be…
Based on the scheme of variational Monte Carlo sampling, we develop an accurate and efficient two-dimensional tensor-network algorithm to simulate quantum lattice models. We find that Monte Carlo sampling shows huge advantages in dealing…
In order to solve quantum field theory in a non-perturbative way, Lagrangian lattice simulations have been very successful. Here we discuss a recently proposed alternative Hamiltonian lattice formulation - the Monte Carlo Hamiltonian. In…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…
We review the recent theoretical developments towards understanding the Mott phases and quantum phase transition of extended Bose-Hubbard models on lattices in two spatial dimensions . We focuss on the description of these systems using the…
A new algorithm for analytic continuation of noisy quantum Monte Carlo (QMC) data from the Matsubara domain to real frequencies is proposed. Unlike the widely used maximum-entropy (MaxEnt) procedure, our method is linear with respect to…
We present an algorithm for the analytic continuation of imaginary-time quantum Monte Carlo data which is strictly based on principles of Bayesian statistical inference. Within this framework we are able to obtain an explicit expression for…
Using the framework of Tutte embeddings, we begin an exploration of \emph{quantum graph drawing}, which uses quantum computers to visualize graphs. The main contributions of this paper include formulating a model for quantum graph drawing,…
We present the first practical Monte Carlo calculations of the recently proposed Lefschetz thimble formulation of quantum field theories. Our results provide strong evidence that the numerical sign problem that afflicts Monte Carlo…
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…
The cavity method is a well established technique for solving classical spin models on sparse random graphs (mean-field models with finite connectivity). Laumann et al. [arXiv:0706.4391] proposed recently an extension of this method to…