Related papers: Monte Carlo simulation of stoquastic Hamiltonians
We study complexity of several problems related to the Transverse field Ising Model (TIM). First, we consider the problem of estimating the ground state energy known as the Local Hamiltonian Problem (LHP). It is shown that the LHP for TIM…
Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo…
We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its…
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…
The Ising model is a simple statistical model for ferromagnetism. There are analytic solutions for low dimensions and very efficient Monte Carlo methods, such as cluster algorithms, for simulating this model in special cases. However most…
Non-stoquastic Hamiltonians have both positive and negative signs in off-diagonal elements in their matrix representation in the standard computational basis and thus cannot be simulated efficiently by the standard quantum Monte Carlo…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians…
We study the structure of the ground states of local stoquastic Hamiltonians and show that under mild assumptions the following distributions can efficiently approximate one another: (a) distributions arising from ground states of…
We develop a classical Monte Carlo algorithm based on a quasi-classical approximation for a pseudospin S=1 Hamiltonian in real space to construct a phase diagram of a model cuprate with a high Tc. A model description takes into account both…
We propose a new Monte Carlo technique in which the degeneracy of energy states is obtained with a Markovian process analogous to that of Metropolis used currently in canonical simulations. The obtained histograms are much broader than…
There is a class of quantum Hamiltonians known as Rokhsar-Kivelson(RK)-Hamiltonians for which static ground state properties can be obtained by evaluating thermal expectation values for classical models. The ground state of an…
The quantum phase transition of the one-dimensional long-range transverse-field Ising model is explored by combining the quantum Monte Carlo method and stochastic parameter optimization, specifically achieved by tuning correlation ratios so…
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
We propose a novel quantum Monte Carlo method in configuration space, which stochastically samples the contribution from a large secondary space to the effective Hamiltonian in the energy dependent partitioning of L\"owdin. The method…
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…
The vision of building computational hardware for problem optimization has spurred large efforts in the physics community. In particular, networks of Kerr parametric oscillators (KPOs) are envisioned as simulators for finding the ground…
We propose a new type of Monte Carlo approach in numerical studies of quantum systems. Introducing a probability function which determines whether a state in the vector space survives or not, we can evaluate expectation values of powers of…
A classical Monte Carlo algorithm based on the quasi-classical approximation is applied to the pseudospin Hamiltonian of the model cuprate. The model takes into account both local and non-local correlations, Heisenberg spin-exchange…
We study the complexity of the Local Hamiltonian Problem (denoted as LH-MIN) in the special case when a Hamiltonian obeys conditions of the Perron-Frobenius theorem: all off-diagonal matrix elements in the standard basis are real and…
The Ising model with a transverse field and an antiferromagnetic transverse interaction is represented as a matrix in the computational basis with non-zero off-diagonal elements with both positive and negative signs and thus may be regarded…