Related papers: Determining QMC simulability with geometric phases
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
Recently, the Hamilton Monte Carlo (HMC) has become widespread as one of the more reliable approaches to efficient sample generation processes. However, HMC is difficult to sample in a multimodal posterior distribution because the HMC chain…
The Sign Learning Kink (SiLK) based Quantum Monte Carlo (QMC) method is used to calculate the ab initio ground state energies for multiple geometries of the H$_{2}$O, N$_2$, and F$_2$ molecules. The method is based on Feynman's path…
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…
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that…
We present phaseless auxiliary-field (AF) quantum Monte Carlo (QMC) calculations of the ground states of some hydrogen-bonded systems. These systems were selected to test and benchmark different aspects of the new phaseless AF QMC method.…
Simulating computationally intractable many-body problems on a quantum simulator holds great potential to deliver insights into physical, chemical, and biological systems. While the implementation of Hamiltonian dynamics within a quantum…
All known examples confirming the possibility of an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (AQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric…
We study the high density region of QCD within an effective model obtained in the frame of the hopping parameter expansion and choosing Polyakov type of loops as the main dynamical variables representing the fermionic matter. To get a first…
Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Hamiltonian system. However, HMC is sensitive to large time…
Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum…
For decades now, low-energy models of QCD have shown indications that a crystalline quark phase could be stable at high chemical potentials. Beyond models, however, there are numerous difficulties in investigating such a hypothesis in full…
When one tries to simulate quantum spin systems by the Monte Carlo method, often the 'minus-sign problem' is encountered. In such a case, an application of probabilistic methods is not possible. In this paper the method has been proposed…
Quantum Monte Carlo (QMC) methods for the frustrated quantum spin systems occasionally suffer from the negative sign problem, which makes simulations exponentially harder for larger systems at lower temperatures and severely limits QMC's…
A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into…
Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard…
Exotic quantum phases and phase transition in the strongly interacting Dirac systems has attracted tremendous interests. On the other hand, non-Hermitian physics, usually associated with dissipation arising from the coupling to environment,…
The projective quantum Monte Carlo (PQMC) algorithms are among the most powerful computational techniques to simulate the ground state properties of quantum many-body systems. However, they are efficient only if a sufficiently accurate…
Simulating quantum dynamics is one of the central applications of quantum computing. For Hamiltonians written as a sum of many terms, deterministic Trotter--Suzuki product formulas can require applying a large number of term-wise evolutions…
We discuss designer Hamiltonians---lattice models tailored to be free from sign problems ("de-signed") when simulated with quantum Monte Carlo methods but which still host complex many-body states and quantum phase transitions of interest…