Fetching the paper…
Reading the bibliography…
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players' payoffs.
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.
Topics in Matrix Analysis
R. Horn and C. Johnson · 1991
Earlier work this paper cites.
Parallel linear algebra
J. von zur Gathen · 1993
Earlier work this paper cites.
A parallel approximation algorithm for positive linear programming
M. Luby and N. Nisan · 1993
Earlier work this paper cites.
On BPP and the polynomial-time hierarchy
R. Canetti · 1996
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.
Symmetric alternation captures BPP
A. Russell and R. Sundaram · 1998
Earlier work this paper cites.
A new protocol and lower bounds for quantum coin flipping
A. Ambainis · 2001
Cited alongside, same era.
Sequential and parallel algorithms for mixed packing and covering
N. Young · 2001
Cited alongside, same era.
Quantum coin-flipping
A. Kitaev · 2002
Cited alongside, same era.
Quantum protocol for cheat-sensitive weak coin flipping
R. Spekkens and T. Rudolph · 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.
Consequences and limits of nonlocal strategies
R. Cleve, P. Høyer, B. Toner, and J. Watrous · 2004
Cited alongside, same era.
Upper bounds for quantum interactive proofs with competing provers
G. Gutoski · 2005
Later among the works it cites.
Quantum interactive proofs with competing provers
G. Gutoski and J. Watrous · 2005
Later among the works it cites.
Matrix exponentiated gradient updates for on-line learning and Bregman projection
K. Tsuda, G. Rätsch, and M. Warmuth · 2005
Later among the works it cites.
A combinatorial, primal-dual approach to semidefinite programs
S. Arora and S. Kale · 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.
Efficient Algorithms Using the Multiplicative Weights Update Method
S. Kale · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Mochon · 2004
Cited alongside, same era.
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
S. Arora, E. Hazan, and S. Kale · 2005
Cited alongside, same era.
Quantum weak coin flipping with arbitrarily small bias
C. Mochon · 2007
Later among the works it cites.
Entangled games are hard to approximate
J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick · 2008
Closest in time.
Using entanglement in quantum multi-prover interactive proofs
J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick · 2008
Closest in time.