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-citationCapacity of the noisy quantum channel
Lloyd, S. (1997) · Physical Review A · doi:10.1103/physreva.55.1613 · Cited by 783 · cited 1×
“The quantum capacity theorem was originally stated by Lloyd [ 19 ], although it was only recently generally realized that his proof could be made rigorous [18].”
BackgroundPositive Functions on C ∗ -Algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.2307/2032342 · Cited by 714
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698 · cited 1×
“The original paper on the entanglement assisted capacity [4] describes how to achieve”
BackgroundSelf-citationQuantum data processing and error correction
Schumacher, B., & Nielsen, M. A. (1996) · Physical Review A · doi:10.1103/physreva.54.2629 · Cited by 654 · cited 1×
“Whenever the state ρ comes about by sending some pure state |φ〉AA′ through the channel N , we may use the alternative notation [20] Ic(φ A′ ,N ) := Ic(A 〉B)ρ, since this quantity is independent of the particular purification |φ〉AA ′ of φ ′ .”
Coding theorem and strong converse for quantum channels
Winter, A. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796385 · Cited by 451 · cited 1×
“Thus by the gentle measurement lemma [26]”
Information transmission through a noisy quantum channel
Barnum, H., Nielsen, M. A., & Schumacher, B. (1998) · Physical Review A · doi:10.1103/physreva.57.4153 · Cited by 394 · cited 1×
“The first inequality is the data processing inequality [2], the second follows from the fact that conditioning cannot increase quantum relative entropy [18] and the third is an application of lemma 3.”
BackgroundCapacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365 · cited 1×
“Two simple examples in which this limit is not required are the noiseless qubit channel and the erasure channel, for which both C(N ) and Q(N ) were previously known [3].”
BackgroundQuantum-channel capacity of very noisy channels
DiVincenzo, D. P., Shor, P. W., & Smolin, J. A. (1998) · Physical Review A · doi:10.1103/physreva.57.830 · Cited by 297 · cited 1×
“For the depolarizing channel, another popular example, the l → ∞ limit is known to be needed when the depolarizing parameter is close to p = 0.189, the value making Q(N) = 0 [ 13 ].”
BackgroundInfluentialSelf-citationOn quantum fidelities and channel capacities
Barnum, H., Knill, E., & Nielsen, M. A. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850671 · Cited by 199 · cited 3×
“Condition 2 above corresponds to the subspace transmission criterion of [1].”
BackgroundInfluentialOn Quantum Fidelities and Channel Capacities
Barnum, H., Knill, E. H., & Nielsen, M. A. (2000) · Bristol Research (University of Bristol) · Cited by 157
Relative entropy in quantum information theory
Schumacher, B. W., & Westmoreland, M. D. (2002) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/305/05225 · Cited by 144 · cited 1×
“It is known [22] that the classical capacity of a noiseless channel combined with a noisy one is just the sum of the individual capacities.”
BackgroundDevetak, I., Harrow, A. W., & Winter, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.230504 · Cited by 124
Self-citationRelating Quantum Privacy and Quantum Coherence: An Operational Approach
Devetak, I., & Winter, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.080501 · Cited by 116
Self-citationThe classical capacity achievable by a quantum channel assisted by limited entanglement
Shor, P. W. (2004) · Quantum Information and Computation · doi:10.26421/qic4.6-7-12 · Cited by 64
Self-citationThe capacity of hybrid quantum memory
Kuperberg, G. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.811917 · Cited by 59 · cited 1×
“In [14] the task of quantum compression with classical side information was considered (see also [ 18 ]).”
BackgroundTrading quantum for classical resources in quantum data compression
Hayden, P. M., Jozsa, R., & Winter, A. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1497184 · Cited by 43 · cited 2×
“In [13] the task of quantum compression with classical side information was considered.”
BackgroundThe classical capacity achievable by a quantum channel assisted by a limited entanglement
Shor, P. W. (2004) · doi:10.5555/2011593.2011605 · Cited by 25
Self-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
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.