The University of Southampton
University of Southampton Institutional Repository

Decentralized base-graph routing for the quantum internet

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.

2469-9926
1-9
Gyongyosi, Laszlo
bbfffd90-dfa2-4a08-b5f9-98376b8d6803
Imre, Sandor
2def242c-1cb7-4b12-8a16-351a5a36e041
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), 1-9, [022310]. (doi:10.1103/PhysRevA.98.022310).

Record type: Article

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.

Full text not available from this repository.

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: 09 Nov 2018 17:30

Export record

Altmetrics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×