Playing games with multiple access channels

Leditzky, Felix; Alhejji, Mohammad A.; Levin, Joshua; Smith, Graeme

doi:10.1038/s41467-020-15240-w

Cited by 53 publications

(45 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MACs and their capacity regions have been studied in the early years of quantum information theory [7]- [9]. Recently, it has been shown that finding the capacity region even in that simplest scenario is NP-hard and that entanglement increases its classical capacity [10]. Here, we go beyond these results and consider the security aspects of MACs.…”

Section: Introductionmentioning

confidence: 97%

Secure communication over generalised quantum multiple access channels

Das¹,

Horodecki²,

Pisarczyk³

2021

Preprint

View full text Add to dashboard Cite

We investigate the security of generalized quantum multiple-access channels. We provide the formula for the achievable rate region of secure communication in the scenario of two senders and a single receiver. We explicitly specify a protocol for secure communication in this scenario, which employs superdense coding. The protocol is based on the distribution of a tripartite GHZ state. It allows for both symmetric and asymmetric key distribution whereby one of the senders can have twice the capacity of the other sender. We prove the security of the protocol against general quantum attacks, analyze different strategies of the eavesdropper and compute the key rate for a range of noisy quantum channels.

show abstract

Section: Introductionmentioning

confidence: 97%

Secure communication over generalised quantum multiple access channels

Das¹,

Horodecki²,

Pisarczyk³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Traditional studies of quantum-enhanced MACs have focused on the capacity rate region [27][28][29], which quantifies the optimal asymptotic communication rates between the senders and the receiver. From an information-theoretic sense, this is perhaps the most natural object to consider.…”

Section: Introductionmentioning

confidence: 99%

Building Multiple Access Channels with a Single Particle

Zhang

Chen

Chitambar

2022

Quantum

View full text Add to dashboard Cite

A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an N-port interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle.We provide a full characterization of the N-party classical MACs that can be built from a single particle, and we show that every non-classical particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1<K≤N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a "generalized fingerprinting inequality'' as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K=N−1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.

show abstract

“…Furthermore, Boche and Nötzel [17] addressed the cooperation setting of a classical-quantum MAC with conferencing encoders, where the encoders exchange messages between them in a constant rate (see also [18]). Remarkably, Leditzky et al [19] have shown that sharing entanglement between transmitters can strictly increase the achievable rates for a classical MAC. The channel construction in [19] is based on a pseudo-telepathy game [20] where quantum strategies guarantee a certain win and outperform classical strategies.…”

Section: Introductionmentioning

confidence: 99%

“…Remarkably, Leditzky et al [19] have shown that sharing entanglement between transmitters can strictly increase the achievable rates for a classical MAC. The channel construction in [19] is based on a pseudo-telepathy game [20] where quantum strategies guarantee a certain win and outperform classical strategies. The authors of the present paper [21] have recently shown that the dual property does not hold, i.e.…”

Section: Introductionmentioning

confidence: 99%

The Quantum Multiple-Access Channel with Cribbing Encoders

Pereg,

Deppe,

Boche

2021

Preprint

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

Playing games with multiple access channels

Cited by 53 publications

References 49 publications

Secure communication over generalised quantum multiple access channels

Secure communication over generalised quantum multiple access channels

Building Multiple Access Channels with a Single Particle

The Quantum Multiple-Access Channel with Cribbing Encoders

Contact Info

Product

Resources

About