A quasipolynomial-time algorithm for the quantum separability problem

Geometric algorithms and combinatorial optimization

M. Grötschel, L. Lovász, and A. Schrijver · 1993

Earlier work this paper cites.

Semidefinite programming

L. Vandenberghe and S. Boyd · 1996

Earlier work this paper cites.

Quantifying entanglement,

V. Vedral, M. B. Plenio, M. A. Rippin, and P. L. Knight · 1997

Earlier work this paper cites.

On the complexity of k k -SAT

R. Impagliazzo and R. Paturi · 2001

Earlier work this paper cites.

Quantum data hiding

D. P. DiVincenzo, D. W. Leung, and B. M. Terhal · 2002

Earlier work this paper cites.

Hiding classical data in multi-partite quantum states

T. Eggeling and R. F. Werner · 2002

Earlier work this paper cites.

Hiding quantum data

D. P. DiVincenzo, P. Hayden, and B. M. Terhal · 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.

“Squashed entanglement" - an additive entanglement measure

M. Christandl and A. Winter · 2004

Earlier work this paper cites.

A complete family of separability criteria

A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri · 2004

Earlier work this paper cites.

Classical complexity and quantum entanglement

L. Gurvits · 2004

Earlier work this paper cites.

Randomizing quantum states: Constructions and applications

P. Hayden, D. Leung, P. W. Shor, and A. Winter · 2004

Earlier work this paper cites.

Monogamy of entanglement and other correlations

M. Koashi and A. Winter · 2004

Cited alongside, same era.

Locking entanglement measures with a single qubit

K. Horodecki, M. Horodecki, P. Horodecki, and J. Oppenheim · 2005

Cited alongside, same era.

Quantum Arthur-Merlin games

C. Marriott and J. Watrous · 2005

Cited alongside, same era.

Finite size mean-field models

M. Fannes and C. Vandenplas · 2006

Cited alongside, same era.

Aspects of generic entanglement

P. Hayden, D. Leung, and A. Winter · 2006

Cited alongside, same era.

A quantum characterization of 𝖭𝖯 \mathsf{NP}

Original

H. Blier and A. Tapp · 2007

Cited alongside, same era.

Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding

W. Matthews, S. Wehner, and A. Winter · 2009

Later among the works it cites.

Quantum computational complexity

J. Watrous · 2009

Later among the works it cites.

Semidefinite programs for completely-bounded norms

J. Watrous · 2009

Later among the works it cites.

Optimal quantum source coding with quantum information at the encoder and decoder

J. Yard and I. Devetak · 2009

Later among the works it cites.

𝖭𝖯 \mathsf{NP} vs 𝖰𝖬𝖠 log ​ ( 2 ) \mathsf{QMA}_{\log}(2)

S. Beigi · 2010

Closest in time.

A generalization of quantum Stein’s lemma

F. G. S. L. Brandão and M. B. Plenio · 2010

Closest in time.