Shorter unentangled proofs for ground state connectivity

DOI10.1007/s11128-018-1944-4zbMath1448.81034arXiv1712.07400OpenAlexW3100982226WikidataQ113900600 ScholiaQ113900600MaRDI QIDQ1993802

Yanyan Li

Publication date: 5 November 2018

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

quantum complexityshort proofs\(\text{QMA}(2)\)ground state connectivity problem (GSCON)unentanglement

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum algorithms and complexity in the theory of computing (68Q12) Entanglement measures, concurrencies, separability criteria (81P42)

Cites Work

• A quantum characterization of NP
• Faithful squashed entanglement
• Ground State Connectivity of Local Hamiltonians
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• The PCP theorem by gap amplification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Shorter unentangled proofs for ground state connectivity