Fetching the paper…
Reading the bibliography…
We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product.
Self-testing/correcting with applications to numerical problems
M. Blum, M. Luby, and R. Rubinfeld · 1993
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1993
Earlier work this paper cites.
“Event-ready-detectors” Bell experiment via entanglement swapping
M. Żukowski, A. Zeilinger, M. A. Horne, and A. K. Ekert · 1993
Earlier work this paper cites.
Separability of mixed states: necessary and sufficient conditions
M. Horodecki, P. Horodecki, and R. Horodecki · 1996
Earlier work this paper cites.
Separability criterion for density matrices
A. Peres · 1996
Earlier work this paper cites.
Stabilisation of quantum computations by symmetrisation
A. Barenco, A. Berthiaume, D. Deutsch, A. Ekert, R. Jozsa, and C. Macchiavello · 1997
Earlier work this paper cites.
Quantum channel capacity of very noisy channels
D. P. DiVincenzo, P. W. Shor, and J. A. Smolin · 1998
Earlier work this paper cites.
A new proof of Szeméredi’s theorem for progressions of length four
W. T. Gowers · 1998
Earlier work this paper cites.
Strong converse to the quantum channel coding theorem
T. Ogawa and H. Nagaoka · 1999
Earlier work this paper cites.
Coding theorem and strong converse for quantum channels
A. Winter · 1999
Earlier work this paper cites.
On some additivity problems in quantum information theory
G. G. Amosov, A. S. Holevo, and R. F. Werner · 2000
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.
Quantum computation and quantum information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Bell inequalities and the separability criterion
B. M. Terhal · 2000
Earlier work this paper cites.
Quantum fingerprinting
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf · 2001
Earlier work this paper cites.
The art of uninformed decisions: A primer to property testing
E. Fischer · 2001
Earlier work this paper cites.
A new proof of Szeméredi’s theorem
W. T. Gowers · 2001
Earlier work this paper cites.
On the complexity of k-SAT
R. Impagliazzo and R. Paturi · 2001
Earlier work this paper cites.
Irreversibility in asymptotic manipulations of entanglement
G. Vidal and J. I. Cirac · 2001
Earlier work this paper cites.
Counterexample to an additivity conjecture for output purity of quantum channels
A. S. Holevo and R. F. Werner · 2002
Earlier work this paper cites.
Counterexample to an additivity conjecture for output purity of quantum channels
R. F. Werner and A. S. Holevo · 2002
Earlier work this paper cites.
Classical deterministic complexity of Edmonds’ problem and quantum entanglement
L. Gurvits · 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.
Geometric measure of entanglement and applications to bipartite and multipartite quantum states
T. Wei and P. Goldbart · 2003
Earlier work this paper cites.
Complete hierarchies of efficient approximations to problems in entanglement theory
J. Eisert, P. Hyllus, O. Gühne, and M. Curty · 2004
Earlier work this paper cites.
Tensor decomposition and approximation schemes for constraint satisfaction problems
W. F. de la Vega, M. Karpinski, R. Kannan, and S. Vempala · 2005
Cited alongside, same era.
Quantum Arthur-Merlin games
C. Marriott and J. Watrous · 2005
Cited alongside, same era.
Some new results and applications of additivity problem of quantum channel
K. Matsumoto · 2005
Cited alongside, same era.
Concurrence of mixed multipartite quantum states
F. Mintert, M. Kuś, and A. Buchleitner · 2005
Cited alongside, same era.
Security of quantum key distribution
R. Renner · 2005
Cited alongside, same era.
Irreversibility for all bound entangled states
D. Yang, M. Horodecki, R. Horodecki, and B. Synak-Radtke · 2005
Cited alongside, same era.
Random tensors and planted cliques
S. Brubaker and S. Vempala · 2009
Later among the works it cites.
A. Grudka, M. Horodecki, and L. Pankowski · 2009
Later among the works it cites.
O. Gühne and G. Toth · 2009
Later among the works it cites.
A counterexample to additivity of minimum output entropy
M. B. Hastings · 2009
Later among the works it cites.
Quantum entanglement
R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Multiplicativity of completely bounded p-norms implies a new additivity result
I. Devetak, M. Junge, C. King, and M. B. Ruskai · 2006
Cited alongside, same era.
Finite size mean-field models
M. Fannes and C. Vandenplas · 2006
Cited alongside, same era.
Experimental determination of entanglement with a single measurement
S. Walborn, P. Ribeiro, L. Davidovich, F. Mintert, and A. Buchleitner · 2006
Cited alongside, same era.
The learnability of quantum states
S. Aaronson · 2007
Cited alongside, same era.
Quantum algorithms for learning and testing juntas
A. Atici and R. A. Servedio · 2007
Cited alongside, same era.
Computational complexity of the quantum separability problem
L. M. Ioannou · 2007
Cited alongside, same era.
No strong parallel repetition with entangled and non-signaling provers, 2009
J. Kempe and O. Regev · 2009
Later among the works it cites.
Learning and testing algorithms for the Clifford group
R. A. Low · 2009
Later among the works it cites.
Future directions in tensor-based computation and modeling, 2009
C. van Loan · 2009
Later among the works it cites.
S. Beigi · 2010
Closest in time.
Short multi-prover quantum proofs for SAT without entangled measurements, 2010
J. Chen and A. Drucker · 2010
Closest in time.
Strong NP-hardness of the quantum separability problem
S. Gharibian · 2010
Closest in time.
A. Montanaro and T. Osborne · 2010
Closest in time.
Classification of Entanglement in Symmetric States
M. Aulbach · 2011
Closest in time.
Faithful squashed entanglement
F. G. S. L. Brandão, M. Christandl, and J. Yard · 2011
Closest in time.
A quasipolynomial-time algorithm for the quantum separability problem
F. G. S. L. Brandão, M. Christandl, and J. Yard · 2011
Closest in time.
The complexity of the separable Hamiltonian problem, 2011
A. Chailloux and O. Sattath · 2011
Closest in time.
QMA variants with polynomially many provers, 2011
S. Gharibian, J. Sikora, and S. Upadhyay · 2011
Closest in time.
On QMA protocols with two short quantum proofs, 2011
F. Le Gall, S. Nakagawa, and H. Nishimura · 2011
Closest in time.
On the power of quantum computation over real Hilbert spaces, 2011
M. McKague · 2011
Closest in time.
Property testing of unitary operators
G. Wang · 2011
Closest in time.
Hypercontractivity, sum-of-squares proofs, and their applications
B. Barak, F. G. S. L. Brandão, A. W. Harrow, J. Kelner, D. Steurer, and Y. Zhou · 2012
Closest in time.
Permutations are nearly orthogonal, 2012
A. W. Harrow · 2012
Closest in time.
Epsilon-net method for optimizations over separable states
Y. Shi and X. Wu · 2012
Closest in time.
On the complexity of computing zero-error and Holevo capacity of quantum channels, 2007
S. Beigi and P. Shor · 2090
Closest in time.
Improved soundness for QMA with multiple provers, 2011
A. Chiesa and M. Forbes · 2098
Closest in time.