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

• URL: http://arxiv.org/abs/2105.14505v1
• Date: Sun, 30 May 2021 11:19:47 GMT
• Title: Computation-aided classical-quantum multiple access to boost network communication speeds
• Authors: Masahito Hayashi and Angeles Vazquez-Castro
• Abstract summary: We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
• Score: 61.12008553173672
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Distributed Quantum Computing across an Optical Network Link [0.0]
  We experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. We deterministically teleport a controlled-Z gate between two circuit qubits in separate modules, achieving 86% fidelity. As photons can be interfaced with a variety of systems, this technique has applications extending beyond trapped-ion quantum computers.
  arXiv  Detail & Related papers  (2024-06-30T21:32:10Z)
• Multiplexed Processing of Quantum Information Across an Ultra-wide Optical Bandwidth [0.0]
  We show how to process quantum information in parallel over multiplexed frequency channels using parametric homodyne detection for measurement of all the channels simultaneously. We demonstrate the multiplexed CV-QKD protocol in a proof-of-principle experiment, where we successfully carry out QKD over 23 uncorrelated spectral channels.
  arXiv  Detail & Related papers  (2023-10-26T23:50:20Z)
• Overcoming Traditional No-Go Theorems: Quantum Advantage in Multiple Access Channels [0.0]
  We establish a novel advantage of quantum communication in a commonly encountered network configuration known as the Multiple Access Channel (MAC) Unlike the quantum superdense coding protocol, the advantage reported here is realized without invoking entanglement between the senders and the receiver. The presented quantum advantage hints at a profound connection with the concept of quantum nonlocality without inputs' and holds the potential for semi-device-independent certification of entangled measurements.
  arXiv  Detail & Related papers  (2023-09-29T14:15:35Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• A Continuous Variable Quantum Switch [0.0]
  We present a quantum repeating switch for CV quantum encodings that caters to multiple communication flows. The architecture of the switch is based on quantum light sources, detectors, memories, and switching fabric. We present numerical results on an achievable bipartite entanglement request rate region for multiple CV entanglement flows.
  arXiv  Detail & Related papers  (2022-09-17T15:23:20Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Aggregating Quantum Networks [0.0]
  Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows information to be transmitted in a fault tolerant way between different parts of the quantum network. It is a quantum phenomenon not available in conventional telecommunication networks either.
  arXiv  Detail & Related papers  (2020-08-10T01:53:10Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.