Topology adaption for the quantum Internet

From MaRDI portal
Publication:1994749

DOI10.1007/S11128-018-2064-XzbMATH Open1402.81069arXiv1809.02928OpenAlexW3101290620WikidataQ129195927 ScholiaQ129195927MaRDI QIDQ1994749FDOQ1994749


Authors: Laszlo Gyongyosi, Sandor Imre Edit this on Wikidata


Publication date: 1 November 2018

Published in: Quantum Information Processing (Search for Journal in Brave)

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 work available at URL: https://arxiv.org/abs/1809.02928




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Topology adaption for the quantum Internet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994749)