Share Email Print

Proceedings Paper

Dynamic topology resilience for quantum networks
Author(s): L. Gyongyosi; S. Imre
Format Member Price Non-Member Price
PDF $17.00 $21.00

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.

Paper Details

Date Published: 22 February 2018
PDF: 7 pages
Proc. SPIE 10547, Advances in Photonics of Quantum Computing, Memory, and Communication XI, 105470Z (22 February 2018);
Show Author Affiliations
L. Gyongyosi, Univ. of Southampton (United Kingdom)
Budapest Univ. of Technology and Economics (Budapest Univ. of Technology and Economics)
Hungarian Academy of Sciences (Hungary)
S. Imre, Budapest Univ. of Technology and Economics (Hungary)

Published in SPIE Proceedings Vol. 10547:
Advances in Photonics of Quantum Computing, Memory, and Communication XI
Zameer Ul Hasan; Philip R. Hemmer; Alan E. Craig; Alan L. Migdall, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?