PSPACE has constant-round quantum interactive proof systems
Author:
- 1 January 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 292 (3) , 575-588
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- A proof of the security of quantum key distribution (extended abstract)2000
- Quantum circuits with mixed states1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Quantum ComputabilitySIAM Journal on Computing, 1997
- Elementary gates for quantum computationPhysical Review A, 1995
- A universal two-bit gate for quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Multi-prover interactive proofs: how to remove intractability1988
- Trading group theory for randomness1985