The quantum dynamic capacity formula of a quantum channel
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
The dynamic capacity theorem characterizes the reliable communication rates of a quantum channel when combined with the noiseless resources of classical communication, quantum communication, and entanglement. In prior work, we proved the converse part of this theorem by making contact with many previous results in the quantum Shannon theory literature. In this work, we prove the theorem with an “ab initio” approach, using only the most basic tools in the quantum information theorist’s toolkit: the Alicki-Fannes’ inequality, the chain rule for quantum mutual information, elementary properties of quantum entropy, and the quantum data processing inequality. The result is a simplified proof of the theorem that should be more accessible to those unfamiliar with the quantum Shannon theory literature. We also demonstrate that the “quantum dynamic capacity formula” characterizes the Pareto optimal trade-off surface for the full dynamic capacity region. Additivity of this formula reduces the computation of the trade-off surface to a tractable, textbook problem in Pareto trade-off analysis, and we prove that its additivity holds for the quantum Hadamard channels and the quantum erasure channel. We then determine exact expressions for and plot the dynamic capacity region of the quantum dephasing channel, an example from the Hadamard class, and the quantum erasure channel.
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
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
The 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
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
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
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
The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Devetak, I., & Shor, P. W. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1317-6 · Cited by 445 · cited 1×
“[12,27].”
Codes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374 · cited 1×
“A quantum erasure channel with erasure parameter is the following map [13]: N (ρ) ≡ (1− ) ρ+ |e〉 〈e| .”
Capacities 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
Entanglement-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 · cited 9×
“[16,15,17] is that its computation for a general quantum channel is intractable.”
BackgroundMethodInfluentialSelf-citationTrading 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
Self-citation
Cited by
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
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
Entanglement-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
Self-citationEntanglement-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
“Its entanglement consumption rate is provably optimal for certain channels such as the dephasing channel [61]–[63], but it is not necessarily optimal for the depolarizing channel.”
Self-citation
Metadata
- Authors
- Wilde, M. M., & Hsieh, M.-H.
- Venue
- Quantum Information Processing
- Published
- 2011-09-24
- Volume
- 11
- Issue
- 6
- Pages
- 1431-1463
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W2105061359
- Cited by
- 43
- References
- 10
- FWCI
- 1.77
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The quantum dynamic capacity formula of a quantum channel. https://app.cochat.ai/papers/10.1007/s11128-011-0310-6
- The paper
- Wilde, M. M., & Hsieh, M.-H. (2012). The quantum dynamic capacity formula of a quantum channel. Quantum Information Processing. https://doi.org/10.1007/s11128-011-0310-6
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.