Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding
Farzin Salek, Patrick Hayden, Masahito Hayashi

TL;DR
This paper advances quantum broadcast communication by developing non-unique decoding techniques for three-receiver channels, constructing one-shot codes, and establishing achievable rate regions and simpler proofs for known bounds.
Contribution
It introduces quantum non-unique decoding using simultaneous pinching, constructs one-shot codes for degraded message sets, and simplifies proofs of Marton's inner bound in quantum broadcast channels.
Findings
Developed quantum non-unique decoding technique.
Constructed one-shot codes with achievable rate regions.
Provided a simpler proof of Marton's inner bound.
Abstract
In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. This is modeled mathematically as a degraded message set, indicating a hierarchy between messages to be decoded by different receivers, where the default quality corresponds to a common message intended for all receivers, a higher quality is represented by a message for a smaller subset of receivers, and so forth. We extend these considerations to quantum communication, exploring three-receiver quantum broadcast channels with two- and three-degraded message sets. Our technical tool involves employing quantum non-unique decoding, a technique we develop by…
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Molecular Communication and Nanonetworks
