Quantum Broadcast Channels
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a general achievable region. We also give outer bounds to the capacity regions for various special cases from the classical literature and prove that superposition coding is optimal for a class of channels. We then consider extensions of superposition coding for channels with a quantum input, where some of the messages transmitted are quantum instead of classical, in the sense that the parties establish bipartite or tripartite GHZ entanglement. We conclude by using state merging to give achievable rates for establishing bipartite entanglement between different pair of parties with the assistance of free classical communication.
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
Bell’s theorem without inequalities
Greenberger, D. M., Horne, M. A., Shimony, A., & Zeilinger, A. (1990) · American Journal of Physics · doi:10.1119/1.16243 · Cited by 2,404
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
Self-citationThe 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 2×
“A particular class of degradable channels which are relevan t to this paper are thegeneralized dephasing channels [9], [32].”
BackgroundSelf-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 by
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
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
The decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Incompatibility of quantum channels
Heinosaari, T., & Miyadera, T. (2017) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aa5f6b · Cited by 54
“Let us consider a channel Λ ∗ that has an input space H in and the output space is a tensor product This kind of channel is called a quantum broadcast channel [16].”
Background
Metadata
- Authors
- Yard, J., Hayden, P., & Devetak, I.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-10
- Volume
- 57
- Issue
- 10
- Pages
- 7147-7162
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2103018064
- Cited by
- 116
- References
- 7
- FWCI
- 3.84
- 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: Quantum Broadcast Channels. https://app.cochat.ai/papers/10.1109/tit.2011.2165811
- The paper
- Yard, J., Hayden, P., & Devetak, I. (2011). Quantum Broadcast Channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2165811
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.