Two-Message Quantum Interactive Proofs Are in PSPACE

DOI10.1109/FOCS.2009.30zbMath1292.68068OpenAlexW2161327939MaRDI QIDQ5171198

John Watrous, Rahul Jain, Sarvagya Upadhyay

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2009.30

Mathematics Subject Classification ID

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

Related Items (10)

New Limits to Classical and Quantum Instance Compression ⋮ Quantum hedging in two-round prover-verifier interactions ⋮ Quantum coin hedging, and a counter measure ⋮ Parallel approximation of min-max problems ⋮ QMA with Subset State Witnesses ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ QMA with Subset State Witnesses ⋮ Public-key cryptography based on bounded quantum reference frames ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Process tomography for unitary quantum channels

This page was built for publication: Two-Message Quantum Interactive Proofs Are in PSPACE