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

Abstract

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.

References in corpus (24)

• The Quantum Internet
• Fundamental Limits of Repeaterless Quantum Communications
• General Benchmarks for Quantum Repeaters
• Cavity-based quantum networks with single atoms and optical photons
• A trusted-node-free eight-user metropolitan quantum communication network
• Quantum network communication -- the butterfly and beyond
• Quantum Network Coding
• Prior entanglement between senders enables perfect quantum network coding with modification
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• On entanglement-assisted classical capacity
• The Capacity of the Quantum Multiple Access Channel
• Fundamental rate-loss tradeoff for the quantum internet
• Perfect Quantum Network Communication Protocol Based on Classical Network Coding
• Practical route to entanglement-assisted communication over noisy bosonic channels
• Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations
• Dual universality of hash functions and its applications to quantum cryptography
• Secure Compute-and-Forward in a Bidirectional Relay
• Experimental Quantum Network Coding
• Analysis of Quantum Network Coding for Realistic Repeater Networks
• Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
• Secure Quantum Network Coding on Butterfly Network
• Secure Quantum Network Code without Classical Communication
• Infinite-fold enhancement in communications capacity using pre-shared entanglement
• Secure Computation-and-Forward with Linear Codes

Cited by in corpus (3)

• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems
• Secure physical layer network coding versus secure network coding
• The Quantum Multiple-Access Channel with Cribbing Encoders