Fetching the paper…
Reading the bibliography…
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier.
Linear transformations which preserve trace and positive semidefiniteness of operators
A. Jamiołkowski · 1972
Earlier work this paper cites.
Completely positive linear maps on complex matrices
M.-D. Choi · 1975
Earlier work this paper cites.
Trading group theory for randomness
L. Babai · 1985
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
S. Goldwasser, S. Micali, and C. Rackoff · 1985
Earlier work this paper cites.
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes
L. Babai and S. Moran · 1988
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
S. Goldwasser, S. Micali, and C. Rackoff · 1989
Earlier work this paper cites.
Private coins versus public coins in interactive proof systems
S. Goldwasser and M. Sipser · 1989
Earlier work this paper cites.
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
O. Goldreich, S. Micali, and A. Wigderson · 1991
Earlier work this paper cites.
Algebraic methods for interactive proof systems
C. Lund, L. Fortnow, H. Karloff, and N. Nisan · 1992
Cited alongside, same era.
IP = = PSPACE
A. Shamir · 1992
Cited alongside, same era.
Cryptographic distinguishability measures for quantum-mechanical states
C. Fuchs and J. van de Graaf · 1999
Cited alongside, same era.
Parallelization, amplification, and exponential time simulation of quantum interactive proof system
A. Kitaev and J. Watrous · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Cited alongside, same era.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
A de Finetti representation for finite symmetric quantum states
R. König and R. Renner · 2005
Later among the works it cites.
Quantum Arthur-Merlin games
C. Marriott and J. Watrous · 2005
Later among the works it cites.
One-and-a-half quantum de Finetti theorems
M. Christandl, R. König, G. Mitchison, and R. Renner · 2007
Later among the works it cites.
Toward a general theory of quantum games
G. Gutoski and J. Watrous · 2007
Later among the works it cites.
Computational Complexity – A Conceptual Perspective
O. Goldreich · 2008
Later among the works it cites.
Complexity Theory: A Modern Approach
S. Arora and B. Barak · 2009
Later among the works it cites.
QIP = PSPACE
R. Jain, Z. Ji, S. Upadhyay, and J. Watrous · 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Watrous · 2002
Cited alongside, same era.
Later among the works it cites.