Simultaneous classical-quantum capacities of quantum multiple access channels
Jon Yard

TL;DR
This paper characterizes the capacity regions for simultaneous classical and quantum information transmission over quantum multiple access channels, providing single-letter descriptions and examples for specific cases.
Contribution
It introduces the capacity regions for simultaneous classical-quantum transmission in quantum multiple access channels with single-letter characterizations for certain cases.
Findings
Capacity region for classical-quantum transmission established
Single-letter descriptions provided for specific channel examples
Expanded tutorial content included for quantum Shannon theory
Abstract
The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The first describes the region of rates at which one sender can send classical information while the other sends quantum information. The second describes those rates at which both senders can send quantum information. For each of these situations, an example of a channel is given for which the associated region admits a single-letter description. This is the author's Ph.D. dissertation, submitted to the Department of Electrical Engineering at Stanford University in March, 2005. It represents an expanded version of the paper quant-ph/0501045, containing a number of tutorial chapters which may be of independent interest for those learning about quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Molecular Communication and Nanonetworks
