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
Items 401–439 of 439
Quantum capacity of lossy channel with additive classical Gaussian noise : a perturbation approachPreprint
Chen, X. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.0417
Practical Quantum Fingerprinting and Appointment Scheduling
Lovitz, B. (2017) · UWSpace (University of Waterloo)
The implementation of hybrid codes and nuclear magnetic resonance quantum information processing
Majidy, S. (2017) · The Atrium (University of Guelph) · Cited by 1
The existence of conjugate degradable channels that are not degradablePreprint
Brádler, K. (2014) · arXiv (Cornell University)
Energy-Constrained Quantum Communication and Digital Dynamical Decoupling
Qi, H. (2017) · Louisiana State University · doi:10.31390/gradschool_dissertations.4131
“To do so, we make use of several ideas from [43, 73, 74, 75].”
BackgroundMethodCoherent information of one-mode Gaussian channels -- the case of nonzero additive classical noisePreprint
Brádler, K. (2014) · arXiv (Cornell University)
Boche, H., Janßen, G., & Saeedinaeeni, S. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849791 · Cited by 1
Higher Rank Matricial Ranges and Hybrid Quantum Error CorrectionPreprint
Kribs, D. W., Cao, N., Li, C.-K., Poon, Y., Zeng, B., & Nelson, M. I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.12744
“It has been proved that transmitting classical and quantum information simultaneously provides advantages from an information-theoretic perspective [25].”
BackgroundCommunication over Random-Parameter Quantum Channels with Parameter EstimationPreprint
Pereg, U. (2020) · arXiv (Cornell University)
Additivity in Classical-Quantum Wiretap Channels
Tikku, A., Renes, J. M., & Berta, M. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174320
“As the regularization is in general needed for the fully quantum case [3], [4], this raises the question when exactly A well-known sufficient criteria for additivity of the private information is degradability [9], [10].”
BackgroundFrom hypothesis testing of quantum channels to secret sharing
Salek, F. (2020) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-340975
Nelson, M. I. (2021) · The Atrium (University of Guelph) · doi:10.26421/qic19.1-2-5
“This linkage of two fundamental topics in quantum information has more recently [14] been extended to the complementarity of appropriate notions of correctable operator algebras [6, 7] and private subsystems and algebras [1, 9, 2, 3, 13, 22, 23, 34, 35, 14], and to a setting that embraces descriptions of hybrid classi…”
BackgroundSharma, K. (2021) · Louisiana State University · doi:10.31390/gradschool_dissertations.5495
Trade-offs on number and phase shift resilience in bosonic quantum codes
Ouyang, Y., & Campbell, E. T. (2021) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York)
Filippov, S. N. (2021) · arXiv (Cornell University)
Imre, S., & Gyöngyösi, L. (2012) · Wiley eBooks · doi:10.1002/9781118337462.refs
Bassoli, 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_1 · Cited by 1
Quantum Information Theory in Infinite Dimensions with Application to Optical Channels
Sharma, V., & Shenoy, K. G. (2022) · Journal of the Indian Institute of Science · doi:10.1007/s41745-022-00321-0 · Cited by 2
Quantum Information Concepts in Open Quantum Systems
Vacchini, B., Smirne, A., & Megier, N. (2023) · MDPI eBooks · doi:10.3390/books978-3-0365-6498-2
Bassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2023) · Springer eBooks · doi:10.1007/978-3-031-26326-2_4
Bassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2023) · Springer eBooks · doi:10.1007/978-3-031-26326-2_1
Protecting classical-quantum signals in free-space optical channels
Villaseñor, E., Winnel, M. S., Ralph, T. C., Aguinaldo, R., Green, J., & Malaney, R. (2023) · Physical Review A · doi:10.1103/physreva.107.062616
“Interestingly, CV quantum and coherent communications can coexist using the same signal [8]–[12], and it is this interesting co-existence of classical and quantum information we study here.”
BackgroundXia, S.-K., & Zeng, M.-J. (2023) · Journal of Combinatorial Optimization · doi:10.1007/s10878-023-01060-3
“L It uses classical bits to represent information, and uses quantum channels to transmit 2 bits of classical information by sending only 1 qubit (Devetak and Shor 2005).”
RetractedExplicit decoders using fixed-point amplitude amplification based on QSVT
Utsumi, T., & Nakata, Y. (2026) · Quantum · doi:10.22331/q-2026-03-13-2024 · Cited by 8
“From a theoretical viewpoint, it may also be interesting to address the question about whether a similar approach to that in this work function for recovering classical [78, 79] or hybrid [80–83] information.”
Широков, М. Е. (2024) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080224603151
Quantum Security for the Tactile Internet
Hassanpour, S., Bassoli, R., Nötzel, J., Fitzek, F. H. P., Boche, H., & Strufe, T. (2024) · Wiley eBooks · doi:10.1002/9781119988007.ch7 · Cited by 1
Application of α-order information metrics for secure communication in quantum physical layer design
Hayashi, M., & Vázquez‐Castro, M. A. (2025) · AVS Quantum Science · doi:10.1116/5.0260710
Quantum Key Distribution - A Networking Business Model
Mehić, M., Raß, S., Jakovlev, S., & Vozn̆ák, M. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00054
“Prior work utilized Jackson networks [3] to measure or compute the available end-to-end bandwidth, based on point-to-point bandwidths [4] and key-growth rates.”
Antidegradable quantum channel with additional entanglement for quantum transduction
Zhong, C. (2025) · Physical Review Applied · doi:10.1103/4g6d-6cmg
Zammit, H., Salazar, R., Valentino, G., Briffa, J. A., & Apollaro, T. J. G. (2026) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae85ea · Cited by 3
Exact quantum capacity of decohering channels in arbitrary dimensions
Roofeh, S., & Karimipour, V. (2025) · Physical Review A · doi:10.1103/s124-z299 · Cited by 1
“The channel E is said to be degradable if there exists a quantum channel M : For a degradable channel the additivity property holds and we have [12], and in this case the calculation of the quantum capacity becomes a convex optimization problem.”
InfluentialAbout Immediate Physical Phenomena and Space as a Direct Medium of InformationPreprint
Fiscaletti, D. (2010) · viXra
Small perturbations of coherent information
Wu, Z., Ma, Z., & Fullwood, J. (2026) · Physical Review A · doi:10.1103/nclh-7gdf · Cited by 3
Sehdaran, F. S., Lupo, C., Farman, F., Bahrampour, A., & Bahrampour, A. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07671-z
Entanglement Fidelity in Standard Quantum Channels
Zanieri, N., & Kountouris, M. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00121
“Entanglement fidelity is directly connected to central topics in quantum information theory, including quantum error correction [3], entanglement transmission and channel capacities [4], [5], and rate-distortion formulations with correlation-sensitive distortion measures [6].”
Construction of channels which in every dimension anti-degrade the depolarizing channel
Roofeh, S., & Karimipour, V. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05208-y · Cited by 5
“An important development in this direction was made by introducing the concepts of degradablity or anti-degradability of quantum channels [20, 21].”
InfluentialQuantum channel capacity analysis of a dissipative three-mode system
Patel, U., Prasanna, C. R., Chivukula, A. S., & Chaitanya, K. V. S. S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05305-y
“Similar connections between coherent information, channel capacities, and entropy-based measures have been discussed in studies of quantum communication channels [20, 27, 28].”
Error-Correction Transitions in Finite-Depth Quantum Channels
Anonymous, Lami, G., Ribeiro, P., Luca, A. D., & Nardis, J. D. (2026) · Physical Review Letters · doi:10.1103/drwg-dgb7 · Cited by 2
“As a diagnostic of information transmission we use the coherent information I c , the key quantity underlying quantum capacity theorems [40, 41].”
Mesnager, S., & Raja, R. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3729130
“If C D (cid:19) ⊆ C ⊥ D , one employs the entanglement-assisted framework of Brun et al. [8], [16], where non-commuting pairs are compensated by consuming shared entanglement.”
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.