Quantum networks with coherent routing of information through multiple
nodes
- URL: http://arxiv.org/abs/2208.00480v2
- Date: Tue, 26 Sep 2023 19:52:11 GMT
- Title: Quantum networks with coherent routing of information through multiple
nodes
- Authors: Hl\'er Kristj\'ansson, Yan Zhong, Anthony Munson, Giulio Chiribella
- Abstract summary: We show that a quantum routing approach can extend the distance over which information can be transmitted reliably.
Our findings highlight the potential of a future quantum internet.
- Score: 1.7819574476785418
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Large-scale communication networks, such as the internet, rely on routing
packets of data through multiple intermediate nodes to transmit information
from a sender to a receiver. In this paper, we develop a model of a quantum
communication network that routes information simultaneously along multiple
paths passing through intermediate stations. We demonstrate that a quantum
routing approach can in principle extend the distance over which information
can be transmitted reliably. Surprisingly, the benefit of quantum routing also
applies to the transmission of classical information: even if the transmitted
data is purely classical, delocalising it on multiple routes can enhance the
achievable transmission distance. Our findings highlight the potential of a
future quantum internet not only for achieving secure quantum communication and
distributed quantum computing but also for extending the range of classical
data transmission.
Related papers
- Scalable Structure For Chiral Quantum Routing [0.0]
We address the problem of routing quantum and classical information from one sender to many possible receivers in a network.
By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete graph.
arXiv Detail & Related papers (2025-02-18T10:55:26Z) - Guarantees on the structure of experimental quantum networks [105.13377158844727]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - 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) - Integrating Quantum Simulation for Quantum-Enhanced Classical Network
Emulation [54.08949958349055]
We describe a method of investigating the near-term potential of quantum communication technology for communication networks from the perspective of current networks.
We integrate an instance of the quantum network simulator QuNetSim at the link layer into the communication network emulator ComNetsEmu.
This novel augmented version of ComNetsEmu is thereby enabled to run arbitrary quantum protocols between any directly connected pair of network hosts.
arXiv Detail & Related papers (2021-10-04T13:31:55Z) - The Computational and Latency Advantage of Quantum Communication
Networks [70.01340727637825]
This article summarises the current status of classical communication networks.
It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
arXiv Detail & Related papers (2021-06-07T06:31:02Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
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.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - 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) - Experimental Quantum Communication Enhancement by Superposing
Trajectories [0.8651061687255295]
In quantum communication networks, wires represent well-defined trajectories along which quantum systems are transmitted.
Such a control has been shown to enable the transmission of information even when quantum communication protocols through well-defined trajectories fail.
arXiv Detail & Related papers (2020-07-09T18:01:29Z) - 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) - Beyond Shannon Limits: Quantum Communications through Quantum Paths [7.219077740523682]
We study the quantum capacity achievable via a quantum path and establish upper and the lower bounds for it.
Our findings reveal the substantial advantage achievable with a quantum path over any classical placements of communications channels in terms of ultimate achievable communication rates.
arXiv Detail & Related papers (2019-12-18T13:04:14Z)
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.