The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Open accessThe DOI matches its Crossref record; 26 of the 26 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
Items 201–300 of 439
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
“But the later work of Devetak and Shor proved that the “single-letter” coherent information formula in (1) is equal to the quantum capacity for the class of degradable quantum channels [10].”
Boche, H., Janßen, G., & Saeedinaeeni, S. (2020) · Journal of Mathematical Physics · doi:10.1063/1.5139622 · Cited by 14
One-shot quantum error correction of classical and quantum information
Nakata, Y., Wakakuwa, E., & Yamasaki, H. (2021) · Physical Review A · doi:10.1103/physreva.104.012408 · Cited by 18
“Important capacity theorems such as the Holevo-Schumacher-Westmoreland theorem [14, 15] for classical information, the LloydShor-Devetak theorem [16–18] for quantum information, Devetak-Shor theorem [19] for hybrid information, those with assistance of entanglement [20, 21], and their extensions to the one-shot scenar…”
BackgroundWeak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity
Winter, A. (2015) · Journal of Cryptology · doi:10.1007/s00145-015-9215-3 · Cited by 19
Unified Quantum Convolutional CodingPreprint
Wilde, M. M., & Brun, T. A. (2008) · Cited by 17
Temperley–Lieb Quantum Channels
Brannan, M., Collins, B., Lee, H. H., & Youn, S.-G. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03731-2 · Cited by 14
Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel
Salek, F., Hsieh, M.-H., & Fonollosa, J. R. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849633 · Cited by 9
“…classical result of Watanabe and Oohama [7], but also the case of simultaneous transmission of public and private information [23], the simultaneous transmission of the classical and quantum information [11], [24] and the capacity region of the quantum broadcast channel by Yard-Hayden-Devetak [26].”
BackgroundEntropic singularities give rise to quantum transmission
Siddhu, V. (2021) · RePEc: Research Papers in Economics · Cited by 13
Quantum capacity of an amplitude-damping channel with memory
Jahangir, R., Arshed, N., & Toor, A. H. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0883-y · Cited by 15
“However, for degradable channels, Ic reduces to a conditional entropy, which is subadditive and concave [43].”
BackgroundQuantum Subdivision Capacities and Continuous-Time Quantum Coding
Müller‐Hermes, A., Reeb, D., & Wolf, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2366456 · Cited by 18
Communicating Over Adversarial Quantum Channels Using Quantum List Codes
Leung, D., & Smith, G. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913433 · Cited by 22
“Various asymptotic capacities of quantum channels have bee n studied [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11].”
BackgroundIdentification via Quantum Channels
Winter, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36899-8_9 · Cited by 18
“N For example for the erasure channel E q , the quantum-classical-capacity region is known [16] to be conv (cid:8) (0 , 0) , (0 , 1 − q ) , (1 − 2 q ) + , 0 , so the above maximization yields which is strictly better in the interval [0 , ).”
BackgroundCoherent-state constellations and polar codes for thermal Gaussian channels
Lacerda, F. G., Renes, J. M., & Scholz, V. B. (2017) · Physical Review A · doi:10.1103/physreva.95.062343 · Cited by 13
Approximate degradable quantum channels
Sutter, D., Scholz, V. B., & Renner, R. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282960 · Cited by 16
Enhanced deterministic joint remote state preparation under Pauli channels with memory
Zhang, Z., & Sun, M. (2020) · Physica Scripta · doi:10.1088/1402-4896/ab71be · Cited by 13
“And for the dephasing-type channels with p 0 = 1 − p and p i = p , where i is 1, 2 or 3, the coherent information is additive [ 54 ] .”
BackgroundQuantum Channel Capacities per Unit Cost
Ding, D., Pavlichin, D. S., & Wilde, M. M. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2854747 · Cited by 16
“The entanglement-assisted capacity cost function for a quantum channel NA′→B is given by CEA(N , β) = maxϕAA′ tr[GϕA′ ]≤β I(A;B)ϕ, (4.2) where ϕAA′ is a pure bipartite state.”
BackgroundInfluentialEquality conditions for the quantum f-relative entropy and generalized data processing inequalities
Sharma, N. K. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0238-x · Cited by 20
“For f ( t ) = − ln ( t ) , it was shown by Devetak and Shor that coherent information is related to the quantum channel capacity [31].”
BackgroundThe Platypus of the Quantum Channel Zoo
Leditzky, F., Leung, D., Siddhu, V., Smith, G., & Smolin, J. A. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3245985 · Cited by 23
“The only other channel classes with known additive coherent information are the degradable [10] and antidegradable channels, which as a result have a so-called single-letter formula for their quantum capacity.”
BackgroundInfluentialHybrid classical-quantum communication networks
Lukens, J. M., Peters, N. A., & Qi, B. (2025) · Progress in Quantum Electronics · doi:10.1016/j.pquantelec.2025.100586 · Cited by 26
Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
Wang, D., Wang, Y.-J., Cao, N., Zeng, B., & Laflamme, R. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac4737 · Cited by 13
“In addition, we note that in the setting of quantum communication there are also other quantities such as channel capacities [75, 85, 86].”
BackgroundOne-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information
Salek, F., Anshu, A., Hsieh, M.-H., Jain, R., & Fonollosa, J. R. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2945800 · Cited by 18
“Devetak and Shor [19] unified the classical and quantum capacities and introduced a new information-processing task studying the simultaneously achievable rates for transmission of classical and quantum information over a quantum channel.”
BackgroundMethodInfluentialOne-shot capacity bounds on the simultaneous transmission of classical and quantum information
Salek, F., Anshu, A., Hsieh, M.-H., Jain, R., & Fonollosa, Jr. (2020) · UTS ePRESS (University of Technology Sydney) · Cited by 12
Enhanced energy-constrained quantum communication over bosonic Gaussian channels
Noh, K., Pirandola, S., & Jiang, L. (2020) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 12
Bounding Quantum Capacities via Partial Orders and Complementarity
Hirche, C., & Leditzky, F. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3199578 · Cited by 16
“4 imply that this gap is controlled by the corresponding capacity of the complementary channel, generalizing the results by Watanabe [13] which in turn extended prior additivity results for degradable and antidegradable channels [11], [12].”
BackgroundResultInfluentialOpen Problems in Quantum Information Theory
Ruskai, M. B. (2007) · Cited by 12
One-Shot Randomized and Nonrandomized Partial Decoupling
Wakakuwa, E., & Nakata, Y. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04136-5 · Cited by 16
Myhr, G. O. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.0766 · Cited by 17
Capacities of Grassmann channels
Brádler, K., Jochym-O’Connor, T., & Jáuregui, R. (2011) · Journal of Mathematical Physics · doi:10.1063/1.3597233 · Cited by 11
Trade-off coding for universal qudit cloners motivated by the Unruh effect
Jochym-O’Connor, T., Brádler, K., & Wilde, M. M. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.48550/arxiv.1103.0286 · Cited by 12
“Devetak and Shor showed that the capacity region for a noisy quantum channel N is as follows [17]: CCQ(N ) ≡ ∞ ⋃ k=1 1 k C((1)) CQ(N⊗k), (10)”
Nonlocal quantum information in bipartite quantum error correction
Wilde, M. M., & Fattal, D. A. (2010) · Civil War Book Review · Cited by 11
The private classical capacity of a partially degradable quantum channel
Gyöngyösi, L. (2014) · Physica Scripta · doi:10.1088/0031-8949/2014/t163/014030 · Cited by 9
“Similar to degradable channels [5, 9], the quantum capacity of a PD channel has been proven to be additive [1].”
BackgroundQuantum channels arising from abstract harmonic analysis
Crann, J., & Neufang, M. (2013) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/46/4/045308 · Cited by 11
“Although this has been studied quite extensively [14, 57, 11, 26], especially in the memory setting, the connection with the geometric representation may provide insight into capacities of other quantum channels.”
BackgroundBrádler, K. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/12/125301 · Cited by 12
Quantum informational properties of the Landau–Streater channel
Filippov, S. N., & Kuzhamuratova, K. V. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5037700 · Cited by 12
Role of chaos in quantum communication through a dynamical dephasing channel
Lemos, G. B., & Benenti, G. (2010) · Physical Review A · doi:10.1103/physreva.81.062331 · Cited by 11
Capacities of Gaussian Quantum Channels With Passive Environment Assistance
Oskouei, S. K., Mancini, S., & Winter, A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3122150 · Cited by 16
Широков, М. Е. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4827436 · Cited by 9
Li, C.-K., Lyles, S., & Poon, Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02639-z · Cited by 16
“H={{1,1},{1,-1}}/Sqrt[2]; x={{0,1},{1,0}}; y={{0,-I},{I,0}}; z={{1,0},{0,-1}}; DX = DiagonalMatrix[{1, -1, 1, -1}]; DY = DiagonalMatrix[{-1, -1, 1, 1}]; DZ = DiagonalMatrix[{1, -1, -1, 1}]; P2=CNOT[2,0,1].”
BackgroundInfluentialQubit quantum channels: A characteristic function approach
Caruso, F., & Giovannetti, V. (2007) · Physical Review A · doi:10.1103/physreva.76.042331 · Cited by 10
Antipin, K. V. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac37e5 · Cited by 15
Giovannetti, V., & Holevo, A. S. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0073-x · Cited by 8
Non-Additivity in Classical-Quantum Wiretap Channels
Tikku, A., Berta, M., & Renes, J. M. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3015254 · Cited by 11
Entanglement and mixed states of Young tableau states in gauge/gravity correspondence
Lin, H., & Zhu, Y. (2021) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2021.115572 · Cited by 10
“In this case, ρB may be understood as being through a conjugate channel [77, 78, 79].”
BackgroundResonant Multilevel Amplitude Damping Channels
Chessa, S., & Giovannetti, V. (2023) · Quantum · doi:10.22331/q-2023-01-19-902 · Cited by 16
“An exception to this predicament is given by degradable [5] and antidegradable [28] channels, whose definitions and properties are reviewed here.”
BackgroundApproaching the Quantum Singleton Bound with Approximate Error Correction
Bergamaschi, T., Golowich, L., & Gunn, S. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649680 · Cited by 26
“[21,30,50, 55, 69, 74] proved Singleton bounds and other upper bounds on the capacity of quantum codes, even in the presence of quantum or classical side-channels.”
BackgroundSecure Communication with Unreliable Entanglement Assistance
Lederman, M., & Pereg, U. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619085 · Cited by 13
“While such a characterization can be difficult to compute, it yields computable lower bounds, as well as a single-letter capacity formula in special cases [20, 21].”
BackgroundEstimating the output entropy of a tensor product of two quantum channels
Amosov, G. G. (2015) · Theoretical and Mathematical Physics · doi:10.1007/s11232-015-0270-6 · Cited by 9
On the General Definition of the Production of Entropy in Open Markov Quantum Systems
Trushechkin, A. S. (2019) · Journal of Mathematical Sciences · doi:10.1007/s10958-019-04417-4 · Cited by 11
Partially Coherent Direct Sum Channels
Chessa, S., & Giovannetti, V. (2021) · Quantum · doi:10.22331/q-2021-07-15-504 · Cited by 20
“For dA = dB = 1 we recover the quantum capacity of the qubit dephasing channel of [31].”
BackgroundMethodInfluentialBassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2020) · Foundations in signal processing, communications and networking · doi:10.1007/978-3-030-62938-0_4 · Cited by 10
Unified-entropy trade-off relations for a single quantum channel
Rastegin, A. E. (2013) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/46/28/285301 · Cited by 10
Infinite Families of Quantum-Classical Hybrid Codes
Nemec, A., & Klappenecker, A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3051037 · Cited by 12
“Here we give the generator matrix for the [[7 , 1:1 , 3]] 2 hybrid stabilizer code given in [14]: The generators above the dotted line generate S Q , and the generator between the dotted line gives S C .”
BackgroundMethodInfluentialComputational Distinguishability of Quantum ChannelsPreprint
Rosgen, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.3930 · Cited by 13
“ich there exists a second channel that maps the output of to the environment of , i.e. the space that is traced out in a Stinespring representation. These channels were introduced by Shor and Devetak [DS05] and can be thought of as the channels where the environment contains no information that is not also present in…”
BackgroundInfluentialQuantum Subdivision Capacities and Continuous-time Quantum CodingPreprint
Müller‐Hermes, A., Reeb, D., & Wolf, M. M. (2016) · Cited by 13
Quantum-classical correspondence in quantum channels
Vijaywargia, B., & Lakshminarayan, A. (2025) · Physical review. E · doi:10.1103/physreve.111.014210 · Cited by 13
“The complementary channel [64–66] associated with M ( U ) is defined as This channel can be written in terms of the partial transpose of U : where, T 2 is one of two partial transposition operations: ⟨ iα | U | jβ ⟩ = ⟨ jα | U T 1 | iβ ⟩ = ⟨ iβ | U T 2 | jα ⟩ .”
State Convertibility in the von Neumann Algebra Framework
Crann, J., Kribs, D. W., Levene, R. H., & Todorov, I. G. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03803-3 · Cited by 17
“udy the generalisation of our main result to the non-factor setting in connection with [24], as mentioned at the end of Section 5. This could be useful for the study of entanglement in hybrid systems [33, 15, 3, 4]. Second, a rectangular version of our main theorem, describing convertibility between states ψ∈ Hand ϕ∈…”
BackgroundTrade-Offs on Number and Phase Shift Resilience in Bosonic Quantum Codes
Ouyang, Y., & Campbell, E. T. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3102873 · Cited by 13
“Fortunately for us, Eσ is degradable, because it has simultaneously diagonal Kraus operators [27].”
BackgroundDegradability of Fermionic Gaussian Channels
Greplová, E., & Giedke, G. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.200501 · Cited by 13
Nemec, A., & Klappenecker, A. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437497 · Cited by 9
“Devetak and Shor showed in [2] that a time-sharing approach for the transmission of classical and quantum information is in general inferior to a simultaneous transmission.”
BackgroundStrong Converse for the Quantum Capacity of the Erasure Channel for Almost All CodesPreprint
Wilde, M. M., & Winter, A. (2014) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2014.52 · Cited by 11
Quantum resource theory of coding for error correction
Wang, D., Liu, Y., Wang, Y.-J., & Luo, S. (2024) · Physical Review A · doi:10.1103/physreva.110.032413 · Cited by 9
Efficient quantum channel coding scheme requiring no preshared entanglement
Sutter, D., Renes, J. M., Dupuis, F., & Renner, R. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620247 · Cited by 7
“This is in agreement with the known result that for degradable channels the coherent information is optimal [20].”
ResultBoche, H., Janßen, G., & Saeedinaeeni, S. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5078430 · Cited by 8
Capacities of the covariant Pauli channel
Poshtvan, A., & Karimipour, V. (2022) · Physical Review A · doi:10.1103/physreva.106.062408 · Cited by 9
“In comparison with quantum capacity, Cp(Λ) ≥ Cq(Λ) but for degradable channels we know that Cp(Λ) = Cq(Λ) [46].”
BackgroundPublic Quantum Communication and Superactivation
Brandão, F. G. S. L., & Oppenheim, J. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2236911 · Cited by 18
“Our formula turns out to be a direct generalization of both the formulae for (one-way) distillable entanglement and distillable secret-key of Devetak and Winter [6].”
MethodBoche, H., Janßen, G., & Saeedinaeeni, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2358-7 · Cited by 8
Antipin, K. V. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128248 · Cited by 7
Quantum capacity of Pauli channels with memory
Huang, P. F., He, G., Lu, Y., & Zeng, G. (2010) · Physica Scripta · doi:10.1088/0031-8949/83/01/015005 · Cited by 8
On the Security and Degradability of Gaussian Channels
Pirandola, S., Braunstein, S. L., & Lloyd, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10698-9_5 · Cited by 7
A Unification of the Coding Theory and OAQEC Perspectives on Hybrid Codes
Majidy, S. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05439-0 · Cited by 14
“[1].”
Complementarity and additivity for depolarizing channelsPreprint
Datta, N., & Holevo, A. S. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0510145 · Cited by 7
“and (with some strain) can be interpreted as an interaction of the system A with environment B in the chaotic state followed by partial dephasing, cf. [ 6 ].”
BackgroundExtreme Points and Factorizability for New Classes of Unital Quantum Channels
Haagerup, U., Musat, M., & Ruskai, M. B. (2021) · Annales Henri Poincaré · doi:10.1007/s00023-021-01071-y · Cited by 6
Noisy Werner-Holevo channel and its properties
Roofeh, S., & Karimipour, V. (2024) · Physical Review A · doi:10.1103/physreva.109.052620 · Cited by 9
“As a prerequisite to this investigation, we will study the so-called degradability and anti-degradability [44]conditions for the channel.”
MethodEffects of imperfect noise correlations on decoherence-free subsystems: SU(2) diffusion model
Demkowicz-Dobrzański, R., Kolenderski, P. L., & Banaszek, K. (2007) · Physical Review A · doi:10.1103/physreva.76.022302 · Cited by 8
Quantum-capacity-approaching codes for the detected-jump channel
Grassl, M., Ji, Z., Wei, Z., & Zeng, B. (2010) · Physical Review A · doi:10.1103/physreva.82.062324 · Cited by 4
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
Sharma, N. K. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513655 · Cited by 8
Higher rank matricial ranges and hybrid quantum error correction
Cao, N., Kribs, D. W., Li, C.-K., Nelson, M. I., Poon, Y., & Zeng, B. (2020) · Linear and Multilinear Algebra · doi:10.1080/03081087.2020.1748852 · Cited by 15
“It has been proved that transmitting classical and quantum information simultaneously provides advantages from an information-theoretic perspective [25].”
BackgroundStabilizer Formalism for Operator Algebra Quantum Error Correction
Dauphinais, G., Kribs, D. W., & Vasmer, M. (2024) · Quantum · doi:10.22331/q-2024-02-21-1261 · Cited by 22
“Subsequently, a further generalization was discovered, called ‘operator algebra quantum error correction’ (OAQEC) [9,10], which additionally provided an approach for hybrid classical-quantum and infinite-dimensional error correction [11, 21, 36, 37, 45].”
MethodWhat exactly does Bekenstein bound?
Hayden, P. M., & Wang, J. (2025) · Quantum · doi:10.22331/q-2025-03-20-1664 · Cited by 10
“The quantum capacity is generally superadditive, but it is additive for degradable channels [45].”
Degradable quantum channels using pure-state to product-of-pure-state isometries
Siddhu, V., & Griffiths, R. B. (2016) · Physical Review A · doi:10.1103/physreva.94.052331 · Cited by 8
“However, Devetak and Shor [3] showed that Q(1) is additive for any two (not necessarily identical) degradable quantum channels (see the definition in Sec.”
BackgroundInfluentialThe coherent information on the manifold of positive definite density matrices
Tehrani, A. M., & Pereira, R. (2021) · Journal of Mathematical Physics · doi:10.1063/5.0020254 · Cited by 5
Variational estimation of capacity bounds for quantum channels
Rehman, J. U., Hong, S., Kim, Y., & Shin, H. (2022) · Physical Review A · doi:10.1103/physreva.105.032616 · Cited by 5
One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
Wakakuwa, E., & Nakata, Y. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3222775 · Cited by 11
“[11], [12]; and the capacity of a quantum channel for simultaneously transmitting classical and quantum messages was obtained by Devetak and Shor [13].”
BackgroundMethodInfluentialNoisy Landau-Streater and Werner-Holevo channels in arbitrary dimensions
Karimipour, V. (2024) · Physical Review A · doi:10.1103/physreva.110.022424 · Cited by 6
Quantum and private capacities of low-noise channels
Leditzky, F., Leung, D., & Smith, G. (2017) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2017.8278040 · Cited by 9
Single-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages
Salek, F., Hsieh, M.-H., & Fonollosa, J. R. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3013098 · Cited by 8
Information transmission with continuous variable quantum erasure channels
Zhong, C., Oh, C., & Jiang, L. (2023) · Quantum · doi:10.22331/q-2023-03-06-939 · Cited by 5
The capacity of transmitting atomic qubit with light
Chen, X. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0152-7 · Cited by 7
“This general result of capacity involves multiple use of the channel, it is called the regulationofthechannel.Thecoherentinformationisusuallynotaconvexfunctionof the input state, hence it is very difficult to carry out the capacity for a general channel map.Fortunately, ifthechannel mapisdegradable, thecapacitycanbeca…”
BackgroundWatrous, J. (2018) · Cambridge University Press eBooks · doi:10.1017/9781316848142.009 · Cited by 5
Coherent information phase transition in a noisy quantum circuit
Qian, D., & Wang, J. (2025) · Physical review. B./Physical review. B · doi:10.1103/b8tq-z48t · Cited by 7
Gielerak, R. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04059-1 · Cited by 4
Quantum capacity of a deformed bosonic dephasing channel
Dehdashti, S., Nötzel, J., & van Loock, P. (2025) · Optical Switching and Networking · doi:10.1016/j.osn.2025.100814 · Cited by 9
Privacy from Accelerating Eavesdroppers: The Impact of Losses
Bognat, A., & Hayden, P. M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06880-0_9 · Cited by 7
Mixed-state certification of quantum capacities for noisy communication channels
Macchiavello, C., & Sacchi, M. F. (2018) · Physical Review A · doi:10.1103/physreva.97.012303 · Cited by 4
An Operational Environment for Quantum Self-Testing
Christandl, M., Houghton-Larsen, N. G., & Mančinska, L. (2022) · Quantum · doi:10.22331/q-2022-04-27-699 · Cited by 6
Quantum Teleportation in the Commuting Operator Framework
Conlon, A., Crann, J., Kribs, D. W., & Levene, R. H. (2022) · Annales Henri Poincaré · doi:10.1007/s00023-022-01255-0 · Cited by 11
“This could arise, for instance, with subsystem codes used in quantum algorithms and fault-tolerant quantum computing architectures [1,6,63,65,77,81] or hybrid codes used for the simultaneous transmission of classical and quantum information in communication schemes [15,16,24,33,47,64,67,74,75].”
MethodSingleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes
Mamindlapally, M., & Winter, A. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3277808 · Cited by 10
“Restrictions apply. breakthrough paper by Devetak and Shor [12], which showed how to analyse the capacity region of joint classical and quantum information transmission over a given noisy channel.”
BackgroundAldosari, F. M., Alsahli, A. M., Mohamed, A. A., & Rahman, A. (2023) · Annalen der Physik · doi:10.1002/andp.202300094 · Cited by 4
Local Quantum Joint Entropy and Quantum Coherence Information Based on Local Quantum Bernoulli Noise
Han, Q., Gou, L., Wang, S., & Zhang, R. (2024) · Journal of Statistical Physics · doi:10.1007/s10955-024-03280-1 · Cited by 4
“Devetak and Shor indicated that the coherent information of the quantum channel is additive to the degradable channel [20].”
Strelchuk, S., & Oppenheim, J. (2012) · Physical Review A · doi:10.1103/physreva.86.022328 · Cited by 4
“A second criterion, is if the channel produces states which would lead to cloning [4] – i.”
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.