Quantum interactive proofs and the complexity of separability testing

DOI10.4086/toc.2015.v011a003zbMath1336.68082arXiv1308.5788OpenAlexW3101305239WikidataQ59832473 ScholiaQ59832473MaRDI QIDQ2941643

Patrick Hayden, Mark M. Wilde, Gus Gutoski, Kevin Milner

Publication date: 21 August 2015

Published in: Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum entanglementBQPquantum complexity theoryquantum interactive proofsQMAQIPQSZKquantum statistical zero knowledgeseparability testing

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Quantum computation vs. firewalls ⋮ Epsilon-net method for optimizations over separable states ⋮ Dvoretzky's theorem and the complexity of entanglement detection

Cites Work

• Unnamed Item
• Quantum entanglement
• Universal Quantum Simulators
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Skepticism of quantum computing
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model