Fetching the paper…
Reading the bibliography…
We provide an alternative proof of \class{QIP}=\class{PSPACE} to the recent breakthrough result.
Zur theorie der gesellschaftsspiele
J. von Neumann · 1928
Earlier work this paper cites.
Minimax theorems
K. Fan · 1953
Earlier work this paper cites.
On relating time and space to size and depth
A. Borodin · 1977
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.
Multi-prover interactive proofs: how to remove intractability assumptions
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson · 1988
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
Earlier work this paper cites.
IP = = PSPACE
A. Shamir · 1992
Earlier work this paper cites.
IP = = PSPACE: simplified proof
A. Shen · 1992
Earlier work this paper cites.
Parallel linear algebra
J. von zur Gathen · 1993
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Making games short
U. Feige and J. Kilian · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, and N. Nisan · 1998
Cited alongside, same era.
PSPACE has constant-round quantum interactive proof systems
J. Watrous · 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. Kitaev, A. Shen, M. Vyalyi · 2002
Cited alongside, same era.
Quantum multi-prover interactive proof systems with limited prior entanglement
H. Kobayashi and K. Matsumoto · 2003
Cited alongside, same era.
Toward a general theory of quantum games
G. Gutoski and J. Watrous · 2007
Later among the works it cites.
Efficient algorithms using the multiplicative weights update method
S. Kale · 2007
Later among the works it cites.
Making classical honest verifier zero knowledge protocols secure against quantum attacks
S. Hallgren, A. Kolla, P. Sen, and S. Zhang · 2008
Later among the works it cites.
General properties of quantum zero-knowledge proofs
H. Kobayashi · 2008
Later among the works it cites.
Distinguishing Short Quantum Computations
B. Rosgen · 2008
Later among the works it cites.
Lecture Notes for Theory of Quantum Information
J. Watrous · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
S. Arora, E. Hazan, and S. Kale · 2005
Cited alongside, same era.
The multiplicative weights update method: a meta algorithm and applications. 2005
S. Arora, E. Hazan, and S. Kale · 2005
Cited alongside, same era.
Upper bounds for quantum interactive proofs with competing provers
G. Gutoski · 2005
Cited alongside, same era.
Quantum interactive proofs with competing provers
G. Gutoski and J. Watrous · 2005
Cited alongside, same era.
Quantum Arthur-Merlin games
C. Marriott and J. Watrous · 2005
Cited alongside, same era.
On the hardness of distinguishing mixed-state quantum computations
B. Rosgen and J. Watrous · 2005
Cited alongside, same era.
A. Ben-Aroya, A. Ta-Shma · 2009
Later among the works it cites.
Two-message quantum interactive proofs are in PSPACE
R. Jain, S. Upadhyay, and J. Watrous · 2009
Later among the works it cites.
Parallel approximation of non-interactive zero-sum quantum games
R. Jain and J. Watrous · 2009
Later among the works it cites.
Using entanglement in quantum multi-prover interactive proofs
J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick · 2009
Later among the works it cites.
Zero-knowledge against quantum attacks
J. Watrous · 2009
Later among the works it cites.
Semidefinite programs for completely bounded norms
J. Watrous · 2009
Later among the works it cites.
Short quantum games charaterize PSPACE
G. Gutoski and X. Wu · 2010
Closest in time.
QIP = PSPACE
R. Jain, Z. Ji, S. Upadhyay, and J. Watrous · 2010
Closest in time.