Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which each sender can send quantum information. For each region, we give an example of a channel for which the corresponding region has a single-letter description. One of our examples relies on a new result proved here, perhaps of independent interest, stating that the coherent information over any degradable channel is concave in the input density operator. We conclude with connections to other work and a discussion on generalizations where each user simultaneously sends classical and quantum information.
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
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
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
An operational approach to quantum probability
Davies, E. B., & Lewis, J. T. (1970) · Communications in Mathematical Physics · doi:10.1007/bf01647093 · Cited by 888
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 · cited 1×
“inequality [24], of which a recent simple proof can be found in [25].”
BackgroundThe 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
Self-citationNoncommuting Mixed States Cannot Be Broadcast
Barnum, H., Caves, C. M., Fuchs, C. A., Jozsa, R., & Schumacher, B. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.2818 · Cited by 654 · cited 1×
“Second, one can derive from that characterization the following monotonicity property [14] associated with an arbitrary trace-preserving channel :”
BackgroundMonogamy of quantum entanglement and other correlations
Koashi, M., & Winter, A. (2004) · Physical Review A · doi:10.1103/physreva.69.022309 · Cited by 609
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 5×
“Using techniques introduced in [29], each sender “shapes” their quantum information into HSW codewords.”
BackgroundMethodInfluentialSelf-citationStructure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality
Hayden, P., Jozsa, R., Petz, D., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1049-z · Cited by 429
Self-citationCapacities 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×
“The convex hull of for this channel can be readily evaluated by either using the main result of [30], or by otherwise noting that for whatever preparation probabilities used by Alice, the coherent information from Bob to Charlie is maximized by a maximally mixed input.”
Method
Cited by
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Horodecki, M., Oppenheim, J., & Winter, A. (2005) · Nature · doi:10.1038/nature03909 · Cited by 518
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].”
BackgroundA 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
Metadata
- Authors
- Yard, J., Hayden, P., & Devetak, I.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-07
- Volume
- 54
- Issue
- 7
- Pages
- 3091-3113
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2132333350
- Cited by
- 120
- References
- 10
- FWCI
- 11.66
- 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: Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions. https://app.cochat.ai/papers/10.1109/tit.2008.924665
- The paper
- Yard, J., Hayden, P., & Devetak, I. (2008). Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.924665
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.