Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Takeoka, Masahiro, Guha, Saikat, Wilde, Mark M. · 2014 · IEEE Transactions on Information Theory

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2014.2330313

Cites

50 of 50 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 34 references

Cited by

See all 107

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
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.