The University of Southampton
University of Southampton Institutional Repository

Dynamic topology resilience for quantum networks

Dynamic topology resilience for quantum networks
Dynamic topology resilience for quantum networks

In quantum repeater networks, the varying stability of entangled quantum links makes dynamic topology resilience 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 networks, quantum repeater, quantum Shannon theory
SPIE
Gyongyosi, L.
bbfffd90-dfa2-4a08-b5f9-98376b8d6803
Imre, S.
210dce74-aeca-453e-81d0-96d4e866cf0f
Gyongyosi, L.
bbfffd90-dfa2-4a08-b5f9-98376b8d6803
Imre, S.
210dce74-aeca-453e-81d0-96d4e866cf0f

Gyongyosi, L. and Imre, S. (2018) Dynamic topology resilience for quantum networks. In Advances in Photonics of Quantum Computing, Memory, and Communication XI. vol. 10547, SPIE.. (doi:10.1117/12.2288707).

Record type: Conference or Workshop Item (Paper)

Abstract

In quantum repeater networks, the varying stability of entangled quantum links makes dynamic topology resilience 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

Published date: 22 February 2018
Venue - Dates: Advances in Photonics of Quantum Computing, Memory, and Communication XI 2018, San Francisco, United States, 2018-01-29 - 2018-01-31
Keywords: quantum communication, quantum entanglement, quantum networks, quantum repeater, quantum Shannon theory

Identifiers

Local EPrints ID: 422600
URI: http://eprints.soton.ac.uk/id/eprint/422600
PURE UUID: 4cea1b62-32d8-4565-8d05-9edf2df19185

Catalogue record

Date deposited: 26 Jul 2018 16:30
Last modified: 26 Jul 2018 16:30

Export record

Altmetrics

Contributors

Author: L. Gyongyosi
Author: S. Imre

University divisions

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.

×