pith. sign in

arxiv: 1402.2295 · v2 · pith:IASVEDAEnew · submitted 2014-02-10 · 🪐 quant-ph

Monte Carlo simulation of stoquastic Hamiltonians

classification 🪐 quant-ph
keywords modelstatestoquasticclassicalgroundalgorithmcarloclass
0
0 comments X
read the original abstract

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 Ising Model (TIM), the Heisenberg model on bipartite graphs, and the bosonic Hubbard model. Here we consider the problem of estimating the ground state energy of a local stoquastic Hamiltonian $H$ with a promise that the ground state of $H$ has a non-negligible correlation with some `guiding' state that admits a concise classical description. A formalized version of this problem called Guided Stoquastic Hamiltonian is shown to be complete for the complexity class MA (a probabilistic analogue of NP). To prove this result we employ the Projection Monte Carlo algorithm with a variable number of walkers. Secondly, we show that the ground state and thermal equilibrium properties of the ferromagnetic TIM can be simulated in polynomial time on a classical probabilistic computer. This result is based on the approximation algorithm for the classical ferromagnetic Ising model due to Jerrrum and Sinclair (1993).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians

    quant-ph 2025-09 unverdicted novelty 8.0

    The Guided Local Hamiltonian problem for stoquastic Hamiltonians is promise BPP-hard (even 2-local on lattices), BQP-hard under fixed local constraints, and admits a deterministic classical approximation algorithm whe...

  2. Geometry-Induced Long-Range Correlations in Recurrent Neural Network Quantum States

    quant-ph 2026-04 conditional novelty 7.0

    Dilated RNN wave functions induce power-law correlations for the critical 1D transverse-field Ising model and the Cluster state, unlike the exponential decay of conventional RNN ansatze.

  3. RFOX (Rotated-Field Oscillatory eXchange) quantum algorithm: Towards Parameter-Free Quantum Optimizers

    quant-ph 2026-04 unverdicted novelty 7.0

    RFOX keeps the instantaneous spectral gap flat across interpolation and disorder by using a constant XX catalyst plus derived ZX counter-diabatic drive, yielding faster ground-state convergence on small RFIM instances.

  4. RFOX (Rotated-Field Oscillatory eXchange) quantum algorithm: Towards Parameter-Free Quantum Optimizers

    quant-ph 2026-04 unverdicted novelty 6.0

    RFOX maintains a flat spectral gap via non-stoquastic XX catalyst plus analytic counter-diabatic ZX driving, yielding near-optimal solutions on random-field Ising models with up to 10x fewer Trotter steps.

  5. On the Complexity of the Succinct State Local Hamiltonian Problem

    quant-ph 2025-09 unverdicted novelty 6.0

    The succinct state 2-local Hamiltonian problem for qubit Hamiltonians is promise-MA-complete.

  6. The Complexity of Local Stoquastic Hamiltonians on 2D Lattices

    quant-ph 2025-02 unverdicted novelty 5.0

    The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.