The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)
Article
First Online:
Received:
Accepted:
- 164 Downloads
- 13 Citations
Abstract
A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovász (J. Comb. Theory Ser. A, 95:169–179, 2001), but since then only a few other cases have been solved. We solve all remaining bipartite cases, as well as a large family of multipartite cases.
Keywords
Minimum Size Orthogonality Condition Permutation Matrix Positive Partial Transpose Nonzero Product
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- AL01.Alon N., Lovász L.: Unextendible product bases. J. Comb. Theory Ser. A 95, 169–179 (2001)CrossRefzbMATHGoogle Scholar
- ASH+11.Augusiak, R., Stasinska, J., Hadley, C., Korbicz, J.K., Lewenstein, M., Ac쬬 A.: Bell inequalities with no quantum violation and unextendible product bases. Phys. Rev. Lett. 107, 070401 (2011)ADSCrossRefGoogle Scholar
- BDF+99.Bennett, C.H., DiVincenzo, D.P., Fuchs, C.A., Mor, T., Rains, E., Shor, P.W., Smolin, J.A., Wootters, W.K.: Quantum nonlocality without entanglement. Phys. Rev. A 59, 1070–1091 (1999)ADSCrossRefMathSciNetGoogle Scholar
- BDM+99.Bennett, C.H., DiVincenzo, D.P., Mor, T., Shor, P.W., Smolin, J.A., Terhal, B.M.: Unextendible product bases and bound entanglement. Phys. Rev. Lett. 82, 5385–5388 (1999)ADSCrossRefMathSciNetGoogle Scholar
- Bha06.Bhat B.: A completely entangled subspace of maximal dimension. Int. J. Quantum Inf. 4, 325–330 (2006)CrossRefzbMATHGoogle Scholar
- DMS+03.DiVincenzo, D.P., Mor, T., Shor, P.W., Smolin, J.A., Terhal, B.M.: Unextendible product bases, uncompletable product bases and bound entanglement. Commun. Math. Phys. 238, 379–410 (2003)ADSCrossRefMathSciNetzbMATHGoogle Scholar
- Fen06.Feng K.: Unextendible product bases and 1-factorization of complete graphs. Discrete Appl. Math. 154, 942–949 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
- HS93.Herschkowitz D., Schneider H.: Ranks of zero patterns and sign patterns. Linear Multilinear Algebra 34, 3–19 (1993)CrossRefGoogle Scholar
- Joh12.Johnston, N.: Code for computing some unextendible product bases. http://www.njohnston.ca/publications/minimum-upbs/code/ (2012)
- Joh13.Johnston, N.: The minimum size of qubit unextendible product bases. In: Proceedings of the 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC) (2013). doi: 10.4230/LIPIcs.TQC.2013.93
- LSM11.Leinaas J.M., Sollid P.Ø., Myrheim J.: Unextendible product bases and extremal density matrices with positive partial transpose. Phys. Rev. A 84, 042325 (2011)ADSCrossRefGoogle Scholar
- Ped02.Pedersen, T.B.: Characteristics of unextendible product bases. Master’s thesis, Aarhus Universitet, Datalogisk Institut (2002)Google Scholar
- Sko11.Skowronek Ł.: Three-by-three bound entanglement with general unextendible product bases. J. Math. Phys. 52, 122202 (2011)ADSCrossRefMathSciNetGoogle Scholar
- Ter01.Terhal B.M.: A family of indecomposable positive linear maps based on entangled quantum states. Linear Algebra Appl. 323, 61–73 (2001)CrossRefMathSciNetzbMATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2014