Fetching the paper…
Reading the bibliography…
Quantum de Finetti theorems are a useful tool in the study of correlations in quantum multipartite states.
Approximability and proof complexity
R. O’Donnell and Y. Zhou · 1958
Earlier work this paper cites.
On general minimax theorems
M. Sion · 1958
Earlier work this paper cites.
On the Einstein-Podolsky-Rosen paradox
J. Bell · 1964
Earlier work this paper cites.
Symmetric states of infinite tensor products of c-algebras
E. Størmer · 1969
Earlier work this paper cites.
Locally normal symmetric states and an analogue of de Finetti’s theorem
R. L. Hudson and G. R. Moody · 1976
Earlier work this paper cites.
Finite exchangeable sequences
P. Diaconis and D. Freedman · 1980
Earlier work this paper cites.
Experimental test of Bell’s inequalities using time- varying analyzers
A. Aspect, J. Dalibard, and G. Roger · 1982
Earlier work this paper cites.
Symmetric states of composite systems
M. Fannes, J. T. Lewis, and A. Verbeure · 1988
Earlier work this paper cites.
Quantum statistical mechanics of general mean field systems
G. A. Raggio and R. F. Werner · 1989
Earlier work this paper cites.
An application of Bell’s inequalities to a quantum state extension problem
R. F. Werner · 1989
Earlier work this paper cites.
Playing games of incomplete information
J.-Y. Cai, A. Condon, and R. Lipton · 1990
Earlier work this paper cites.
Non-deterministic exponential time has two-prover interactive protocols
L. Babai, L. Fortnow, and C. Lund · 1991
Earlier work this paper cites.
An Introduction to Computational Learning Theory
M. Kearns and U. Vazirani · 1994
Earlier work this paper cites.
On the role of shared randomness in two prover proof systems
M. Bellare, U. Feige, and J. Kilian · 1995
Earlier work this paper cites.
Mixed-state entanglement and quantum error correction
C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters · 1996
Earlier work this paper cites.
The strengths and weaknesses of quantum computation
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Proof verification and the hardness of approximation problems
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1998
Earlier work this paper cites.
Probabilistic checking of proofs: a new characterization of NP
S. Arora and S. Safra · 1998
Earlier work this paper cites.
Which problems have strongly exponential complexity?
R. Impagliazzo, R. Paturi, and F. Zane · 1998
Earlier work this paper cites.
Remarks on symmetries of trilinear forms
F. Cobos, T. Kühn, and J. Peetre · 2000
Earlier work this paper cites.
Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization
P. A. Parrilo · 2000
Earlier work this paper cites.
On the complexity of k-sat
R. Impagliazzo and R. Paturi · 2001
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
J. B. Lasserre · 2001
Earlier work this paper cites.
A new bound for Pólya’s theorem with applications to polynomials positive on polyhedra
V. Powers and B. Reznick · 2001
Earlier work this paper cites.
Unknown quantum states: The quantum de Finetti representation
C. M. Caves, C. A. Fuchs, and R. Schack · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
Quantum multi-prover interactive proof systems with limited prior entanglement
H. Kobayashi and K. Matsumoto · 2003
Earlier work this paper cites.
Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?
H. Kobayashi, K. Matsumoto, and T. Yamakami · 2003
Earlier work this paper cites.
Symmetric extensions of quantum states and local hidden variable theories
B. M. Terhal, A. C. Doherty, and D. Schwab · 2003
Earlier work this paper cites.
Consequences and limits of nonlocal strategies
R. Cleve, P. Hoyer, B. Toner, and J. Watrous · 2004
Earlier work this paper cites.
Complete family of separability criteria
A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri · 2004
Earlier work this paper cites.
A de Finetti representation for finite symmetric quantum states
R. Koenig and R. Renner · 2005
Earlier work this paper cites.
Quantum Arthur-Merlin games
C. Marriott and J. Watrous · 2005
Cited alongside, same era.
Security of quantum key distribution
R. Renner · 2005
Cited alongside, same era.
General properties of nonsignaling theories
N. G. Ll. Masanes, A. Acin · 2006
Cited alongside, same era.
Entanglement in interactive proof systems with binary answers
S. Wehner · 2006
Cited alongside, same era.
A simple proof of monogamy of entanglement
D. Yang · 2006
Cited alongside, same era.
The learnability of quantum states
S. Aaronson · 2007
Cited alongside, same era.
One-and-a-half quantum de Finetti theorems
M. Christandl, R. König, G. Mitchison, and R. Renner · 2007
A generalization of quantum Stein’s lemma
F. G. Brandão and M. B. Plenio · 2010
Later among the works it cites.
Short multi-prover quantum proofs for SAT without entangled measurements, 2010, arXiv:1011.0716
J. Chen and A. Drucker · 2010
Later among the works it cites.
An efficient test for product states, with applications to quantum Merlin-Arthur games
A. W. Harrow and A. Montanaro · 2010
Later among the works it cites.
Polynomial-space approximation of no-signaling provers
T. Ito · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Computational complexity of the quantum separability problem
L. Ioannou · 2007
Cited alongside, same era.
Symmetry implies independence
R. Renner · 2007
Cited alongside, same era.
Entanglement Theory and the Quantum Simulation of Many-Body Physics
F. Brandão · 2008
Cited alongside, same era.
The complexity of optimizing over a simplex, hypercube or sphere: A short survey
E. de Klerk · 2008
Cited alongside, same era.
The quantum moment problem and bounds on entangled multi-prover games
A. C. Doherty, Y.-C. Liang, B. Toner, and S. Wehner · 2008
Cited alongside, same era.
J. Kempe, O. Regev, and B. Toner · 2010
Later among the works it cites.
F. Brandão and M. Christandl · 2011
Later among the works it cites.
A quasipolynomial-time algorithm for the quantum separability problem
F. G. Brandão, M. Christandl, and J. Yard · 2011
Later among the works it cites.
Faithful squashed entanglement
F. G. S. L. Brandão, M. Christandl, and J. Yard · 2011
Later among the works it cites.
Near-optimal and explicit Bell inequality violations
H. Buhrman, O. Regev, G. Scarpa, and R. de Wolf · 2011
Later among the works it cites.
The complexity of the separable Hamiltonian problem, 2011, arXiv:1111.5247
A. Chailloux and O. Sattath · 2011
Later among the works it cites.
QMA variants with polynomially many provers, 2011, arXiv:1108.0617
S. Gharibian, J. Sikora, and S. Upadhyay · 2011
Later among the works it cites.
Entangled games are hard to approximate
J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick · 2011
Later among the works it cites.
Parallel repetition of entangled games
J. Kempe and T. Vidick · 2011
Later among the works it cites.
A two prover one round game with strong soundness
S. Khot and M. Safra · 2011
Later among the works it cites.
On the power of quantum computation over real Hilbert spaces, 2011, arXiv:1109.0795
M. McKague · 2011
Later among the works it cites.
Epsilon-net method for optimizations over separable states, 2011, arXiv:1112.0808
Y. Shi and X. Wu · 2011
Later among the works it cites.
Hypercontractivity, sum-of-squares proofs, and their applications
B. Barak, F. G. Brandão, A. W. Harrow, J. Kelner, D. Steurer, and Y. Zhou · 2012
Closest in time.
Iterative rounding for sum-of-squares relaxations, 2012
B. Barak, J. Kelner, and D. Steurer · 2012
Closest in time.
Convergence of SDP hierarchies for polynomial optimization on the hypersphere, 2012, arXiv:1210.5048
A. C. Doherty and S. Wehner · 2012
Closest in time.
Weak decoupling duality and quantum identification
P. Hayden and A. Winter · 2012
Closest in time.
A multi-prover interactive proof for NEXP sound against entangled provers
T. Ito and T. Vidick · 2012
Closest in time.
Distinguishing multi-partite states by local measurements, 2012, arXiv:1206.2884
C. Lancien and A. Winter · 2012
Closest in time.
On QMA protocols with two short quantum proofs
F. Le Gall, S. Nakagawa, and H. Nishimura · 2012
Closest in time.
Relative entropy and squashed entanglement, 2012, arXiv:1210.3181
K. Li and A. Winter · 2012
Closest in time.
Multi-prover quantum merlin-arthur proof systems with small gap, 2012, arXiv:1205.2761
A. Pereszlenyi · 2012
Closest in time.
Approximating CSPs with global cardinality constraints using SDP hierarchies
P. Raghavendra and N. Tan · 2012
Closest in time.
Product-state approximations to quantum ground states
F. G. S. L. Brandão and A. W. Harrow · 2013
Closest in time.
Testing product states, quantum Merlin-Arthur games and tensor optimization
A. W. Harrow and A. Montanaro · 2013
Closest in time.
Three-player entangled XOR games are NP-hard to approximate, 2013, arXiv:1302.1242
T. Vidick · 2013
Closest in time.
AM with multiple Merlins, 2014, arXiv:1401.6848
S. Aaronson, R. Impagliazzo, and D. Moshkovitz · 2014
Closest in time.
Rounding sum-of-squares relaxations
B. Barak, J. Kelner, and D. Steurer · 2014
Closest in time.
Improved soundness for QMA with multiple provers, 2011, arXiv:1108.2098
A. Chiesa and M. Forbes · 2098
Closest in time.