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

DOI10.1137/19M1287511zbMath1455.81015arXiv1906.08800OpenAlexW3113345238WikidataQ114074234 ScholiaQ114074234MaRDI QIDQ3387762

Barbara M. Terhal, Stephen Piddock, Milad Marvian, Joel Klassen, Marios Ioannou, Itay Hen

Publication date: 13 January 2021

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.08800

zbMATH Keywords

computational complexityquantumsign problemquantum Monte Carlo Copy pre-keywordstoquastic

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Clifford algebras, spinors (15A66) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• How quantum are non-negative wavefunctions?
• Complexity Classification of Local Hamiltonian Problems
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Complexity of Stoquastic Frustration-Free Hamiltonians
• The NP-Completeness of Edge-Coloring
• Realizable Hamiltonians for universal adiabatic quantum computers
• A Guide to Monte Carlo Simulations in Statistical Physics
• Unnamed Item
• Unnamed Item

This page was built for publication: Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians