pith. sign in

arxiv: 1612.04785 · v1 · pith:WZBT2IEZnew · submitted 2016-12-14 · 🪐 quant-ph · cond-mat.dis-nn· cond-mat.stat-mech· stat.ML

Quantum Monte Carlo simulation of a particular class of non-stoquastic Hamiltonians in quantum annealing

classification 🪐 quant-ph cond-mat.dis-nncond-mat.stat-mechstat.ML
keywords quantumhamiltoniansnon-stoquasticproblemsimulationannealingclasscarlo
0
0 comments X
read the original abstract

Quantum annealing is a generic solver of the optimization problem that uses fictitious quantum fluctuation. Its simulation in classical computing is often performed using the quantum Monte Carlo simulation via the Suzuki--Trotter decomposition. However, the negative sign problem sometimes emerges in the simulation of quantum annealing with an elaborate driver Hamiltonian, since it belongs to a class of non-stoquastic Hamiltonians. In the present study, we propose an alternative way to avoid the negative sign problem involved in a particular class of the non-stoquastic Hamiltonians. To check the validity of the method, we demonstrate our method by applying it to a simple problem that includes the anti-ferromagnetic XX interaction, which is a typical instance of the non-stoquastic Hamiltonians.

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 1 Pith paper

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

  1. 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.