Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians

@article{Klassen2020HardnessAE,
  title={Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians},
  author={Joel Klassen and M. Marvian and Stephen Piddock and Marios Ioannou and I. Hen and B. Terhal},
  journal={SIAM J. Comput.},
  year={2020},
  volume={49},
  pages={1332-1362}
}
We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard. This is shown by constructing a class of Hamiltonians for which performing this task is equivalent to deciding $3$-SAT. In contrast, we show that when such a Hamiltonian contains no one-local terms then this task is easy, namely we present an algorithm which… Expand

Figures from this paper

Validating a Two Qubit Non-Stoquastic Hamiltonian in Quantum Annealing
Determining QMC simulability with geometric phases.
  • I. Hen
  • Physics, Mathematics
  • 2020
Easing the Monte Carlo sign problem
De-Signing Hamiltonians for Quantum Adiabatic Optimization
Dynamical structure factors of dynamical quantum simulators
Intrinsic sign problem in fermionic and bosonic chiral topological matter
Intrinsic sign problems in topological quantum field theories
...
1
2
...

References

SHOWING 1-10 OF 36 REFERENCES
Two-local qubit Hamiltonians: when are they stoquastic?
Complexity of Stoquastic Frustration-Free Hamiltonians
Complexity Classification of Local Hamiltonian Problems
  • T. Cubitt, A. Montanaro
  • Mathematics, Computer Science
  • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • 2014
On the computational complexity of curing non-stoquastic Hamiltonians
Realizable Hamiltonians for Universal Adiabatic Quantum Computers
The complexity of stoquastic local Hamiltonian problems
Demonstration of a Nonstoquastic Hamiltonian in Coupled Superconducting Flux Qubits
Analysis and limitations of modified circuit-to-Hamiltonian constructions
Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass
The complexity of antiferromagnetic interactions and 2D lattices
...
1
2
3
4
...