Fetching the paper…
Reading the bibliography…
Given the density matrix rho of a bipartite quantum state, the quantum separability problem asks whether rho is entangled or separable.
Discussion of probability relations between separated systems
E. Schrödinger · 1935
Earlier work this paper cites.
Maxima for graphs and a new proof of a theorem of Túran
T. S. Motzkin and E. G. Straus · 1965
Earlier work this paper cites.
Linear transformations which preserve trace and positive semi-definiteness of operators
A. Jamiołkowski · 1972
Earlier work this paper cites.
Completely positive linear maps on complex matrices
M.-D. Choi · 1975
Earlier work this paper cites.
Informational complexity and efficient methods for the solution of convex extremal problems (in Russian)
D. B. Yudin and A. S. Nemirovskii · 1976
Earlier work this paper cites.
Principles of Mathematical Analysis
W. Rudin · 1976
Earlier work this paper cites.
Computers and Intractability: A Guide to the theory of NP-completeness
M. R. Garey and D. S.Johnson · 1979
Earlier work this paper cites.
Pairs of two-level systems
U. Fano · 1983
Earlier work this paper cites.
Geometric Algorithms and Combinatorial Optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1988
Earlier work this paper cites.
Linear Representations of Groups
E. B. Vinberg · 1989
Earlier work this paper cites.
Quantum cryptography based on Bell’s theorem
A. Ekert · 1991
Earlier work this paper cites.
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
C. H. Bennett and S. J. Wiesner · 1992
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
C. Bennett, G. Brassard, C. Crépeau, R. Josza, A. Peres, and W. K. Wootters · 1993
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
P. Shor · 1994
Earlier work this paper cites.
Separability criterion for density matrices
A. Peres · 1996
Earlier work this paper cites.
Separability of mixed states: necessary and sufficient conditions
M. Horodecki, P. Horodecki, and R. Horodecki · 1996
Cited alongside, same era.
Mixed-state entanglement and quantum error correction
C. H. Bennett, D. P. DiVincezo, J. Smolin, and W. K. Wootters · 1996
Cited alongside, same era.
Hidden quantum nonlocality revealed by local filters
N. Gisin · 1996
Cited alongside, same era.
Substituting quantum entanglement for communication
R. Cleve and H. Buhrman · 1997
Cited alongside, same era.
Quantum telecomputation
L. K. Grover · 1997
Cited alongside, same era.
Quantifying entanglement
V. Vedral, M. B. Plenio, M. A. Rippin, and P. L. Knight · 1997
Cited alongside, same era.
The Bloch vector for N-level systems
G. Kimura · 2003
Later among the works it cites.
General entanglement breaking channels
M. Horodecki, P. W. Shor, and M. B. Ruskai · 2003
Later among the works it cites.
Qubit entanglement breaking channels
M. B. Ruskai · 2003
Later among the works it cites.
Maximal p-norms of entanglement breaking channels
C. King · 2003
Later among the works it cites.
Solving convex programs by random walks
D. Bertsimas and S. Vempala · 2004
Later among the works it cites.
Separability and entanglement-breaking in infinite dimensions
A. S. Holevo, M. E. Shirokov, and R. F. Werner · 2005
Later among the works it cites.
Geometry of Quantum States: An Introduction to Quantum Entanglement
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Horodecki, P. Horodecki, and R. Horodecki · 1998
Cited alongside, same era.
The uniqueness theorem for entanglement measures
M. J. Donald, M. Horodecki, and O. Rudolph · 2002
Cited alongside, same era.
Computable measure of entanglement
G. Vidal and R. F. Werner · 2002
Cited alongside, same era.
Characterizing entanglement
D. Bruß · 2002
Cited alongside, same era.
Largest separable balls around the maximally mixed bipartite quantum state
L. Gurvits and H. Barnum · 2002
Cited alongside, same era.
Maximization of capacity and lp norms for some product channels
C. King · 2002
Cited alongside, same era.
I. Bengtsson and K. Życzkowski · 2006
Later among the works it cites.
Quantum entanglement
R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki · 2007
Later among the works it cites.
Computational complexity of the quantum separability problem
L. Ioannou · 2007
Later among the works it cites.
The complexity of the consistency and N-representability problems for quantum states
Y. K. Liu · 2007
Later among the works it cites.
Handbook of Linear Algebra
L. Hogben (editor) · 2007
Later among the works it cites.
Entanglement-breaking channels in infinite dimensions
A. S. Holevo · 2008
Closest in time.
S. Beigi · 2008
Closest in time.
On the NP-hardness of checking matrix polytope stability and continuous-time switching stability
L. Gurvits and A. Olshevsky · 2009
Closest in time.