scientific article; zbMATH DE number 5899305

DOI10.4086/TOC.2011.V007A007MaRDI QIDQ3002832zbMATH OpenOpenAlexFDO

Authors Salman Beigi, John Watrous, Peter W. Shor

Publication date 24 May 2011

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2011.v007a007

zbMATH Keywords

quantum computationquantum de Finetti theoremquantum interactive proof systemsquantum state tomography

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• On quantum interactive proofs with short messages
• Quantum multiprover interactive proofs with communicating provers
• STACS 2005
• Quantum interactive proofs with weak error bounds
• Quantum interactive proofs and the complexity of separability testing
• On QMA protocols with two short quantum proofs
• scientific article; zbMATH DE number 1979492
• Constant-space quantum interactive proofs against multiple provers
• Interactive proofs with quantum finite automata

Cited in

(11)

• PSPACE has constant-round quantum interactive proof systems
• Shorter unentangled proofs for ground state connectivity
• Quantum proofs
• Stronger methods of making quantum interactive proofs perfectly complete
• Stronger methods of making quantum interactive proofs perfectly complete
• Generalized quantum Arthur-Merlin games
• Distinguishing short quantum computations
• On quantum interactive proofs with short messages
• STACS 2005
• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Faithful squashed entanglement

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002832)