Computation-aided classical-quantum multiple access to boost network communication speeds

by   Masahito Hayashi, et al.

A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (cq-MAC), achievable rates are known assuming that all the messages are decoded, a common assumption in quantum network design. However, such a conventional design approach ignores the global network structure, i.e., the network topology. When a cq-MAC is given as a part of quantum network communication, this work shows that computation properties can be used to boost communication speeds with code design dependently on the network topology. We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. When the two-sender cq-MAC is a boson coherent channel with binary discrete modulation, we show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design. Further, such a rate can be achieved by different detection methods: quantum (with and without quantum memory), on-off photon counting and homodyne (each at different photon power). Finally, we describe two practical applications, one of which cryptographic.



There are no comments yet.


page 2


Playing Games with Multiple Access Channels

Communication networks have multiple users, each sending and receiving m...

The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel

Here we discuss message identification, a problem formalized by Rudolf A...

Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding

We derive universal classical-quantum superposition coding and universal...

Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

We consider the compound memoryless quantum multiple-access channel (QMA...

Private Classical Communication over Quantum Multiple-Access Channels

We study private classical communication over quantum multiple-access ch...

Secure communication over fully quantum Gel'fand-Pinsker wiretap channel

In this work we study the problem of secure communication over a fully q...

Multi-Party Quantum Purity Distillation with Bounded Classical Communication

We consider the task of distilling local purity from a noisy quantum sta...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.