The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
Open accessAbstract
AbstractWe report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert space. We introduce a very useful representation of a product basis, an orthogonality graph. Using this representation we give a complete characterization of unextendible product bases for two qutrits. We present several generalizations of UPBs to arbitrary high dimensions and multipartite systems. We present a sufficient condition for sets of orthogonal product states to be distinguishable by separable superoperators. We prove that bound entangled states cannot help increase the distillable entanglement of a state beyond its regularized entanglement of formation assisted by bound entanglement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Harary, F. (1969) · Cited by 10,739
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Self-citationAn introduction to the theory of numbers
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90676-1 · Cited by 3,574
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Self-citationQuantum Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
(1996) · Cited by 2,280
On the Shannon capacity of a graph
Lovasz, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,624
Separability criterion and inseparable mixed states with positive partial transposition
Horodecki, P. (1997) · Physics Letters A · doi:10.1016/s0375-9601(97)00416-7 · Cited by 1,296
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Entanglement of the orbital angular momentum states of photons
Mair, A., Vaziri, A., Weihs, G., & Zeilinger, A. (2001) · Nature · doi:10.1038/35085529 · Cited by 3,321
Bell inequalities and the separability criterion
Terhal, B. M. (2000) · Physics Letters A · doi:10.1016/s0375-9601(00)00401-1 · Cited by 775
Self-citationEntanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698
Self-citationSchmidt number for density matrices
Terhal, B. M., & Horodecki, P. (2000) · Physical Review A · doi:10.1103/physreva.61.040301 · Cited by 427
Self-citation
Metadata
- Authors
- DiVincenzo, D. P., Mor, T., Shor, P. W., Smolin, J. A., & Terhal, B. M.
- Venue
- Communications in Mathematical Physics
- Published
- 2003-07-01
- Volume
- 238
- Issue
- 3
- Pages
- 379-410
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2028679634
- Cited by
- 349
- References
- 28
- FWCI
- 13.07
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement. https://app.cochat.ai/papers/10.1007/s00220-003-0877-6
- The paper
- DiVincenzo, D. P., Mor, T., Shor, P. W., Smolin, J. A., & Terhal, B. M. (2003). Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement. Communications in Mathematical Physics. https://doi.org/10.1007/s00220-003-0877-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
