Related papers: A quantum Monte Carlo algorithm for arbitrary high…

In this work we extend the notion of universal quantum Hamiltonians to the setting of translationally-invariant systems. We present a construction that allows a two-dimensional spin lattice with nearest-neighbour interactions, open…

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a…

This paper introduces a new Monte Carlo algorithm to invert large matrices. It is based on simultaneous coupled draws from two random vectors whose covariance is the required inverse. It can be considered a generalization of a previously…

We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. This enables…

Motivated by the unexpected Monte Carlo results as well as the theoretical proposal of a large correction to scaling for the critical theory of the 2-d staggered-dimer spin-1/2 Heisenberg model on the square lattice, we study the phase…

Manipulating Hamiltonians governing physical systems has found a broad range of applications, from quantum chemistry to semiconductor design. In this work, we provide a new way of manipulating Hamiltonians, by transforming their eigenvalues…

It is possible to simulate the dynamics of a single spin-$1/2$ ($\mathsf{PT~}$ symmetric) system by conveniently embedding it into a subspace of a larger Hilbert space with unitary dynamics. Our goal is to formulate a many body…

We introduce the Hamiltonian Monte Carlo Particle Swarm Optimizer (HMC-PSO), an optimization algorithm that reaps the benefits of both Exponentially Averaged Momentum PSO and HMC sampling. The coupling of the position and velocity of each…

We introduce a numerical algorithm to stochastically sample the dual fermion perturbation series around the dynamical mean field theory, generating all topologies of two-particle interaction vertices. We show results in the weak and strong…

We investigate a quantum non-relativistic system describing the interaction of two particles with spin 1/2 and spin 0, respectively. Assuming that the Hamiltonian is rotationally invariant and parity conserving we identify all such systems…

We present \texttt{ESpinS} (Esfahan Spin Simulation) package to evaluate the thermodynamic properties of spin systems described by a spin model Hamiltonian. In addition to the Heisenberg exchange term, the spin Hamiltonian can contain…

We show that the operators and the quadrupole and Zeeman Hamiltonians for a spin (3/2) can be represented in terms for a system of two coupling fictitious spins (1/2) using the Kronecker product of Pauli matrices. Particularly, the…

In this paper, we discover a new quantum Monte Carlo (QMC) method to solve the fermion sign problem in interacting fermion models by employing Majorana representation of complex fermions. We call it "Majorana QMC" (MQMC). Especially, MQMC…

We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dynamical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix.…

We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method --- the inchworm Monte Carlo method --- for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover,…

Probabilistic programming uses programs to express generative models whose posterior probability is then computed by built-in inference engines. A challenging goal is to develop general purpose inference algorithms that work out-of-the-box…

We report recent analytical progress in the quest for spin models realising exotic phases. We focus on the question of `reverse-engineering' a local, SU(2) invariant S=1/2 Hamiltonian to exhibit phases predicted on the basis of effective…

The main idea of this work is that the quantum-classical isomorphism is a suitable framework for a generalization of the notion of detailed balance. The quantum-classical isomorphism is used in order to develop a Monte Carlo simulation with…

Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…