Unextendible product bases and the construction of inseparable states

[1]  P. Shor,et al.  Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement , 1999, quant-ph/9908070.

[2]  B. Terhal.  Detecting quantum entanglement , 2001, Theor. Comput. Sci..

[3]  Noga Alon,et al.  Unextendible Product Bases , 2001, J. Comb. Theory A.

[4]  A. O. Pittenger,et al.  Convexity and the separability problem of quantum mechanical density matrices , 2001, quant-ph/0103038.

[5]  D. DiVincenzo,et al.  Product Bases in Quantum Information Theory , 2000, quant-ph/0008055.

[6]  A. O. Pittenger,et al.  Separability and Fourier representations of density matrices , 2000, quant-ph/0001014.

[7]  Arthur O. Pittenger,et al.  An Introduction to Quantum Computing Algorithms , 2000 .

[8]  Charles H. Bennett,et al.  Unextendible product bases and bound entanglement , 1998, quant-ph/9808030.

[9]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[10]  B. Terhal.  A family of indecomposable positive linear maps based on entangled quantum states , 1998, quant-ph/9810091.

[11]  M. Lewenstein,et al.  Volume of the set of separable states , 1998, quant-ph/9804024.

[12]  M. Horodecki,et al.  Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature? , 1998, quant-ph/9801069.

[13]  M. Horodecki,et al.  Separability of mixed states: necessary and sufficient conditions , 1996, quant-ph/9605038.

[14]  Pérès,et al.  Separability Criterion for Density Matrices. , 1996, Physical review letters.