Entanglement concentration service for the quantum Internet
- PDF / 800,137 Bytes
- 28 Pages / 439.37 x 666.142 pts Page_size
- 59 Downloads / 215 Views
Entanglement concentration service for the quantum Internet Laszlo Gyongyosi1,2,3 · Sandor Imre2 Received: 20 July 2019 / Accepted: 1 June 2020 © The Author(s) 2020
Abstract Here, we define the entanglement concentration service for the quantum Internet. The aim of the entanglement concentration service is to provide reliable, high-quality entanglement for a dedicated set of strongly connected quantum nodes in the quantum Internet. The objectives of the service are to simultaneously maximize the entanglement throughput of all entangled connections and to minimize the hop distance between the high-priority quantum nodes. We propose a method for the resolution of the entanglement concentration problem and provide a performance analysis. Keywords Quantum Internet · Quantum networking · Quantum entanglement · Quantum communications · Quantum Shannon theory
1 Introduction A fundamental aim of the quantum Internet [2–13] is to provide the standard network functions of the traditional Internet with an unconditional security for the users as quantum computers [14–29] become available. A basic concept of the quantum Internet is the entangled quantum network structure established via quantum entanglement [2,4,5,10,30–69]. The primary function of quantum Internet is to generate quantum entanglement [11,42,43,70–74] between a distant sender and receiver
Parts of this work were presented in conference proceedings [1].
B
Laszlo Gyongyosi [email protected]
1
School of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, UK
2
Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest 1117, Hungary
3
MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest 1051, Hungary 0123456789().: V,-vol
123
221
Page 2 of 28
L. Gyongyosi, S. Imre
quantum node through several intermediate repeater quantum nodes [3,75–89]. The process of entanglement sharing consists of several steps of entanglement transmission and entanglement swapping (extension) between the quantum nodes [6,7,9,90–100]. The entanglement throughput of an entangled connection quantifies the number of transmittable entangled states per sec at a particular fidelity over that quantum connection [11,43,44]. Entangled connections can be characterized by a cost function, which is practically the inverse of the entanglement throughput of a given connection [11,42,43]. Therefore, it is important to find the shortest entangled path (a set of entangled connections) in an entangled quantum network with respect to the particular cost function [8,80,81,101–106]. A given quantum node of an entangled network could store several entangled systems in the local quantum memory, which can then be utilized for the entanglement distribution [11–13,42–44,77–83]. In our current modeling environment, the entangled states of a given quantum node are referred to as entangled ports; therefore, the aim is to find the shortest path between the entangled ports of the entangled network. Th
Data Loading...
