The University of Southampton
University of Southampton Institutional Repository

Topology adaption for the quantum Internet

Topology adaption for the quantum Internet
Topology adaption for the quantum Internet

In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands of all users of the network. We study the problem of entanglement assignment in a quantum repeater network, prove its computational complexity, and show an optimization procedure. The results are particularly convenient for future quantum networking, quantum Internet, and experimental long-distance quantum communications.

Quantum communication, Quantum entanglement, Quantum Internet, Quantum repeaters, Quantum Shannon theory
1570-0755
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) Topology adaption for the quantum Internet. Quantum Information Processing, 17 (11), [295]. (doi:10.1007/s11128-018-2064-x).

Record type: Article

Abstract

In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands of all users of the network. We study the problem of entanglement assignment in a quantum repeater network, prove its computational complexity, and show an optimization procedure. The results are particularly convenient for future quantum networking, quantum Internet, and experimental long-distance quantum communications.

Full text not available from this repository.

More information

Accepted/In Press date: 10 September 2018
e-pub ahead of print date: 22 September 2018
Published date: 1 November 2018
Keywords: Quantum communication, Quantum entanglement, Quantum Internet, Quantum repeaters, Quantum Shannon theory

Identifiers

Local EPrints ID: 423756
URI: http://eprints.soton.ac.uk/id/eprint/423756
ISSN: 1570-0755
PURE UUID: 972471a2-6fc2-4509-b922-f10e22ee7276

Catalogue record

Date deposited: 01 Oct 2018 16:30
Last modified: 07 Oct 2020 00:35

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.

×