On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems

DOI10.1109/FOCS.2011.58zbMath1292.68066arXiv1102.0770MaRDI QIDQ5494974

Lior Eldar, Dorit Aharonov

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

Non-commuting two-local Hamiltonians for quantum error suppression ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Total functions in QMA ⋮ Unnamed Item ⋮ Classifying data using near-term quantum devices ⋮ The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) ⋮ Unnamed Item ⋮ Complexity Classification of Local Hamiltonian Problems ⋮ Product-state approximations to quantum states ⋮ Perturbation gadgets: arbitrary energy scales from a single strong interaction

This page was built for publication: On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems