The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
The Squashed Entanglement of a Quantum Channel
Open accessAbstract
This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl and Winter, establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed (log (1+η)/(1-η)) for a pure-loss bosonic channel for which a fraction (η) of the input photons make it to the output on average. The best known lower bound on these capacities is equal to (log (1/(1-η)). Thus, in the high-loss regime for which η ≪ 1), this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664 · cited 3×
“where D(α) is a unitary displacement operator and n > 0 is the noise variance [30].”
BackgroundSimple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, P. W., & Preskill, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.441 · Cited by 3,047
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Lo, H.-K., & Chau, H. F. (1999) · Science · doi:10.1126/science.283.5410.2050 · Cited by 1,858
Common randomness in information theory and cryptography. I. Secret sharing
Ahlswede, R., & Csiszar, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243431 · Cited by 1,325
Proof of the strong subadditivity of quantum-mechanical entropy
Lieb, E. H., & Ruskai, M. B. (1973) · Journal of Mathematical Physics · doi:10.1063/1.1666274 · Cited by 831
Monogamy of quantum entanglement and other correlations
Koashi, M., & Winter, A. (2004) · Physical Review A · doi:10.1103/physreva.69.022309 · Cited by 609 · cited 1×
“Finally, among the many entanglement measures, squashed entanglement is the only one known to satisfy all eight desirable properties that have arisen in the axiomatization of entanglement theory [8], [13]–[15].”
BackgroundEvaluating capacities of bosonic Gaussian channels
Holevo, A., & Werner, R. (2001) · Physical Review A · doi:10.1103/physreva.63.032312 · Cited by 576 · cited 1×
“Remark 16: In [28], Holevo and Werner proved by a different approach that log2((1 + η)/(1 − η)) serves as an upper bound on the unassisted quantum capacity of a pure-loss bosonic channel with transmissivity η ∈ [0, 1].”
Background“Squashed entanglement”: An additive entanglement measure
Christandl, M., & Winter, A. (2004) · Journal of Mathematical Physics · doi:10.1063/1.1643788 · Cited by 451 · cited 19×
“The first inequality follows from monotonicity of the squashed entanglement under LOCC.”
BackgroundInfluentialRelative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
Uhlmann, A. (1977) · Communications in Mathematical Physics · doi:10.1007/bf01609834 · Cited by 431 · cited 1×
“In this way, the continuity inequality in the proof of Theorem 9 safely applies and all of the other steps in between involve only the quantum data processing inequality, which has been proven to hold in the general infinite-dimensional setting [25].”
Background
Cited by
Fundamental limits of repeaterless quantum communications
Pirandola, S., Laurenza, R., Ottaviani, C., & Banchi, L. (2017) · Nature Communications · doi:10.1038/ncomms15043 · Cited by 1,374
“d). Amplitude damping channel: Upper bound based on the squashed entanglement An alternative upper bound for the two-way capacity of a quantum channel is its squashed entanglement, i.e., we may write [S40] C(E) ≤ Esq(E). (S215) The squashed entanglement of an arbitrary channel E, from system Ato system B, is defined as…”
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“…turbo codes [141] and the squashed entanglement of a quantum channel, which is an additive function of a tensor product of any two quantum channels [142]. b: QUANTUM-DOT CELLULAR AUTOMATA (QCA) One of the main issues with the Complementary Metal-Oxide Semiconductor (CMOS) technology is the…”
BackgroundQuantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
Bennett, C. H., Devetak, I., Harrow, A. W., Shor, P. W., & Winter, A. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2309968 · Cited by 222
“Aside from the constraints Q ≤ P ≤ C ≤ CE , and Q ≤ Q2, which are obvious consequences of the definitions, and Q2 ≤ QE = 12CE , which follows from [74], the five capacities appear to vary rather independently (see for example [10] and [72]).”
BackgroundConverse Bounds for Private Communication Over Quantum Channels
Wilde, M. M., Tomamichel, M., & Berta, M. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2648825 · Cited by 193
“However, it is known that the quantum and private capacities of quantum Gaussian channels are bounded even if an infinite amount of energy is available [13], [105] (this is in contrast to the classical capacity [105]).”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Takeoka, M., Guha, S., & Wilde, M. M.
- Affiliations
- National Institute of Information and Communications Technology (JP)
- RTX (United States) (US)
- Louisiana State University (US)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-08
- Volume
- 60
- Issue
- 8
- Pages
- 4987-4998
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2023900791
- Cited by
- 107
- References
- 34
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 2 · 2023: 5 · 2022: 10 · 2021: 7 · 2020: 8 · 2019: 12 · 2018: 16 · 2017: 17 · 2016: 11 · 2015: 9 · 2014: 5
- FWCI
- 13.95
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Civil War Book Review (submittedVersion)
- arXiv (Cornell University)
- Funders
- Defense Advanced Research Projects Agency Quiness Program through the U.S. Army Research Office (W31P4Q-12-1-0019)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- squashed entanglement, quantum channels, subadditivity, private capacity, quantum key distribution, entanglement measures
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: The Squashed Entanglement of a Quantum Channel. https://app.cochat.ai/papers/10.1109/tit.2014.2330313
- The paper
- Takeoka, M., Guha, S., & Wilde, M. M. (2014). The Squashed Entanglement of a Quantum Channel. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2014.2330313
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.