The University of Southampton
University of Southampton Institutional Repository

Opportunistic entanglement distribution for the quantum Internet

Opportunistic entanglement distribution for the quantum Internet
Opportunistic entanglement distribution for the quantum Internet

Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future quantum networking scenarios, the distribution mechanism of quantum entanglement is a critical and emerging issue in quantum networks. Here we define the method of opportunistic entanglement distribution for the quantum Internet. The opportunistic model defines distribution sets that are aimed to select those quantum nodes for which the cost function picks up a local minimum. The cost function utilizes the error patterns of the local quantum memories and the predictability of the evolution of the entanglement fidelities. Our method provides efficient entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs. The model provides an easily-applicable, moderate-complexity solution for high-fidelity entanglement distribution in experimental quantum Internet scenarios.

2045-2322
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 (2019) Opportunistic entanglement distribution for the quantum Internet. Scientific Reports, 9 (1), 1-9, [2219]. (doi:10.1038/s41598-019-38495-w).

Record type: Article

Abstract

Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future quantum networking scenarios, the distribution mechanism of quantum entanglement is a critical and emerging issue in quantum networks. Here we define the method of opportunistic entanglement distribution for the quantum Internet. The opportunistic model defines distribution sets that are aimed to select those quantum nodes for which the cost function picks up a local minimum. The cost function utilizes the error patterns of the local quantum memories and the predictability of the evolution of the entanglement fidelities. Our method provides efficient entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs. The model provides an easily-applicable, moderate-complexity solution for high-fidelity entanglement distribution in experimental quantum Internet scenarios.

Text
s41598-019-38495-w - Version of Record
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 31 December 2018
e-pub ahead of print date: 18 February 2019

Identifiers

Local EPrints ID: 428457
URI: http://eprints.soton.ac.uk/id/eprint/428457
ISSN: 2045-2322
PURE UUID: 2d5a08af-63ee-45f5-8eb9-8bdef73a0087

Catalogue record

Date deposited: 28 Feb 2019 17:30
Last modified: 16 Dec 2019 17:43

Export record

Altmetrics

Contributors

Author: Laszlo Gyongyosi
Author: Sandor 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.

×