The Squashed Entanglement of a Quantum Channel
Open accessThe DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
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.
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].”
BackgroundCapacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365 · cited 1×
“These latter results represent important progress on one of the longest standing open questions in quantum information theory [17] (namely, to determine these capacities or sharpen the bounds on them).”
ResultSecure Key from Bound Entanglement
Horodecki, K., Horodecki, M., Horodecki, P., & Oppenheim, J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160502 · Cited by 340 · cited 1×
“The method for doing so was to exploit the fact that LOPC distillation of secret key is equivalent to LOCC distillation of private states [22], [23].”
MethodA semidefinite program for distillable entanglement
Rains, E. M. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959270 · Cited by 326
Extremality of Gaussian Quantum States
Wolf, M. M., Giedke, G., & Cirac, J. I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.080502 · Cited by 318 · cited 2×
“Since the overall channel from A′ to B E ′ is Gaussian and the overall channel from A′ to B F is Gaussian and due to the photon-number constraint at the input, it follows from the extremality of Gaussian states for conditional entropy [26], [27] that a thermal state on A′ of mean photon number NS maximizes both of the…”
BackgroundUnconditionally secure key agreement and the intrinsic conditional information
Maurer, U. M., & Wolf, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748999 · Cited by 274
Continuity of quantum conditional information
Alicki, R., & Fannes, M. (2004) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/37/5/l01 · Cited by 256 · cited 2×
“Remark 3: Note that we can indeed take a maximization (rather than a supremization) over pure bipartite inputs if the input space is finite-dimensional because in this case, the input space is compact and the squashed entanglement measure is continuous [14].”
BackgroundDirect and Reverse Secret-Key Capacities of a Quantum Channel
Pirandola, S., García-Patrón, R., Braunstein, S. L., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.050503 · Cited by 249 · cited 3×
“For values of η 1 (which we expect in practical scenarios with high loss), this upper bound is close to the following lower bound on Q2(Nη) and P2(Nη) based on the reverse coherent information established in [18] and [19]:”
BackgroundInfluentialThe Structure of Bipartite Quantum States - Insights from Group Theory and CryptographyPreprint
Christandl, M. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0604183 · Cited by 210 · cited 3×
“showed in prior work that the squashed entanglement is a secrecy monotone, in the sense that it does not increase under local operations and public classical (LOPC) communication [9], [21].”
BackgroundFaithful Squashed Entanglement
Brandão, F. G. S. L., Christandl, M., & Yard, J. (2011) · Communications in Mathematical Physics · doi:10.1007/s00220-011-1302-1 · Cited by 200
Quantum Capacities of Bosonic Channels
Wolf, M. M., Pérez-García, D., & Giedke, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.130501 · Cited by 192 · cited 1×
“Furthermore, in light of later results [29] which established log2(η/(1 − η)) as an upper bound on the unassisted quantum capacity, it is clear that the Holevo-Werner bound is not tight.”
BackgroundGeneral Paradigm for Distilling Classical Key From Quantum States
Horodecki, K., Horodecki, M., Horodecki, P., & Oppenheim, J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009798 · Cited by 192 · cited 1×
“The method for doing so was to exploit the fact that LOPC distillation of secret key is equivalent to LOCC distillation of private states [22], [23].”
MethodOne-mode bosonic Gaussian channels: a full weak-degradability classification
Caruso, F., Giovannetti, V., & Holevo, A. S. (2006) · New Journal of Physics · doi:10.1088/1367-2630/8/12/310 · Cited by 167 · cited 1×
“where N is given by (29)-(34) and T and G are chosen such that τ = T G and ν = G(1 − T ) + G − 1 [31], [32].”
Minimum output entropy of bosonic channels: A conjecture
Giovannetti, V., Guha, S., Lloyd, S., Maccone, L., & Shapiro, J. H. (2004) · Physical Review A · doi:10.1103/physreva.70.032315 · Cited by 143 · cited 1×
“It is well known that the additive noise channel is equivalent to a thermal channel for which NB → ∞ and η → 1, while (1 − η)NB → n [33].”
Self-citationEntanglement of Distillation and Conditional Mutual InformationPreprint
Tucci, R. R. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0202144 · Cited by 124 · cited 1×
“In related work, Tucci has defined a functional bearing some similarities to squashed entanglement [10], [11].”
BackgroundEisert, J., & Wolf, M. M. (2007) · Quantum Information with Continuous Variables of Atoms and Light · doi:10.1142/9781860948169_0002 · Cited by 113
García-Patrón, R., Pirandola, S., Lloyd, S., & Shapiro, J. H. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.210501 · Cited by 104
Quantum Privacy and Quantum Coherence
Schumacher, B., & Westmoreland, M. D. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5695 · Cited by 97 · cited 1×
“Due to strong parallels discovered between secrecy and quantum coherence or entanglement [4]–[6], Christandl realized that an extension of the intrinsic information to quantum information theory might be helpful in simplifying the arduous task of quantifying entanglement present in quantum states [7].”
BackgroundEntanglement Cost of Quantum Channels
Berta, M., Brandão, F. G. S. L., Christandl, M., & Wehner, S. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2268533 · Cited by 97 · cited 6×
“Remark 14: The squashed entanglement of a quantum channel is never larger than its entanglement cost [16].”
BackgroundResultInfluentialQuantum Entanglement and Conditional Information TransmissionPreprint
Tucci, R. R. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9909041 · Cited by 90
Unifying Classical and Quantum Key Distillation
Christandl, M., EKERT, A. K., Horodecki, M., Horodecki, P., Oppenheim, J., & Renner, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-70936-7_25 · Cited by 83 · cited 3×
“However, these apparent difficulties are not an obstruction to finding good upper bounds on the distillable entanglement or distillable secret key of a quantum state ρAB : the results of [8], [9] are that any squashing channel gives an upper bound on these quantities and so the task is to find the best one in a reason…”
BackgroundMethodMajorization Theory Approach to the Gaussian Channel Minimum Entropy Conjecture
García−Patrón, R., Navarrete–Benlloch, C., Lloyd, S., Shapiro, J. H., & Cerf, N. J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.110505 · Cited by 72 · cited 2×
“where N is given by (29)-(34) and T and G are chosen such that τ = T G and ν = G(1 − T ) + G − 1 [31], [32].”
BackgroundA property of the intrinsic mutual information
Christandl, M., Renner, R., & Wolf, S. (2003) · IEEE International Symposium on Information Theory, 2003. Proceedings. · doi:10.1109/isit.2003.1228272 · Cited by 32 · cited 1×
“Due to a lack of an upper bound on the dimension of the output E ′ of the squashing channel, it is not yet known whether the infimization in (3) can be replaced by a minimization, but note that such a replacement is possible for the classical intrinsic information [12].”
BackgroundEntanglement cost of quantum channels
Berta, M., Christandl, M., Brandão, F. G. S. L., & Wehner, S. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284692 · Cited by 17
A paradigm for entanglement theory based on quantum communicationPreprint
Oppenheim, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0801.0458 · Cited by 10
Weedbrook, C., Pirandola, S., García−Patrón, R., et al. (2011) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.48550/arxiv.1110.3234 · Cited by 8 · cited 3×
“where D(α) is a unitary displacement operator and n > 0 is the noise variance [30].”
BackgroundUnifying classical and quantum key distillationPreprint
Christandl, M., EKERT, A. K., Horodecki, M., et al. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0608199 · cited 3×
“However, these apparent difficulties are not an obstruction to finding good upper bounds on the distillable entanglement or distillable secret key of a quantum state ρAB : the results of [8], [9] are that any squashing channel gives an upper bound on these quantities and so the task is to find the best one in a reason…”
BackgroundMethodOne-mode Bosonic Gaussian channels: a full weak-degradability classification
Caruso, F., Giovannetti, V., & Holevo, A. S. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0609013 · cited 1×
“where N is given by (29)-(34) and T and G are chosen such that τ = T G and ν = G(1 − T ) + G − 1 [31], [32].”
"Squashed Entanglement" - An Additive Entanglement Measure
Christandl, M., & Winter, A. (2003) · arXiv · doi:10.48550/arxiv.quant-ph/0308088 · cited 19×
“The first inequality follows from monotonicity of the squashed entanglement under LOCC.”
BackgroundInfluentialEisert, J., & Wolf, M. M. (2005) · arXiv · doi:10.48550/arxiv.quant-ph/0505151
Minimum output entropy of bosonic channels: a conjecture
Giovannetti, V., Guha, S., Lloyd, S., Maccone, L., & Shapiro, J. H. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0404005 · cited 1×
“It is well known that the additive noise channel is equivalent to a thermal channel for which NB → ∞ and η → 1, while (1 − η)NB → n [33].”
Self-citationGarcía-Patrón, R., Pirandola, S., Lloyd, S., & Shapiro, J. H. (2008) · arXiv · doi:10.48550/arxiv.0808.0210
Majorization theory approach to the Gaussian channel minimum entropy conjecture
Garcia-Patron, R., Navarrete-Benlloch, C., Lloyd, S., Shapiro, J. H., & Cerf, N. J. (2011) · arXiv · doi:10.48550/arxiv.1111.1986 · cited 2×
“where N is given by (29)-(34) and T and G are chosen such that τ = T G and ν = G(1 − T ) + G − 1 [31], [32].”
BackgroundSecure key from bound entanglement
Horodecki, K., Horodecki, M., Horodecki, P., & Oppenheim, J. (2003) · arXiv · doi:10.48550/arxiv.quant-ph/0309110 · cited 1×
“The method for doing so was to exploit the fact that LOPC distillation of secret key is equivalent to LOCC distillation of private states [22], [23].”
MethodGeneral paradigm for distilling classical key from quantum states
Horodecki, K., Horodecki, M., Horodecki, P., & Oppenheim, J. (2005) · arXiv · doi:10.48550/arxiv.quant-ph/0506189 · cited 1×
“The method for doing so was to exploit the fact that LOPC distillation of secret key is equivalent to LOCC distillation of private states [22], [23].”
MethodMonogamy of entanglement and other correlations
Koashi, M., & Winter, A. (2003) · arXiv · doi:10.48550/arxiv.quant-ph/0310037 · 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].”
BackgroundUnconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
Lo, H.-K., & Chau, H. F. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9803006
Direct and Reverse Secret-Key Capacities of a Quantum Channel
Pirandola, S., Garcia-Patron, R., Braunstein, S. L., & Lloyd, S. (2008) · arXiv · doi:10.48550/arxiv.0809.3273 · cited 3×
“For values of η 1 (which we expect in practical scenarios with high loss), this upper bound is close to the following lower bound on Q2(Nη) and P2(Nη) based on the reverse coherent information established in [18] and [19]:”
BackgroundInfluentialEntanglement Cost of Quantum Channels
Berta, M., Brandao, F., Christandl, M., & Wehner, S. (2011) · arXiv · doi:10.48550/arxiv.1108.5357 · cited 6×
“Remark 14: The squashed entanglement of a quantum channel is never larger than its entanglement cost [16].”
BackgroundResultInfluentialFaithful Squashed Entanglement
Brandao, F. G. S. L., Christandl, M., & Yard, J. (2010) · arXiv · doi:10.48550/arxiv.1010.1750
Capacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9701015 · cited 1×
“These latter results represent important progress on one of the longest standing open questions in quantum information theory [17] (namely, to determine these capacities or sharpen the bounds on them).”
Result
Research works printed but not linked: 1
- [Chr02] Matthias Christandl. The quantum analog to intrinsic information. Diploma Thesis, ETH Zurich, unpublished, 2002.
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 194
“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
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.