Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages

Boche, Holger; Janßen, Gisbert; Saeedinaeeni, Sajad

doi:10.1063/1.5139622

Cited by 11 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…entanglement between receivers does not increase achievable rates. Related settings of the quantum MAC involve transmission of quantum information [22,23], error exponents [24], non-additivity effects [25], security [26][27][28][29], and computation codes [30]. The sixth generation of cellular network (6G) is expected to achieve gains in terms of latency, resilience, computation power, and trustworthiness in future communication systems, such as the tactile internet [31], which not only transfer data but also control physical and virtual objects, by using quantum resources [32].…”

Section: Introductionmentioning

confidence: 99%

The Quantum Multiple-Access Channel with Cribbing Encoders

Pereg,

Deppe,

Boche

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered, whereby Transmitter 2 performs a measurement on a system that is entangled with Transmitter 1. Based on the no-cloning theorem, perfect cribbing is impossible. This leads to the introduction of a MAC model with noisy cribbing. In the causal and non-causal cribbing scenarios, Transmitter 2 performs the measurement before the input of Transmitter 1 is sent through the channel. Hence, Transmitter 2's cribbing may inflict a "state collapse" for Transmitter 1. Achievable regions are derived for each setting. Furthermore, a regularized capacity characterization is established for robust cribbing, i.e. when the cribbing system contains all the information of the channel input. Building on the analogy between the noisy cribbing model and the relay channel, a partial decode-forward region is derived for a quantum MAC with non-robust cribbing. For the classical-quantum MAC with cribbing encoders, the capacity region is determined with perfect cribbing of the classical input, and a cutset region is derived for noisy cribbing. In the special case of a classical-quantum MAC with a deterministic cribbing channel, the inner and outer bounds coincide.

show abstract

Section: Introductionmentioning

confidence: 99%

The Quantum Multiple-Access Channel with Cribbing Encoders

Pereg,

Deppe,

Boche

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The quantum Gel'fand-Pinsker wiretap channel is considered in [113] and other related scenarios can be found in [118][119][120]. The quantum broadcast and multiple access channels with confidential messages were recently considered in [121,122] and [123,124], respectively.…”

Section: Introductionmentioning

confidence: 99%

Quantum Channel State Masking

Pereg¹,

Deppe²,

Boche³

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Communication over a quantum channel that depends on a quantum state is considered, when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. Full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance. For Hadamard channels without assistance, we derive single-letter inner and outer bounds, which coincide in the standard case of a channel that does not depend on a state.

show abstract

“…79-83. The quantum broadcast and multiple access channels with confidential messages were recently considered in 84,85 and 86,87 , respectively. An equivalent description of the super-activation phenomenon 21 is that there exists a broadcast channel such that the sum-rate capacity with full cooperation between the receivers is positive while the capacities of the marginal channels are both zero.…”

Section: Introductionmentioning

confidence: 99%

Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters

Pereg,

Deppe,

Boche

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiver 1 can send classical messages to Receiver 2. Another cooperation setting involves quantum conferencing, where Receiver 1 can teleport a quantum state to Receiver 2. When Receiver 1 is not required to recover information and its sole purpose is to help the transmission to Receiver 2, the model reduces to the quantum primitive relay channel.The quantum conferencing setting is intimately related to quantum repeaters, as the sender, Receiver 1, and Receiver 2 can be viewed as the transmitter, the repeater, and the destination receiver, respectively. We develop lower and upper bounds on the capacity region in each setting. In particular, the cutset upper bound and the decode-forward lower bound are derived for the primitive relay channel. Furthermore, we present an entanglementformation lower bound, where a virtual channel is simulated through the conference link.At last, we show that as opposed to the multiple access channel with entangled encoders, entanglement between decoders does not increase the classical communication rates for the broadcast dual.

show abstract

Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages

Cited by 11 publications

References 31 publications

The Quantum Multiple-Access Channel with Cribbing Encoders

The Quantum Multiple-Access Channel with Cribbing Encoders

Quantum Channel State Masking

Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters

Contact Info

Product

Resources

About