The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Open accessThe DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel. Although our formula involves regularization, i.e. taking a limit over many copies of the channel, it reduces to a single-letter expression in the case of generalized dephasing channels. Analogous formulas are conjectured for the simultaneous public-private capacity of a quantum channel and for the simultaneously 1-way distillable common randomness and entanglement of a bipartite quantum state.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332 · cited 1×
“The corresponding theorem for classical “wire-tap”channels was proven in [6].”
BackgroundThe capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Sending classical information via noisy quantum channels
Schumacher, B., & Westmoreland, M. D. (1997) · Physical Review A · doi:10.1103/physreva.56.131 · Cited by 1,087 · cited 4×
“The classical capacity theorem was independently proved by Holevo[15] and Schumacher-Westmoreland [21].”
BackgroundMethodInfluentialPositive functions on 𝐶*-algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1955-0069403-4 · Cited by 1,086
An operational approach to quantum probability
Davies, E. B., & Lewis, J. T. (1970) · Communications in Mathematical Physics · doi:10.1007/bf01647093 · Cited by 888 · cited 1×
“• A decoding quantum instrument [7] D = (Dm)m∈[μ], i.”
Distillation of secret key and entanglement from quantum states
Devetak, I., & Winter, A. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2004.1372 · Cited by 877
Self-citationThe Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823 · cited 8×
“To prove the converse we need the following simple lemma [ 8 ].”
BackgroundMethodInfluentialSelf-citation
Research works printed but not linked: 4
- Devetak, I., Winter, A.: Distilling common randomness from bipartite pure states. http://arxiv.org/abs/quant-ph/0304196, 2003. · arXiv
- Holevo, A. S.: Bounds for the quantity of information transmitted by a quantum channel. Probl. Inf. Transm. 9, 177?183 (1973)
- Shor, P. W.: The quantum channel capacity and coherent information . Lecture notes, MSRI Workshop on Quantum Computation, 2002. Available at http://www.msri.org/publications/ln/msri/2002/quantumcrypto/shor/1/, 2002
- Stinespring, W.F.: Proc. Amer. Math. Soc. 6, 211 (1955)
Cited by
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
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
“[621].”
Advances in Quantum Cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 1,566
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
“edu/people/preskill/ph229/ [33] Devetak, I.”
InfluentialWilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
“A nontrivial class of channels exists (the so-called degradable channels) for which is efficiently computable [19], and it can be shown that this property extends to (we do not know this to be true for ).”
BackgroundSelf-citationQuantum 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
“Subsequently, the article [138] investigated the case where both the classical and quantum information can be simultaneously transmitted over a quantum channel by employing a time-sharing strategy.”
Background(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Wilde, M. M., Winter, A., & Yang, D. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2122-x · Cited by 516
“Some interesting channels fall into this class: generalized dephasing channels [18,77], cloning channels [6,14], and the so-called Unruh channel [6–8].”
BackgroundProbabilistic theories with purification
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2010) · Physical Review A · doi:10.1103/physreva.81.062348 · Cited by 442
Dynamical Purification Phase Transition Induced by Quantum Measurements
Gullans, M. J., & Huse, D. A. (2020) · Physical Review X · doi:10.1103/physrevx.10.041020 · Cited by 391
“As shown by Devetak and Shor, the quantum channel capacity of a degradable channel is equal to the single-use channel capacity Q ð N Þ ¼ Q ð 1 Þ ð N Þ [44].”
Quantum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition
Choi, S., Bao, Y., Qi, X.-L., & Altman, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.030505 · Cited by 435
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
“The first,—but yet not complete—definitions of the quantum capacity of the quantum channel can be found in Shor’s work from 1995 [491], in which Shor has introduced a scheme for reducing decoherence in quantum computer memory, and in Schumacher’s articles from one year later [467, 468].”
BackgroundMethodInfluentialQuantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
“On the other hand the quantum capacity of a phase damping channel Φγ is Q(Φγ) = 1− h(pz) (Devetak and Shor, 2005; Wolf and Pérez-Garćıa, 2007) where h is the binary entropy.”
BackgroundQuantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
“On the other hand the quantum capacity of a phase damping channel Φγ is Q(Φγ) = 1− h(pz) (Devetak and Shor, 2005; Wolf and Pérez-Garćıa, 2007) where h is the binary entropy.”
BackgroundNon-Markovianity and reservoir memory of quantum channels: a quantum information theory perspective
Bylicka, B., Chruściński, D., & Maniscalco, S. (2014) · Scientific Reports · doi:10.1038/srep05720 · Cited by 329
Winter, A. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2609-8 · Cited by 281
A Survey on Quantum Channel Capacities
Gyöngyösi, L., Imre, S., & Nguyen, H. V. (2018) · Surrey Research Insight Open Access (The University of Surrey) · Cited by 299
Direct 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
A Resource Framework for Quantum Shannon Theory
Devetak, I., Harrow, A. W., & Winter, A. J. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928980 · Cited by 208
“Perhaps a good place to start would be with degradable channels, the only class of channels for which the coherent information is known to be additive[52].”
BackgroundSelf-citationThe Quantum Capacity of Channels With Arbitrarily Correlated Noise
Buscemi, F., & Datta, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2039166 · Cited by 184
“As mentioned in the Introduction, we consider the protocol of entanglement transmission [ 6 ]: Given a quantum channel , let be an -dimensional subspace of its input Hilbert space, and let be a fixed positive constant.Alicepreparesamaximallyentangledstate , where , and sends the part through the channel to Bob.”
BackgroundMethodQuantum channels and their entropic characteristics
Holevo, A. S., & Giovannetti, V (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/4/046001 · Cited by 175
“The channel (cid:6) is called degradable if there exists quantum channel ϒ such that ˜ (cid:6) = ϒ ◦ (cid:6) [47].”
BackgroundInfluentialA Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
Noh, K., Albert, V. V., & Jiang, L. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2873764 · Cited by 157
“The bosonic pure-loss channel with transmissivity η ∈ [ 2 , 1] (η ∈ [0, 2 ]) is degradable (anti-degradable) [45], [46] and its quantum capacity has been evaluated.”
BackgroundOne-mode quantum Gaussian channels: Structure and quantum capacity
Holevo, A. S. (2007) · Problems of Information Transmission · doi:10.1134/s0032946007010012 · Cited by 152
One-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
Comparative study of non-Markovianity measures in exactly solvable one- and two-qubit models
Addis, C., Bylicka, B., Chruściński, D., & Maniscalco, S. (2014) · Physical Review A · doi:10.1103/physreva.90.052103 · Cited by 184
Theory of channel simulation and bounds for private communication
Pirandola, S., Braunstein, S. L., Laurenza, R., Ottaviani, C., Cope, T. P. W., Spedalieri, G., & Banchi, L. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac394 · Cited by 143
Degenerate Quantum Codes for Pauli Channels
Smith, G., & Smolin, J. A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.030501 · Cited by 142
Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p > 1
Hayden, P., & Winter, A. (2008) · Communications in Mathematical Physics · doi:10.1007/s00220-008-0624-0 · Cited by 112
“In addition, the weak additivity conjecture was confirmed for generalized dephasing channels [28], the conjugates of all these channels [29] and some other special classes of channels [16, 30, 31, 32].”
BackgroundEntanglement-breaking channels in infinite dimensions
Holevo, A. S. (2008) · Problems of Information Transmission · doi:10.1134/s0032946008030010 · Cited by 141
“If there exists a channel T : T(HB) → T(HE) such that ˜ � = T ◦ �, then � is degradable [ 11 ], and if � = T ′ ◦ ˜ � for some channel T ′ : T(HE) → T(HB), then”
General Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels
Bény, C., & Oreshkov, O. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.120501 · Cited by 126
Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
Hsieh, M.-H., Devetak, I., & Winter, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924726 · Cited by 121
Self-citationThe Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
Kretschmann, D., Schlingemann, D., & Werner, R. F. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.917696 · Cited by 122
“6”
Yard, J., Hayden, P., & Devetak, I. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924665 · Cited by 120
“Using techniques introduced in [29], each sender “shapes” their quantum information into HSW codewords.”
BackgroundMethodInfluentialSelf-citationYard, J., Hayden, P., & Devetak, I. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165811 · Cited by 116
“A particular class of degradable channels which are relevan t to this paper are thegeneralized dephasing channels [9], [32].”
BackgroundSelf-citationProperties of Conjugate Channels with Applications to Additivity and MultiplicativityPreprint
King, C., Matsumoto, K., Nathanson, M., & Ruskai, M. B. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0509126 · Cited by 158
Approaches for approximate additivity of the Holevo information of quantum channels
Leditzky, F., Kaur, E., Datta, N., & Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.012332 · Cited by 136
“However, for the class of degradable quantum channels [14] both the coherent information and the private information are additive ([14] resp.”
BackgroundThe structure of degradable quantum channels
Cubitt, T. S., Ruskai, M. B., & Smith, G. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2953685 · Cited by 149
“It was shown in [11] that degradable channels satisfy (7).”
BackgroundResultInfluentialEntanglement-Assisted Communication of Classical and Quantum Information
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053903 · Cited by 112
“4) Classically enhanced quantum communication when there is no entanglement assistance [7].”
BackgroundMethodResultInfluentialComplementary Channels and the Additivity Problem
Holevo, A. S. (2007) · Theory of Probability and Its Applications · doi:10.1137/s0040585x97982244 · Cited by 110
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
Entanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102
“Another variation is an encoder that encodes both classical bits and qubits, and we might wonder if these could be simultaneously recursive and non-catastrophic (such codes are known as “classically-enhanced” codes [83] and are based on trade-off coding ideas from quantum Shannon theory [84]).”
Strong 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
“29 46 v1 [ qu an tph ] 1 1 Ju n 20”
Degradability of Bosonic Gaussian channels
Caruso, F., & Giovannetti, V. (2006) · Physical Review A · doi:10.1103/physreva.74.062307 · Cited by 98
Quantum capacity of dephasing channels with memory
D’Arrigo, A., Benenti, G., & Falci, G. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/9/310 · Cited by 96
Private Capacity of Quantum Channels is Not Additive
Li, K., Winter, A., Zou, X., & Guo, G. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.120501 · Cited by 120
General bounds for sender-receiver capacities in multipoint quantum communications
Laurenza, R., & Pirandola, S. (2017) · Physical Review A · doi:10.1103/physreva.96.032318 · Cited by 95
Multi-mode bosonic Gaussian channels
Caruso, F., Eisert, J., Giovannetti, V., & Holevo, A. S. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/8/083030 · Cited by 120
Quantum communication with Gaussian channels of zero quantum capacity
Smith, G., Smolin, J. A., & Yard, J. (2011) · Nature Photonics · doi:10.1038/nphoton.2011.203 · Cited by 87
“The first is the antidegradable channels [23], where the environment can simulate the output.”
BackgroundPrivate classical capacity with a symmetric side channel and its application to quantum cryptography
Smith, G. (2008) · Physical Review A · doi:10.1103/physreva.78.022306 · Cited by 92
Relativistic quantum channel of communication through field quanta
Cliche, M., & Kempf, A. (2010) · Physical Review A · doi:10.1103/physreva.81.012330 · Cited by 95
The Quantum Capacity With Symmetric Side Channels
Smith, G., Smolin, J. A., & Winter, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928269 · Cited by 96
“The capacity of a degradable channel is given by the single letter maximization of the coherent information, as shown in [22].”
BackgroundInfluentialAravinda, S., Rather, S. A., & Lakshminarayan, A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043034 · Cited by 100
“[69] Igor Devetak and Peter W Shor, “The capacity of a quantum channel for simultaneous transmission of classical and quantum information,” Communications in Mathematical Physics 256, 287–303 (2005).”
BackgroundTrade-off capacities of the quantum Hadamard channels
Brádler, K., Hayden, P., Touchette, D., & Wilde, M. M. (2010) · Physical Review A · doi:10.1103/physreva.81.062312 · Cited by 80
“We first review the Devetak-Shor result for the classicallyenhanced quantum (CQ) capacity region [31].”
BackgroundInfluentialNoise-Enhanced Classical and Quantum Capacities in Communication Networks
Caruso, F., Huelga, S. F., & Plenio, M. B. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.190501 · Cited by 79
The structure of degradable quantum channels
Cubitt, T. S., Ruskai, M. B., & Smith, G. (2008) · UCL Discovery (University College London) · Cited by 91
Approximate Degradable Quantum Channels
Sutter, D., Scholz, V. B., Winter, A., & Renner, R. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2754268 · Cited by 88
“The significance of U ( ) is hence that it approximates Q(1)( ) — with equality for ε = 0 [3] —, and at the same time it is given by a convex optimization problem, which in general considerably simplifies the task of computing it [32].”
InfluentialQuantum coding with finite resources
Tomamichel, M., Berta, M., & Renes, J. M. (2016) · Nature Communications · doi:10.1038/ncomms11419 · Cited by 96
“Received 5 Aug 2015 | Accepted 16 Mar 2016 | Published 9 May 2016 Quantum coding with finite resources”
Information-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
“III), in which case the regularized quantities reduce to simpler formulas that are functions of only one copy of the channel [8, 9].”
BackgroundWu, J., Long, G., & Hayashi, M. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.064011 · Cited by 88
“It is known that the capacity of the degraded wire-tap channel is supQX I(X; B̂)QX − I(X; Ê)QX [42], [60, (9.”
BackgroundResultInfluentialEntanglement 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
Typical entanglement of stabilizer states
Smith, G., & Leung, D. (2006) · Physical Review A · doi:10.1103/physreva.74.062314 · Cited by 86
Principles 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
“The notions of a complementary channel and a degradable channel were defined by Devetak and Shor (2005).”
BackgroundHarrow, A. W. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0512255 · Cited by 211
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054532 · Cited by 68
“The capacity theorem states that the achievable rate region is equivalent to the capacity region [21]”
BackgroundMethodInfluentialThe Arbitrarily Varying Wiretap Channel—Secret Randomness, Stability, and Super-Activation
Nötzel, J., Wiese, M., & Boche, H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2550587 · Cited by 71
“Apart from specific classes of quantum channels which were shown to have non-regularized capacity formulae [24] by Devetak and Shor, it has also been proven that the entanglement assisted capacity for message transmission over quantum channels is given by a one-shot formulae [8] by Bennet, Shor,…”
BackgroundDephrasure Channel and Superadditivity of Coherent Information
Leditzky, F., Leung, D., & Smith, G. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.160501 · Cited by 83
“Degradable channels have additive coherent information, Ic(N⊗n) = nIc(N ) for all n ∈ N, and hence by (1) their quantum capacity is equal to the coherent information, Q(N ) = Ic(N ) [17].”
BackgroundUseful States and Entanglement Distillation
Leditzky, F., Datta, N., & Smith, G. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2776907 · Cited by 77
“Proposition 13 [22], [23]: Let N1 : A1 → B1 be a degradable channel and N2 : A2 → B2 be an antidegradable channel.”
BackgroundMethodInfluentialNarrow bounds for the quantum capacity of thermal attenuators
Rosati, M., Mari, A., & Giovannetti, V. (2018) · Nature Communications · doi:10.1038/s41467-018-06848-0 · Cited by 79
Efficient optimization of the quantum relative entropy
Fawzi, H., & Fawzi, O. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aab285 · Cited by 84
“However there is a class of so-called degradable channels where the expression for Q (Φ) can be simplified [DS05].”
BackgroundQuantum Coding with Low-Depth Random Circuits
Gullans, M. J., Krastanov, S., Huse, D. A., Jiang, L., & Flammia, S. T. (2021) · Physical Review X · doi:10.1103/physrevx.11.031066 · Cited by 75
“The coherent quantum information is fundamentally related to the quantum channel capacity through the limiting formula [135,136]”
BackgroundQuantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
Datta, N., Hsieh, M.-H., & Wilde, M. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2215575 · Cited by 75
“…is not additive for the channel, then the best statement of the source-channel separation theorem is in terms of the regularized quantity: H (U) ≤ χ∗reg (N ) , where χ∗reg (N ) ≡ lim n→∞ 1 n χ∗ ( N⊗n ) , but it is unclear how useful such a statement is because we cannot compute such a…”
BackgroundSharma, K., Wilde, M. M., Adhikari, S., & Takeoka, M. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aac11a · Cited by 82
“Since these information quantities are additive for a special class of channels called degradable channels [DS05, Smi08], the capacities of these channels can be calculated without any regularization.”
BackgroundSimultaneous classical communication and quantum key distribution using continuous variables
Qi, B. (2016) · Physical Review A · doi:10.1103/physreva.94.042340 · Cited by 65
Tomography increases key rates of quantum-key-distribution protocols
Watanabe, S., Matsumoto, R., & Uyematsu, T. (2008) · Physical Review A · doi:10.1103/physreva.78.042316 · Cited by 58
Energy-Constrained Private and Quantum Capacities of Quantum Channels
Wilde, M. M., & Qi, H. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2854766 · Cited by 80
“A quantum channel N : T (HA) → T (HB) is degradable [15] if there exists a quantum channel D : T (HB)→ T (HE), called a degrading channel, such that for some complementary channel N̂ : T (HA) → T (HE) and all τ ∈ T (HA): N̂ (τ) = (D ◦ N )(τ).”
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).”
Quantum trade-off coding for bosonic communication
Wilde, M. M., Hayden, P. M., & Guha, S. (2012) · Physical Review A · doi:10.1103/physreva.86.062306 · Cited by 64
Polar Codes for Private and Quantum Communication Over Arbitrary Channels
Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2314463 · Cited by 59
“e give two different conditions for when the quantum or private coding schemes require only a sublinear amount of entanglement or secret-key assistance. The first occurs when the channel is degradable [21], in the sense that the Routput (Eve’s output Ein the private case) can be generated from Bob’s output Bby some qua…”
BackgroundHayashi, M. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2464215 · Cited by 61
“It is known that the degraded channel WB ,WE satisfies that [14] [5, eq.”
BackgroundMulti-mode bosonic Gaussian channelsPreprint
Caruso, F., Eisert, J., Giovannetti, V., & Holevo, A. S. (2013) · Cited by 59
Sharma, K., Wilde, M. M., Adhikari, S., & Takeoka, M. (2018) · Civil War Book Review · Cited by 50
Trading classical communication, quantum communication, and entanglement in quantum Shannon Theory
Hsieh, M.-H., & Wilde, M. M. (2010) · Civil War Book Review · Cited by 57
Private and quantum capacities of more capable and less noisy quantum channels
Watanabe, S. (2012) · Physical Review A · doi:10.1103/physreva.85.012326 · Cited by 61
Additive extensions of a quantum channel
Smith, G., & Smolin, J. A. (2008) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2008.4578688 · Cited by 65
“Fortunately, wecan evaluate capacity for some channels— degradable ones [9].”
BackgroundChannel Simulation With Quantum Side Information
Luo, Z., & Devetak, I. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2011424 · Cited by 62
Self-citationThe quantum dynamic capacity formula of a quantum channel
Wilde, M. M., & Hsieh, M. H. (2012) · Civil War Book Review · Cited by 49
Complementarity and Additivity for Covariant Channels
Datta, N., Fukuda, M., & Holevo, A. S. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0021-6 · Cited by 48
Conjugate degradability and the quantum capacity of cloning channels
Brádler, K., Dutil, N., Hayden, P. M., & Muhammad, A. (2010) · Journal of Mathematical Physics · doi:10.1063/1.3449555 · Cited by 55
“For at least one class of channels, however, known as the degradable channels, the prescription does yield the quantum capacity and, therefore, the optimal codes [11].”
BackgroundKoudia, S., Cacciapuoti, A. S., Simonov, K., & Caleffi, M. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3196449 · Cited by 63
“allows us to introduce the notion of degradability of a quantum channel [46], [89], [159].”
BackgroundQuantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels
Ahlswede, R., Bjelaković, I., Boche, H., & Nötzel, J. (2012) · Communications in Mathematical Physics · doi:10.1007/s00220-012-1613-x · Cited by 68
Quantum and Private Capacities of Low-Noise Channels
Leditzky, F., Leung, D., & Smith, G. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.160503 · Cited by 50
“However, for special channels called degradable channels, the coherent information is weakly additive, meaning that the n-shot coherent information is n times the 1-shot coherent information [6].”
BackgroundInfluentialThe quantum capacity with symmetric side channels
Smith, G., Smolin, J. A., & Winter, A. (2006) · CERN Document Server (European Organization for Nuclear Research) · Cited by 60
Classical and quantum capacities of a fully correlated amplitude damping channel
D’Arrigo, A., Benenti, G., Falci, G., & Macchiavello, C. (2013) · Physical Review A · doi:10.1103/physreva.88.042337 · Cited by 48
Enhancement of Transmission Rates in Quantum Memory Channels with Damping
Benenti, G., D’Arrigo, A., & Falci, G. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.020502 · Cited by 46
Quantum Capacity Under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels
Ahlswede, R., Bjelaković, I., Boche, H., & Nötzel, J. (2012) · Cited by 44
“Pretty Strong” Converse for the Quantum Capacity of Degradable Channels
Morgan, C., & Winter, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2288971 · Cited by 68
The quantum dynamic capacity formula of a quantum channel
Wilde, M. M., & Hsieh, M.-H. (2012) · Quantum Information Processing · doi:10.1007/s11128-011-0310-6 · Cited by 43
“[12,27].”
Quantum Communication in Rindler Spacetime
Brádler, K., Hayden, P. M., & Panangaden, P. (2012) · Communications in Mathematical Physics · doi:10.1007/s00220-012-1476-1 · Cited by 50
“While there is no known single-letter formula for the quantum capacity of a general quantum channel, if a channel has the property of being either degradable or conjugate degradable, the optimized coherent information does give such a formula [8,21].”
Background
Metadata
- Authors
- Devetak, I., & Shor, P. W.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Massachusetts Institute of Technology (US)
- Venue
- Communications in Mathematical Physics
- Published
- 2005-03-22
- Volume
- 256
- Issue
- 2
- Pages
- 287-303
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2594901681
- Cited by
- 445
- References
- 26
- Citations by year
- 2026: 12 · 2025: 25 · 2024: 22 · 2023: 19 · 2022: 26 · 2021: 39 · 2020: 33 · 2019: 16 · 2018: 29 · 2017: 18 · 2016: 21 · 2015: 15 · 2014: 23 · 2013: 22 · 2012: 22
- FWCI
- 16.90
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Communications in Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- 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
- quantum channel capacity, regularization, dephasing channel, common randomness, entanglement distillation, quantum information
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.