Fetching the paper…
Reading the bibliography…
Assume Alice and Bob share some bipartite $d$-dimensional quantum state.
Can quantum-mechanical description of physical reality be considered complete?
A. Einstein, P. Podolsky, and N. Rosen · 1935
Earlier work this paper cites.
Positive definite functions on spheres
I. J. Schoenberg · 1942
Earlier work this paper cites.
Résumé de la théorie métrique des produits tensoriels topologiques
A. Grothendieck · 1953
Earlier work this paper cites.
Methods of Theoretical Physics, Part I
P. M. Morse and H. Feshbach · 1953
Earlier work this paper cites.
On the Einstein-Podolsky-Rosen paradox
J. S. Bell · 1964
Earlier work this paper cites.
Proposed experiment to test local hidden-variable theories
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt · 1969
Earlier work this paper cites.
Constantes de Grothendieck et fonctions de type positif sur les sphères
J. L. Krivine · 1979
Earlier work this paper cites.
Geometry. II
M. Berger · 1987
Earlier work this paper cites.
Quantum analogues of the Bell inequalities. The case of two spatially separated domains
B. S. Tsirelson · 1987
Earlier work this paper cites.
Bell’s inequality, information transmission, and prism models
T. Maudlin · 1992
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Cited alongside, same era.
A 7/8-approximation algorithm for MAX 3SAT?
H. Karloff and U. Zwick · 1997
Cited alongside, same era.
Cost of exactly simulating quantum entanglement with classical communication
G. Brassard, R. Cleve, and A. Tapp · 1999
Cited alongside, same era.
On randomized one-round communication complexity
I. Kremer, N. Nisan, and D. Ron · 1999
Cited alongside, same era.
Classical teleportation of a quantum bit
N. J. Cerf, N. Gisin, and S. Massar · 2000
Cited alongside, same era.
Towards quantifying non-local information transfer: finite-bit non-locality
M. Steiner · 2000
Cited alongside, same era.
Maximizing quadratic programs: extending Grothendieck’s inequality
M. Charikar and A. Wirth · 2004
Later among the works it cites.
On non-approximability for quadratic programs
S. Arora, E. Berger, E. Hazan, G. Kindler, and S. Safra · 2005
Later among the works it cites.
Simulating maximal quantum entanglement without communication
N. J. Cerf, N. Gisin, S. Massar, and S. Popescu · 2005
Later among the works it cites.
Simulating quantum correlations as a distributed sampling problem
J. Degorre, S. Laplante, and J. Roland · 2005
Later among the works it cites.
Quadratic forms on graphs
N. Alon, K. Makarychev, Y. Makarychev, and A. Naor · 2006
Later among the works it cites.
Approximating the cut-norm via Grothendieck’s inequality
N. Alon and A. Naor · 2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Classical simulation of quantum entanglement without local hidden variables
S. Massar, D. Bacon, N. J. Cerf, and R. Cleve · 2001
Cited alongside, same era.
A primer of real analytic functions
S. G. Krantz and H. R. Parks · 2002
Cited alongside, same era.
Violations of Bell inequalities as lower bounds on the communication cost of nonlocal correlations
S. Pironio · 2003
Cited alongside, same era.
Communication cost of simulating Bell correlations
B. F. Toner and D. Bacon · 2003
Cited alongside, same era.
How to simulate quantum correlations
D. Bacon and B. F. Toner
Cited in the paper.
On the multiple integral ∫ n d x 𝑑 y … 𝑑 z \int^{n}~dx~dy\ldots dz , whose limits are p 1 = a 1 x + b 1 y + ⋯ + h 1 z > 0 p_{1}=a_{1}x+b_{1}y+\cdots+h_{1}z>0 , p 2 > 0 p_{2}>0 ,…, p n > 0 p_{n}>0 , and x 2 + y 2 + ⋯ + z 2 < 1 x^{2}+y^{2}+\cdots+z^{2}<1
L. Schläfli
Cited in the paper.
Maximally nonlocal and monogamous quantum correlations
J. Barrett, A. Kent, and S. Pironio · 2006
Later among the works it cites.
Classical simulation of traceless binary observables on any bipartite quantum state
J. Degorre, S. Laplante, and J. Roland · 2007
Closest in time.
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Y. Shi and Y. Zhu · 2008
Closest in time.
Lower bound on the communication cost of simulating bipartite quantum correlations, 2009
T. Vértesi and E. Bene · 2009
Closest in time.