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].”
Background
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-citationRozpędek, F., Yehia, R., Goodenough, K., Ruf, M., Humphreys, P. C., Hanson, R., Wehner, S., & Elkouss, D. (2019) · Physical Review A · doi:10.1103/physreva.99.052330 · Cited by 159
Quantifying the magic of quantum channels
Wang, X., Wilde, M. M., & Su, Y. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab451d · Cited by 190
“[80] Masahiro Takeoka, Saikat Guha, and Mark M.”
BackgroundSelf-citationQuantifying the magic of quantum channels
Wang, X., Wilde, M. M., & Su, Y. (2019) · Civil War Book Review · Cited by 102
Self-citationStrong Converse Rates for Quantum Communication
Tomamichel, M., Wilde, M. M., & Winter, A. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2615847 · Cited by 115
Self-citationRényi generalizations of the conditional quantum mutual information
Berta, M., Seshadreesan, K. P., & Wilde, M. M. (2015) · Journal of Mathematical Physics · doi:10.1063/1.4908102 · Cited by 104
“More generally, it might be helpful in strengthening the main result of [61], so that the upper bound established on the two-way assisted quantum capacity could be interpreted as a strong converse rate.”
BackgroundSelf-citationTools for quantum network design
Azuma, K., Bäuml, S., Coopmans, T. J., Elkouss, D., & Li, B. (2021) · AVS Quantum Science · doi:10.1116/5.0024062 · Cited by 110
Fundamental rate-loss trade-off for the quantum internet
Azuma, K., Mizutani, A., & Lo, H. (2016) · Nature Communications · doi:10.1038/ncomms13523 · Cited by 92
“…in terms of the communication efficiency for the distance, known optical schemes 2,7–13 for the point-to-point links are shown to have no scaling gap with an upper bound on the quantum capacity and the private capacity of the lossy optical channel, called Takeoka– Guha–Wilde (TGW) bound 14,15 .”
InfluentialRelative Entropy Bounds on Quantum, Private and Repeater Capacities
Christandl, M., & Müller‐Hermes, A. (2017) · Communications in Mathematical Physics · doi:10.1007/s00220-017-2885-y · Cited by 85
“Not many such bounds on Q ↔ and P ↔ are known: In [2] the squashed entanglement of a quantum channel has been defined and shown to be an upper bound on P ↔ (and therefore also on Q ↔ ).”
BackgroundInformation-theoretic aspects of the generalized amplitude-damping channel
Khatri, S., Sharma, K., & Wilde, M. M. (2020) · Physical Review A · doi:10.1103/physreva.102.012401 · Cited by 101
Self-citationPrinciples of Quantum Communication Theory: A Modern ApproachPreprint
Khatri, S., Lami, L., & Wilde, M. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.04672 · Cited by 328
“A precise mathematical definition of an LOCC-assisted quantum communication protocol conducted over a quantum channel was presented in (Müller-Hermes, 2012, Definition 12) and (Takeoka et al., 2014, Section IV).”
BackgroundMethodInfluentialSelf-citationSquashed Entanglement, $$\mathbf {k}$$ k -Extendibility, Quantum Markov Chains, and Recovery Maps
Li, K., & Winter, A. (2018) · Foundations of Physics · doi:10.1007/s10701-018-0143-6 · Cited by 96
“s an upper bound on the distillable entanglement and indeed on the distillable secret key in a state [12,9], which makes it very useful to the theory of state distillation and channel capacities, cf. [38]. One of the properties much desirable for a quantitative entanglement measure is faithfulness, i.e. the fact that…”
BackgroundParameter regimes for a single sequential quantum repeater
Rozpędek, F., Goodenough, K., Ribeiro, J., Kalb, N., Vivoli, V. C., Reiserer, A., Hanson, R., Wehner, S., & Elkouss, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab31b · Cited by 100
Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
Fang, K., & Fawzi, H. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04064-4 · Cited by 112
“key distributions [BB84], much less is known about the converse bounds on private capacities, mostly due to their inherently involved settings. The squashed entanglement of a channel was proposed in [TGW14] and proved to be a converse bound on the two-way assisted private capacity. But its strong converse is still lef…”
BackgroundSemidefinite Programming Strong Converse Bounds for Classical Capacity
Wang, X., Xie, W. D., & Duan, R. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2741101 · Cited by 82
“Recently, several converse bounds for private communication were established in [67], [68], [69], [70], [71].”
BackgroundOvercoming lossy channel bounds using a single quantum repeater node
Luong, D., Jiang, L., Kim, J., & Lütkenhaus, N. (2016) · Applied Physics B · doi:10.1007/s00340-016-6373-4 · Cited by 55
Aggregating quantum repeaters for the quantum internet
Azuma, K., & Kato, G. (2017) · Physical Review A · doi:10.1103/physreva.96.032332 · Cited by 57
Mitigating 5G security challenges for next-gen industry using quantum computing
Mangla, C., Rani, S., Qureshi, N. M. F., & Singh, A. D. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.07.009 · Cited by 71
“Along with entangled based communication Devetak and Shor (2005); Hsieh and Wilde (2010), quantum-entanglement-assisted turbo codes Wilde et al. (2013) and two quantum channels having additive function providing tensor product Takeoka et al. (2014).”
Parameter regimes for a single sequential quantum repeater
Rozpędek, F., Goodenough, K., Ribeiro, J., Kalb, N., Vivoli, V. C., Reiserer, A., Hanson, R., Wehner, S., & Elkouss, D. (2018) · Max Planck Digital Library · Cited by 63
Positivity of linear maps under tensor powers
Müller‐Hermes, A., Reeb, D., & Wolf, M. M. (2015) · Journal of Mathematical Physics · doi:10.1063/1.4927070 · Cited by 60
Entanglement cost and quantum channel simulation
Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.98.042338 · Cited by 58
“[16] Masahiro Takeoka, Saikat Guha, and Mark M.”
BackgroundSelf-citationOptimizing repeater schemes for the quantum internet
Goodenough, K., Elkouss, D., & Wehner, S. (2021) · Physical Review A · doi:10.1103/physreva.103.032610 · Cited by 61
Assessing the performance of quantum repeaters for all phase-insensitive Gaussian bosonic channels
Goodenough, K., Elkouss, D., & Wehner, S. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/6/063005 · Cited by 56
Versatile relative entropy bounds for quantum networks
Rigovacca, L., Kato, G., Bäuml, S., Kim, M. S., Munro, W. J., & Azuma, K. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa9fcf · Cited by 48
Fundamental limits on key rates in device-independent quantum key distribution
Kaur, E., Wilde, M. M., & Winter, A. (2020) · Civil War Book Review · Cited by 45
Self-citationQuantum Photonic Network: Concept, Basic Tools, and Future Issues
Sasaki, M., Fujiwara, M., Jin, R.-B., Takeoka, M., Han, T. S., Endo, H., Yoshino, K.-I., Ochi, T., Asami, S., & Tajima, A. (2015) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2014.2369507 · Cited by 44
“, it is an upper bound on the secret key agreement capacity, as well as the quantum capacity, in a quantum channel assisted by two-way classical public communication [48].”
BackgroundSelf-citationFundamental limitation on quantum broadcast networks
Bäuml, S., & Azuma, K. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa6d3c · Cited by 55
Fundamental limits on key rates in device-independent quantum key distribution
Kaur, E., Wilde, M. M., & Winter, A. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab6eaa · Cited by 53
Self-citationAmortized entanglement of a quantum channel and approximately teleportation-simulable channels
Kaur, E., & Wilde, M. M. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa9da7 · Cited by 57
“erties [CW04,KW04,Chr06,BCY11,LW14] (see also the various discussions in [Tuc99, Tuc02]). One can also dene the dynamic version of this entanglement measure as the squashed entanglement of a channel [TGW14b], denoted as E sq(N). A particular property of squashed entanglement was established as [TGW14b, Theorem 7]. We…”
BackgroundSelf-citationDas, S., Bäuml, S., & Wilde, M. M. (2020) · Physical Review A · doi:10.1103/physreva.101.012344 · Cited by 47
“an be arbitrarily large. We can directly infer from the above denition that E sq(B;A) ˆ= E sq(A;B) ˆ for any ˆ AB2D(H AB). We can similarly dene the squashed entanglement E sq(M) of a channel M A!B [TGW14], and it is known that amortization does not increase the squashed entanglement of a channel [TGW14]: E sq;A(M) =…”
InfluentialSelf-citationRényi squashed entanglement, discord, and relative entropy differences
Seshadreesan, K. P., Berta, M., & Wilde, M. M. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/39/395303 · Cited by 58
Self-citationExtendibility Limits the Performance of Quantum Processors
Kaur, E., Das, S., Wilde, M. M., & Winter, A. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.070502 · Cited by 55
Self-citationAmortized entanglement of a quantum channel and approximately teleportationsimulable channels
Kaur, E., & Wilde, M. M. (2018) · Civil War Book Review · Cited by 35
Self-citationNamiki, R., Jiang, L., Kim, J., & Lütkenhaus, N. (2016) · Physical Review A · doi:10.1103/physreva.94.052304 · Cited by 35
Upper bounds on secret-key agreement over lossy thermal bosonic channels
Kaur, E., & Wilde, M. M. (2017) · Physical Review A · doi:10.1103/physreva.96.062318 · Cited by 39
“[6] Masahiro Takeoka, Saikat Guha, and Mark M.”
BackgroundSelf-citationGaussian-only regenerative stations cannot act as quantum repeaters
Namiki, R., Gittsovich, O., Guha, S., & Lütkenhaus, N. (2014) · Physical Review A · doi:10.1103/physreva.90.062316 · Cited by 35
Self-citationCausal Limit on Quantum Communication
Pisarczyk, R., Zhao, Z., Ouyang, Y., Vedral, V., & Fitzsimons, J. F. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.150502 · Cited by 39
“In the absence of formulae for the exact capacities, one is forced to rely on bounds for the quantum capacity that are tractable to evaluate [6–14].”
BackgroundAmortization does not enhance the max-Rains information of a quantum channel
Berta, M., & Wilde, M. M. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aac153 · Cited by 44
Self-citationExact solution for the quantum and private capacities of bosonic dephasing channels
Lami, L., & Wilde, M. M. (2023) · Nature Photonics · doi:10.1038/s41566-023-01190-4 · Cited by 48
Self-citationRényi generalizations of quantum information measures
Berta, M., Seshadreesan, K. P., & Wilde, M. M. (2015) · Physical Review A · doi:10.1103/physreva.91.022333 · Cited by 34
Self-citationSquashed entanglement and approximate private states
Wilde, M. M. (2016) · Civil War Book Review · Cited by 29
Self-citationWang, X., & Wilde, M. M. (2020) · Physical Review A · doi:10.1103/physreva.102.032416 · Cited by 36
Self-citationSecurity of quantum key distribution using a simplified trusted relay
Stacey, W., Annabestani, R., Ma, X., & Lütkenhaus, N. (2015) · Physical Review A · doi:10.1103/physreva.91.012338 · Cited by 26
Takeoka, M., Seshadreesan, K. P., & Wilde, M. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.150501 · Cited by 26
Self-citationBounds on entanglement distillation and secret key agreement for quantum broadcast channels
Seshadreesan, K. P., Takeoka, M., & Wilde, M. M. (2016) · Civil War Book Review · Cited by 26
Self-citationConditional mutual information and quantum steering
Kaur, E., Wang, X., & Wilde, M. M. (2017) · Physical Review A · doi:10.1103/physreva.96.022332 · Cited by 24
“…inequality: Our proof of the above inequality has some similarities to the proof of the additivity of the squashed entanglement of a channel [15] (there are, however, some key differences). where p X 1 X 2 ( x 1 , x 2 ) is some probability distribution and Tr E (ˆ ρ a 1 ,a 2 ,x 1 ,x 2 The…”
BackgroundMethodInfluentialSelf-citationAmortization does not enhance the max-Rains information of a quantum channel
Berta, M., & Wilde, M. M. (2018) · Civil War Book Review · Cited by 24
Self-citationHadamard quantum broadcast channels
Wang, Q., Das, S., & Wilde, M. M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1697-5 · Cited by 28
Self-citationEnergy-constrained two-way assisted private and quantum capacities of quantum channels
Davis, N., Широков, М. Е., & Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.062310 · Cited by 34
Self-citationBounds on Entanglement Distillation and Secret Key Agreement for Quantum Broadcast Channels
Seshadreesan, K. P., Takeoka, M., & Wilde, M. M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2544803 · Cited by 35
“APPLICATION TO A PURE-LOSS BOSONIC BROADCAST CHANNEL We now apply our results to a pure-loss bosonic broadcast channel, generalizing prior results for the single-sender single-receiver case [5], [6].”
BackgroundMethodInfluentialSelf-citationCapacity Estimates via Comparison with TRO Channels
Gao, L., Junge, M., & LaRacuente, N. D. (2018) · Communications in Mathematical Physics · doi:10.1007/s00220-018-3249-y · Cited by 27
“Also in the recent works [10,52,57], the squashed entanglement Esq(N ) in ([52]) were shown to be an upper bound for Q↔(N ) and P↔(N ), and the entanglement cost EC (N ) in [7] were shown to be the strong converse bounds for Q↔,†(N ) and P↔,†(N ).”
BackgroundRényi squashed entanglement, discord, and relative entropy differences
Seshadreesan, K. P., Berta, M., & Wilde, M. M. (2015) · Civil War Book Review · Cited by 22
Self-citationPursuing the Fundamental Limits for Quantum Communication
Wang, X. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3068818 · Cited by 25
“The private capacity of a quantum channel is also extremely difficult to solve and only some weak converse or strong converse bounds were established in the past two decades (see, e.g., [35, 58– 61]).”
BackgroundSecret key capacity of the thermal-loss channel: improving the lower bound
Ottaviani, C., Laurenza, R., Cope, T., Spedalieri, G., Braunstein, S. L., & Pirandola, S. (2016) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2244899 · Cited by 30
“(29) and (36), we find formula of the asymptotic key rate, which is given in Eq.”
BackgroundResource theory of unextendibility and nonasymptotic quantum capacity
Kaur, E., Das, S., Wilde, M. M., & Winter, A. (2021) · Physical Review A · doi:10.1103/physreva.104.022401 · Cited by 45
Self-citationStrong and uniform convergence in the teleportation simulation of bosonic Gaussian channels
Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.062305 · Cited by 19
“Such protocols were explicitly discussed in [15, 39, 40], as well as the related developments in [41, 64–70].”
BackgroundSelf-citationMaiellaro, A., Marino, A., & Illuminati, F. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033088 · Cited by 17
“Finally, SE plays a fundamental role in channel theory, as the SE of a quantum channel is the optimal upper bound on the quantum communication capacity of any channel assisted by unlimited classical communication [33].”
BackgroundMele, F. A., Lami, L., & Giovannetti, V. (2025) · Nature Photonics · doi:10.1038/s41566-024-01595-9 · Cited by 40
“Except for this very special case, the two-way capacities of the thermal attenuator are still unknown, despite the many upper 15,17,20–24 and lower bounds 12,22,25–27 that have been established.”
Unconstrained distillation capacities of a pure-loss bosonic broadcast channel
Takeoka, M., Seshadreesan, K. P., & Wilde, M. M. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541746 · Cited by 16
Self-citationPhase Noise in Real‐World Twin‐Field Quantum Key Distribution
Bertaina, G., Clivati, C., Donadello, S., Liorni, C., Meda, A., Virzì, S., Gramegna, M., Genovese, M., Levi, F., Calonico, D., et al. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400032 · Cited by 24
Strong converse rates for quantum communication
Tomamichel, M., Wilde, M. M., & Winter, A. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282883 · Cited by 16
Self-citationRelative entropy of steering: On its definition and properties
Kaur, E., & Wilde, M. M. (2017) · Civil War Book Review · Cited by 13
Self-citationWang, X., & Wilde, M. M. (2023) · Physical Review A · doi:10.1103/physreva.107.012429 · Cited by 46
Self-citationRelative entropy of steering: on its definition and properties
Kaur, E., & Wilde, M. M. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa907b · Cited by 16
Self-citationSecret key distillation over a pure loss quantum wiretap channel under restricted eavesdropping
Pan, Z., Seshadreesan, K. P., Clark, W., Adcock, M., Djordjević, I. B., Shapiro, J. H., & Guha, S. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849223 · Cited by 11
“Using the same method, Takeoka et al. [17], then derived the capacity region of a pure-loss broadcast channel.”
BackgroundSelf-citationXiao, H., & Zhang, Z. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1474-x · Cited by 13
A Hierarchy of Efficient Bounds on Quantum Capacities Exploiting Symmetry
Fawzi, O., Shayeghi, A., & Ta, H. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3182101 · Cited by 24
“The squashed entanglement of the channel N introduced in [45] is known to be a converse bounds for Q PPT , ↔ ( N ) .”
BackgroundContinuous-variable quantum enigma machines for long-distance key distribution
Lupo, C., & Lloyd, S. (2015) · Physical Review A · doi:10.1103/physreva.92.062312 · Cited by 10
Optical Fibers With Memory Effects and Their Quantum Communication Capacities
Mele, F. A., Palma, G. D., Fanizza, M., Giovannetti, V., & Lami, L. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3450501 · Cited by 12
Optimized correlation measures in holography
Cheng, N. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.066009 · Cited by 10
End-to-end capacities of imperfect-repeater quantum networks
Harney, C., & Pirandola, S. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac7ba0 · Cited by 7
Winczewski, M., Das, T., & Horodecki, K. (2022) · Physical Review A · doi:10.1103/physreva.106.052612 · Cited by 24
Energy-Constrained LOCC-Assisted Quantum Capacity of the Bosonic Dephasing Channel
Arqand, A., Memarzadeh, L., & Mancini, S. (2023) · Entropy · doi:10.3390/e25071001 · Cited by 8
“It was proved that squashed entanglement of a channel is an upper bound for LOCC-assisted quantum capacity [26] and secret-key agreement capacity [28].”
BackgroundMethodResultInfluentialComputable lower bounds on the entanglement cost of quantum channels
Lami, L., & Regula, B. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aca731 · Cited by 10
Fundamental limitations to key distillation from Gaussian states with Gaussian operations
Lami, L., Mišta, L., & Adesso, G. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033153 · Cited by 7
The squashed entanglement of the noiseless quantum Gaussian attenuator and amplifier
Palma, G. D. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5111489 · Cited by 5
“As the squashed entanglement of a quantum state is an upper bound to the distillable key of the state, the squashed entanglement of a quantum channel is an upper bound to the capacity of the channel to generate a secret key shared between sender and receiver [15].”
BackgroundA meta-converse for private communication over quantum channels
Wilde, M. M., Tomamichel, M., & Berta, M. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006536 · Cited by 3
“, [27], [28]), then this model is closely related to that which is used in some quantum key distribution protocols.”
BackgroundMethodSelf-citationHorodecki, K., Ćwikliński, P., Rutkowski, A., & Studziński, M. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aad75a · Cited by 7
Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback
Ding, D., Quek, Y., Shor, P. W., & Wilde, M. M. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849604 · Cited by 5
“The approach that we take for establishing the aforementioned bounds is similar in spirit to approaches used to bound other assisted capacities or protocols [15]–[18].”
MethodSelf-citationQuantum Mechanics With Noncommutative AmplitudesPreprint
Moore, G. W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.07746 · Cited by 6
Bipartite Quantum Interactions: Entangling and Information Processing Abilities
Das, S. (2018) · Louisiana State University · doi:10.31390/gradschool_dissertations.4717 · Cited by 7
On Quantum States with a Finite-Dimensional Approximation Property
Широков, М. Е. (2021) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080221100206 · Cited by 3
Minimizations over Geometric Extensions in Holography.Preprint
Cheng, N. (2019) · arXiv (Cornell University) · Cited by 3
Limitations on Protecting Information Against Quantum Adversaries
Kaur, E. (2020) · Louisiana State University · doi:10.31390/gradschool_dissertations.5208 · Cited by 5
“This intuition is formalized for various channels in [6, 7, 8].”
BackgroundInfluentialSquashed entanglement and the two-way assisted capacities of a quantum channel
Takeoka, M., Guha, S., & Wilde, M. M. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874848 · Cited by 1
“By taking the squashing channel for the environment to be another pure-loss bosonic channel of transmissivity η1 ∈ [0, 1], noting that the resulting conditional mutual information can be written as a sum of two conditional entropies, and applying the extremality of Gaussian states with respect to conditional entropies…”
BackgroundSelf-citationExtendibility limits quantum-secured communication and key distillation
Singh, V., & Wilde, M. M. (2025) · Reports on Progress in Physics · doi:10.1088/1361-6633/adcd28 · Cited by 4
Self-citationFalco, A., & Palma, G. D. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3572786 · Cited by 1
“…1, for κ = 0 we get back to the case discussed in [42, Theorem 2] and thus exactly determine the squashed entanglement of this channel, E sq ( N ( η 1 ,η 2 , 0) , where we used the additivity of the squashed entanglement with respect to the tensor product of quantum channels [40, Corollary 8].”
InfluentialCapacity of a continuously distributed quantum network
Zhou, X., Yu, X., & Zhang, Z. (2018) · Physical Review A · doi:10.1103/physreva.98.012316 · Cited by 1
Long-range Quantum Cryptography: Amplified Quantum Key Distribution (AQKD)Preprint
Hughes, R., & Nordholt, J. E. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.6990 · Cited by 1
Assessing the Practicality of a Simple Multi-node Quantum Repeater
Mastromattei, C. (2017) · UWSpace (University of Waterloo) · Cited by 1
A note on state preparation for quantum machine learningPreprint
Zhao, Z., Dunjko, V., Fitzsimons, J., Rebentrost, P., & Fitzsimons, J. F. (2018) · arXiv (Cornell University) · Cited by 1
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch14 · Cited by 1
R�nyi Quantum Conditional Mutual Information and Parity Quantum Optical Metrology
Seshadreesan, K. P. (2015) · Louisiana State University · doi:10.31390/gradschool_dissertations.2590
“One may also try to use the Rényi squashed entanglement to strengthen the results of [178, 177] by showing that the von Neumann entropy-based squashed entanglement is a strong converse rate for the two-way assisted quantum capacity of any channel.”
MethodEntropic Bounds on Two-Way Assisted Secret-Key Agreement Capacities of Quantum Channels
Davis, N. (2018) · Louisiana State University · doi:10.31390/gradschool_dissertations.4561
“The prior works [12,14,79] argued that a thermal-state input should be the optimal choice for a particular relaxation of the energy-constrained squashed entanglement.”
BackgroundInfluentialStrong Converse Bound on the Two-Way Assisted Quantum Capacity
Berta, M., & Wilde, M. M. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437803
Self-citationUpper bound on the classical capacity of a quantum channel assisted by classical feedback
Ding, D., Khatri, S., Quek, Y., Shor, P. W., Wang, X., & Wilde, M. M. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518046 · Cited by 2
Self-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.