Decentralized base-graph routing for the quantum internet
Decentralized base-graph routing for the quantum internet
Quantum repeater networks are a fundamental of any future quantum internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multilevel network structure. The level of entanglement between the quantum nodes determines the hop distance and the probability of the existence of an entangled link in the network. Here, we define a decentralized routing for entangled quantum networks. The proposed method allows an efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes. We give bounds on the maximum value of the total number of entangled links of a path. The proposed scheme can be directly applied in practical quantum communications and quantum networking scenarios.
1-9
Gyongyosi, Laszlo
bbfffd90-dfa2-4a08-b5f9-98376b8d6803
Imre, Sandor
2def242c-1cb7-4b12-8a16-351a5a36e041
August 2018
Gyongyosi, Laszlo
bbfffd90-dfa2-4a08-b5f9-98376b8d6803
Imre, Sandor
2def242c-1cb7-4b12-8a16-351a5a36e041
Gyongyosi, Laszlo and Imre, Sandor
(2018)
Decentralized base-graph routing for the quantum internet.
Physical Review A, 98 (2), , [022310].
(doi:10.1103/PhysRevA.98.022310).
Abstract
Quantum repeater networks are a fundamental of any future quantum internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multilevel network structure. The level of entanglement between the quantum nodes determines the hop distance and the probability of the existence of an entangled link in the network. Here, we define a decentralized routing for entangled quantum networks. The proposed method allows an efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes. We give bounds on the maximum value of the total number of entangled links of a path. The proposed scheme can be directly applied in practical quantum communications and quantum networking scenarios.
This record has no associated files available for download.
More information
e-pub ahead of print date: 10 August 2018
Published date: August 2018
Identifiers
Local EPrints ID: 426051
URI: http://eprints.soton.ac.uk/id/eprint/426051
ISSN: 2469-9926
PURE UUID: ef50c5ad-92e6-4d0f-a610-eda21d46ae3c
Catalogue record
Date deposited: 09 Nov 2018 17:30
Last modified: 15 Mar 2024 21:25
Export record
Altmetrics
Contributors
Author:
Laszlo Gyongyosi
Author:
Sandor Imre
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics