Abstract
The quantum Internet enables networking based on the fundamentals of quantum mechanics. Here, methods and procedures of resource prioritization and resource balancing are defined for the quantum Internet. We define a model for resource consumption optimization in quantum repeaters, and a strongly-entangled network structure for resource balancing. We study the resource-balancing efficiency of the strongly-entangled structure. We prove that a strongly-entangled quantum network is two times more efficient in a resource balancing problem than a full-mesh network of the traditional Internet.
Similar content being viewed by others
Introduction
The quantum Internet1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30 aims to provide an adequate answer to the computational power that becomes available with quantum computers31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60. To provide a seamless transition to the legal users from the traditional Internet to the quantum Internet, the creation of advanced services and methods for the quantum Internet are emerging tasks52,53,54,61,62,63,64,65,66,67. The quantum Internet is modeled as a quantum network consisting of quantum repeaters and entangled connections between the quantum repeaters2,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129. This entangled quantum network forms a general framework for the quantum Internet, enabling long-distance quantum communications, multi-hop entanglement and multi-hop QKD (quantum key distribution)25, utilization of quantum protocols, advanced distributed computing, high-precision sensor networks, and the establishment of a global-scale quantum Internet.
A crucial problem related to the quantum Internet is the resource optimization of the quantum repeaters and the handling of resource requirement issues such as non-servable resource requests in the quantum repeaters18,19,20,21,22,23,24,25,26. These fundamental questions are still open and have not been addressed for the quantum Internet.
Here, we define methods for resource prioritization and resource balancing for the quantum Internet. The aim of the proposed solutions is to optimize the resource allocation mechanisms and to reduce the resource consumption of the network entities of the quantum Internet. A model of resource consumption130,131,132,133,134 of quantum repeaters is proposed, and its optimization is realized through the weightings of the entanglement throughputs of the entangled connections of the quantum repeaters. We also propose a method for optimizing the entanglement swapping procedure and determine the conditions of deadlock-free entanglement swapping. For resource balancing, a strongly-entangled network structure is defined. This network is modeled as an independent entity in the quantum Internet, composed of an arbitrary number of quantum repeaters such that all quantum repeaters are entangled with each other. The primary aim of the strongly-entangled structure is to serve those quantum nodes that have non-servable resource requests due to resource issues or an arbitrary network issue; these quantum nodes are referred to as low-priority quantum nodes.
The strongly-entangled structure injects additional resources into the quantum network to manage the resource issues of an arbitrary number of low-priority quantum nodes. The structure also provides optimized resource balancing for the low-priority quantum nodes. We prove the resource-balancing efficiency of the strongly-entangled structure and study its fault tolerance. We show that a strongly-entangled quantum network structure, due to the advanced attributes of quantum networking, is two times more efficient in resource balancing than a classical full-mesh135,136 network structure.
The novel contributions of our manuscript are as follows:
-
1.
We define methods and procedures for resource prioritization and resource balancing in the quantum Internet.
-
2.
The resource prioritization covers the resource consumption optimization of the quantum repeaters via the entanglement throughput weightings, prioritization of entanglement swapping in the quantum repeaters, and deadlock-free entanglement swapping.
-
3.
A strongly-entangled structure is defined for an optimal resource balancing. We prove the resource-balancing efficiency of the proposed structure and prove its fault tolerance. We show that a strongly-entangled quantum network structure is two times more efficient in resource balancing than a classical full-mesh network structure.
This paper is organized as follows. In “Preliminaries” section, preliminaries are summarized. In “Method” section, methods for resource consumption optimization are defined. “Strongly-entangled structure for resource balancing in the quantum internet” section proposes a solution for optimal resource balancing. A performance analysis is given in “Performance evaluation” section. Finally, “Conclusions” section provides the conclusions. Supplementary information is included in the Appendix.
Preliminaries
Basic terms
Entanglement fidelity
The aim of the entanglement distribution procedure is to establish a d-dimensional entangled system between the distant points A and B, through the intermediate quantum repeater nodes. Let \(d=2\), and let \({\left| \beta _{00} \right\rangle } =\frac{1}{\sqrt{2} } \left( {\left| 00 \right\rangle } +{\left| 11 \right\rangle } \right) \) be the entangled state subject to be established between distant points A and B. At a particular two-partite state \(\sigma \) established between A and B, the fidelity of \(\sigma \) is evaluated as
Without loss of generality, an aim of a practical entanglement distribution is to reach \(F\ge 0.98\)2,3,4,12,68,69,137,138.
Entangled network structure
Let V refer to the nodes of an entangled quantum network N, which consists of a transmitter node \(A\in V\), a receiver node \(B\in V\), and quantum repeater nodes \(R_{i} \in V\), \(i=1,\ldots ,q\). Let \(E=\left\{ E_{j} \right\} \), \(j=1,\ldots ,m\) refer to a set of edges (an edge refers to an entangled connection in a graph representation) between the nodes of V, where each \(E_{j} \) identifies an \({\mathrm{L}}_{l} \)-level entanglement, \(l=1,\ldots ,r\), between quantum nodes \(x_{j} \) and \(y_{j} \) of edge \(E_{j} \), respectively. Let \(N=\left( V,{{\mathscr {S}}}\right) \) be an actual quantum network with \(\left| V\right| \) nodes and a set \({{\mathscr {S}}}\) of entangled connections. An \({\mathrm{L}}_{l} \)-level, \(l=1,\ldots ,r\), entangled connection \(E_{{\mathrm{L}}_{l} } \left( x,y\right) \), refers to the shared entanglement between a source node x and a target node y, with hop-distance
since the entanglement swapping (extension) procedure doubles the span of the entangled pair in each step. This architecture is also referred to as the doubling architecture2,68,69,138.
For a particular \({\mathrm{L}}_{l} \)-level entangled connection \(E_{{\mathrm{L}}_{l} } \left( x,y\right) \) with hop-distance (2), there are \(d\left( x,y\right) _{{\mathrm{L}}_{l} } -1\) intermediate nodes between the quantum nodes x and y.
Entanglement throughput
Let \(B_{F} (E_{{\mathrm{L}}_{l} }^{i})\) refer to the entanglement throughput of a given \({\mathrm{L}}_{l} \) entangled connection \(E_{{\mathrm{L}}_{l} }^{i} \) measured in the number of d-dimensional entangled states established over \(E_{{\mathrm{L}}_{l} }^{i} \) per sec at a particular fidelity F (dimension of a qubit system is \(d=2\))2,3,4,12,68,69,137,138.
For any entangled connection \(E_{{\mathrm{L}}_{l} }^{i} \), a condition c should be satisfied, as
where \({{B}}_{F}^{\text {*}}( E_{{{\text {L}}_{l}}}^{i})\) is a critical lower bound on the entanglement throughput at a particular fidelity F of a given \(E_{{{\text {L}}_{l}}}^{i}\), i.e., \({{B}_{F}}( E_{{{\text {L}}_{l}}}^{i})\) of a particular \(E_{{{\text {L}}_{l}}}^{i}\) has to be at least \({B}_{F}^{\text {*}}( E_{{{\text {L}}_{l}}}^{i})\).
Oscillator cycles
To quantify the entanglement throughput of the entangled connections, time is measured in number of cycles C. The time \(t_{C} \) of a cycle C is determined by an oscillator unit \(O_{C} \) that is available for all the entities of the quantum network, such that \({{t}_{C}}={1}/{{{f}_{C}}}\), where \(f_{C} \) is the frequency of \(O_{C} \), with \({{f}_{C}}={1}/{{{t}_{C}}}\).
Definitions
Resource consumption of a quantum repeater
Let \(\alpha \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) be the resource consumption of quantum repeater \(R_{i} \) associated with a k-th entangled connection \({\mathrm{L}}_{l} \left( k\right) \), \(k=1,\ldots ,z\), where l is the level of entanglement of the connection and z is the total number of entangled connections of \(R_{i} \).
Let \(\Upsilon \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) be the resource consumption of quantum repeater \(R_{i} \) associated with the quantum memory usage at \({\mathrm{L}}_{l} \left( k\right) \); let \(\phi \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) be the resource consumption of quantum repeater \(R_{i} \) associated with the entanglement purification of \({\mathrm{L}}_{l} \left( k\right) \); let \(\tau \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) be the resource consumption of quantum repeater \(R_{i} \) associated with the entanglement distribution to a target node B; and let \(\nu \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) be the resource consumption of quantum repeater \(R_{i} \) associated with the entanglement swapping \(U_{S} \) of \({\mathrm{L}}_{l} \left( k\right) \). Then, \(\alpha \left(R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) can be defined as
where the term \(\partial \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) is defined as
where \({B_{F} \left( {\mathrm{L}}_{l} \left( k\right) \right)} \) is the entanglement throughput (Bell states per C) of the entangled connection \({{\mathrm{L}}_{l} \left( k\right)} \), while \({\zeta \left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right)} \) identifies the resource consumption of quantum repeater \(R_{i} \) associated with the path selection, and \(C\left( R_{i} ,{\mathrm{L}}_{l} \left( k\right) \right) \) refers to the cost of auxiliary classical communications.
Set of outcoming entangled states
Let \(\rho _{A} \) be an input entangled density matrix (i.e., half pair of an entangled state) in quantum repeater \(R_{i} \), and let \({{\mathscr {A}}}\left( \rho _{A} \right) \) be the set of possible r outcoming entangled states in \(R_{i} \),
where \(\sigma _{B,i} \) is the i-th possible outcoming density matrix. The set \({{\mathscr {A}}}\left( \rho _{A} \right) \) is therefore identifies those (purified) entangled states, that can be selected for the \(U_{S} \) entanglement swapping with \(\rho _{A} \) to formulate an extended entangled connection via \(R_{i} \).
Extended entangled connection
Using (6), an extended entangled connection is depicted as
where \(\beta \left( \rho _{A} \right) \) identifies subsystem \(\rho _{A} \) of the entangled state \(\beta _{AB} \), \(\beta \left( \sigma_{B} \right) \) identifies subsystem \(\sigma _{B} \) of the entangled state \(\beta _{AB} \), \(R_{s} \left( \beta \left( \rho _{A} \right) \right) \) is the \(R_{s} \) source quantum node with \(\beta \left( \rho _{A} \right) \), while \(R_{d} \left( \beta \left( \sigma _{B} \right) \right) \) is the \(R_{d} \) destination quantum node with \(\beta \left( \sigma _{B} \right) \), where \(\beta \left( \sigma _{B} \right) \) is selected from set \({{\mathscr {A}}}\left( \rho _{A} \right) \) for the entanglement swapping to formulate \(\beta _{AB} \).
Set of destination quantum nodes
The set \({{\mathscr {A}}}\left( \rho _{A} \right) \) in (6) is determined for a particular incoming density \(\rho _{A} \) by the set \({{{\mathscr {D}}}}\left( R_{i} \right) \) of \(R_{d} \) destination quantum nodes that share an entangled connection with a current quantum repeater \(R_{i} \), as
where \(R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \) refers to the \(R_{d} \) destination quantum node with \(\beta \left( \sigma _{B,i} \right) \), \(i=1,\ldots ,r\).
Set of entangled connections via swapping
Let \({{\mathscr {S}}}_{{\mathscr {P}}} \left( R_{i} ,\rho _{A} \right) \) refer to the set of entangled connections that contains the entangled connection that is resulted between distant source \(R_{s} \) and destination \(R_{d} \) via an entanglement swapping in a particular quantum repeater \(R_{i} \) using input state \(\rho _{A} \) and output state \(\sigma _{B} \), as
where \({{\mathscr {S}}}_{{\mathscr {P}}} \left( R_{i} ,R_{d} \left( \sigma _{B} \right) \right) \) is the set of paths that pass through \(R_{i} \) using the entangled pair \(\beta \left( \sigma _{B} \right) \) in \(R_{d} \).
Strongly-entangled structure
For a \({{\mathscr {S}}}_{{\mathscr {N}}} \) strongly-entangled structure, the number of low-priority quantum nodes (quantum nodes with non-servable resource requests) in N is \(n_{c} \), while \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) is the number of quantum repeaters in a \({{\mathscr {S}}}_{{\mathscr {N}}} \) strongly-entangled structure, \(R_{1}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,\ldots ,R_{\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| }^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } .\) Since \({{\mathscr {S}}}_{{\mathscr {N}}} \) is strongly-entangled, each quantum repeater in \({{\mathscr {S}}}_{{\mathscr {N}}} \) has \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -1\) entangled connections, and the \(\left| E\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \right| \) number of entangled connections within \({{\mathscr {S}}}_{{\mathscr {N}}} \) is
The entanglement levels of the \(\left| E\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \right| \) entangled connections in \({{\mathscr {S}}}_{{\mathscr {N}}} \) are defined in the following manner. Let A be the ingress node of \({{\mathscr {S}}}_{{\mathscr {N}}} \), and let B be the egress node of \({{\mathscr {S}}}_{{\mathscr {N}}} \), with hop-distance \(d\left( A,B\right) \). Then, the \(L\left( d(x,y\right) )\) entangled connections in function of the \(d\left( x,y\right) )\) hop-distance between quantum nodes \(\left\{ x,y\right\} \in {{\mathscr {S}}}_{{\mathscr {N}}} \) in the \({{\mathscr {S}}}_{{\mathscr {N}}} \) strongly-entangled structure are distributed as follows:
at a particular number \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) of quantum nodes. (Note, the strongly-entangled structure utilizes different entanglement levels than the doubling architecture, therefore in (11) the entanglement levels are denoted in different manner.)
Capability of a strongly-entangled structure
Assuming that there is a set \({{\mathscr {S}}}_{n_{c} } \) of \(n_{c} \) low-priority \(R_{i} \) quantum repeaters in the network, \(i=1,\ldots ,n_{c} \), the \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) in \({{\mathscr {S}}}_{{\mathscr {N}}} \) is associated with entanglement throughput request (Bell states per C)
while for the internal entangled connections
where \(R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) is a neighbor of \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) in \({{\mathscr {S}}}_{{\mathscr {N}}} \), \(z\ne q\), \(q=1,\ldots ,\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \).
Since, by definition, \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) has \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -1\) entangled connections in \({{\mathscr {S}}}_{{\mathscr {N}}} \), it follows that the \(W\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) total entanglement throughput associated with \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) within the structure of \({{\mathscr {S}}}_{{\mathscr {N}}} \) (Bell states per C) is as
Since there are \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) quantum repeaters in \({{\mathscr {S}}}_{{\mathscr {N}}} \), the \(Z\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) cumulated entanglement throughput of the quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \) (Bell states per C) is as
Because of the \({{\mathscr {S}}}_{{\mathscr {N}}} \) strongly-entangled structure has \({\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \left( \left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -1\right) \big / 2} \) entangled connections, the \(T\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) total entanglement throughput of the entangled connections of \({{\mathscr {S}}}_{{\mathscr {N}}} \) (Bell states per C) is as
Related works
In this section the related works are given.
On the problem of resource allocation and routing in quantum networks, we suggest the works of62,70,71. In70, the authors study the problem of entanglement routing in practical quantum networks with limited quantum processing capabilities and with noisy optical links. The authors study how a practical quantum network can distribute high-rate entanglement simultaneously between multiple pairs of users. In71, the authors study new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. In62, the problem of entanglement generation is modeled through a stochastic framework that takes into consideration the key physical-layer mechanisms affecting the end-to-end entanglement rate. The author derives the closed-form expression of the end-to-end entanglement rate for an arbitrary path, and design a routing protocol for quantum networks.
In a quantum Internet scenario, the entanglement purification is a procedure that takes two imperfect systems \(\sigma _{1} \) and \(\sigma _{2} \) with initial fidelity \(F_0<1\), and outputs a higher-fidelity density \(\rho \) such that \(F\left( \rho \right) >F_0\). In139, the authors propose novel physical approaches to assess and optimize entanglement purification schemes. The proposed solutions provide an optimization framework of practical entanglement purification.
In140, a satellite-to-ground QKD system has been demonstrated. In141, the authors demonstrated the quantum teleportation of independent single-photon qubits. In142, the authors demonstrated the Bell inequality violation using electron spins. In143, the authors demonstrated modular entanglement of atomic qubits using photons and phonons. For an experimental realization of quantum repeaters based on atomic ensembles and linear optics, see144,145.
Since quantum channels also have a fundamental role in the quantum Internet, we suggest the review paper of137, for some specialized applications of quantum channels. For a review on some recent results of quantum computing technology, we suggest146. For some recent services developed for the quantum Internet, we suggest12,13,14,15,16,17,27,28,29.
Some other related topics are as follows. The works12,13,14,68,69,137,138 are related to the utilization of entanglement for long-distance quantum communications and for a global-scale quantum Internet, and also to the various aspects of quantum networks in a quantum Internet setting137,147,148,149,150,151,152,153,154,155.
A technical roadmap on the experimental development of the quantum Internet has been provided in20, see also156. For some important works on the experimental implementations, we suggest157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180.
Method
Resource consumption optimization via entanglement throughput prioritization
The aim of the entanglement throughput prioritization is to find an optimal distribution of the entanglement throughputs of the entangled connections of a given quantum repeater. The prioritization leads to an optimized, nearly uniform distribution of the resource consumptions of the quantum repeaters.
Theorem 1
(Resource consumption of a quantum repeater). The \({{{\mathscr {C}}}}\left( R_{i} \right) \) resource consumption of a quantum repeater \(R_{i} \) is adjustable by distributing the weight coefficients associated with the entanglement throughputs of the entangled connections of \(R_{i} \).
Proof
Let us assume that there are a source node A and a destination node B in the network.
Assuming that the total number of the (logical) incoming entangled connections \({\mathrm{L}}_{l} \left( k\right) \) of quantum repeater \(R_{i} \) is z, the total resource consumption \({{{\mathscr {C}}}}\left( R_{i} \right) \) of quantum repeater \(R_{i} \) is defined via the terms of “Resource consumption of a quantum repeater” section, as
Then, let \(\chi \left( R_{i} \right) \) be the total number of received entangled states (number of Bell states) in \(R_{i} \) per cycle:
which can be rewritten as a multiplication of the \(\left| B_{F} \left( A\right) \right| \) number of entangled states outputted by a source node A to path \({{\mathscr {P}}}_{s} \), and a \(\omega \left( {{\mathscr {P}}}_{s} \right) \in \left[ 0,1\right] \) weight of an s-th path \({{\mathscr {P}}}_{s} \), taken for all paths that pass through quantum repeater \(R_{i} \) between A and B, as
where A and B are the source and target nodes associated with path \({{\mathscr {P}}}_{s} \); \({{\mathscr {S}}}_{{\mathscr {P}}} \left( R_{i} \right) \) is the set of \({{\mathscr {P}}}\) paths that pass through quantum repeater \(R_{i} \) between A and B, defined as
with relation
where \({{\mathscr {P}}}_{s} \left( x,y\right) \) is a s-th path between quantum nodes x and y, \(s=1,\ldots ,\left| {{\mathscr {S}}}_{xy} \right| \), where \({{\mathscr {S}}}_{xy} \) is the set of paths between x and y and \(\left| {{\mathscr {S}}}_{xy} \right| \) is the cardinality of \({{\mathscr {S}}}_{xy} \); such that for a given source and target pair \(\left( A,B\right) \) of \({{\mathscr {P}}}_{s} \), \(s=1,\ldots ,\left| {{\mathscr {S}}}_{AB} \right| \),
Using (18), the term in (17) can be rewritten as
The result in (23) reveals that a loose upper bound on \(\mathscr {C}\left( {{R}_{i}}\right) \) can be obtained from (17) and (18), and also shows that \({{{\mathscr {C}}}}\left( R_{i} \right) \) is adjustable by the weight coefficients \(\omega \left( {{\mathscr {P}}}_{s} \right) \). An aim here is therefore to find the optimal distribution of the weight coefficients.
Assuming that the total number of quantum repeaters is q, the optimization problem can be defined via an objective function \(f\left( {{{\mathscr {C}}}}\right) \) subject to a minimization as
where
The problem is therefore to find the optimal distribution for the weights of the paths associated with the entangled connections that minimizes the objective function (24).
Using (22), a constraint \(\Omega \left( R_{i} \right) \) can be defined for all source and target node pairs \(\left( x,y\right) \) that share an entangled connection \({\mathrm{L}}_{l} \left( x,y\right) \) through \(R_{i} \), as
where
Then, let \(B_{F} \left( R_{i} ,R_{j} \right) \) be the entanglement throughput (Bell states per C) between quantum repeaters \(R_{i} \) and \(R_{j} \) connected by the entangled connection \({\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) \), with an upper bound \(B_{F}^{*} \left( R_{i} ,R_{j} \right) \).
Using (19), a constraint \(\Gamma \left( {\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) \right) \) can be defined for the \({{\mathscr {P}}}\) paths that traverse an entangled connection \({\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) \) between quantum repeaters \(R_{i} \) and \(R_{j} \) (see Fig. 2a), as
where \({{\mathscr {S}}}_{{\mathscr {P}}}^{{\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) } \left( R_{i} \right) \bigcap {{\mathscr {S}}}_{{\mathscr {P}}}^{{\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) } \left( R_{j} \right) \) refers to the set of paths that pass through the entangled connection \({\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) \) between quantum repeaters \(R_{i} \) and \(R_{j} \), respectively. As follows, in (28), a particular path
traverses the entangled connection \({\mathrm{L}}_{l} \left( R_{i} ,R_{j} \right) \), if only the relation
holds.
Then, let \({{\mathscr {S}}}_{{\mathscr {P}}} \left( N\right) =\left\{ {{\mathscr {P}}}_{1} ,\ldots ,{{\mathscr {P}}}_{n} \right\} \) be the set of entangled paths, where \({{\mathscr {P}}}_{i} \) is an i-th entangled path, with a weighted entanglement throughput \(\phi \left( {{\mathscr {P}}}_{i} \right) \) of the path \({{\mathscr {P}}}_{i} \) (Bell states per C), as
where A is the source node of entangled path \({{\mathscr {P}}}_{i} \), \(\omega \left( {{\mathscr {P}}}_{i} \left( A,B\right) \right) \) is the weight associated to \({{\mathscr {P}}}_{i} \left( A,B\right) \), while \(B_{F} \left( {{\mathscr {P}}}_{i} \left( A\right) \right) \) is the entanglement throughput (Bell states per C) of the source node A of \({{\mathscr {P}}}_{i} \).
The optimal \(D\left( \omega _{s} \left( x,y\right) \right) \) distribution of the weights that minimizes \(f\left( {{{\mathscr {C}}}}\right) \) is determined via Procedure 1.
Procedure 1 assumes a quantum Internet scenario, in which a particular quantum repeater \(R_{i} \) has several different (logical) incoming and (logical) outcoming entangled connections, and the number of paths that traverse a particular quantum repeater is distributed non-uniformly. \(\square \)
The schematic model of the resource consumption determination of a quantum repeater is depicted in Fig. 1.
Entanglement swapping prioritization
Because the distribution of the weights \(\omega \left( {{\mathscr {P}}}_{s} \left( A,B\right) \right) \) is determined via Procedure 1, the task in a given quantum repeater is then to determine the set of entangled states associated with the weighted entangled connections for the entanglement swapping procedure.
Lemma 1
(Entanglement swapping probability and the weights of entangled connections). The probability \(\Pr \left( U_{S} \left( \rho _{A} ,\sigma _{B,i} \right) \right) \) of entanglement swapping \(U_{S} \) between a source \(\rho _{A} \) and a target density matrix \(\sigma _{B,i} \) in a quantum repeater depends on the weights associated with the swapped entangled connections.
Proof
Let
be the probability that density \(\sigma _{B,i} \) is selected from \({{\mathscr {A}}}\left( \rho _{A} \right) \) to the entanglement swapping with \(\rho _{A} \) by swapping operator \(U_{S} \).
Since set \({{\mathscr {A}}}\left( \rho _{A} \right) \) contains r possible entangled states for the entanglement swapping,
where probability \(\Pr \left( \sigma _{B,i} ,R_{s} \left( \beta \left( \rho _{A} \right) \right) ,R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \right) \) is evaluated as
where
and \(B_{F} \left( {\mathrm{L}}_{l} \left( R_{s} \left( \beta \left( \rho _{A} \right) \right) ,R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \right) \right) \) is the entanglement throughput (Bell states per C) of the entangled connection \({\mathrm{L}}_{l} \left( R_{s} \left( \beta \left( \rho _{A} \right) \right) ,R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \right) \), while \(\omega _{s} \left( {\mathrm{L}}_{l} \left( R_{s} \left( \beta \left( \rho _{A} \right) \right) ,R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \right) \right) \) is the weight associated with an s-th path over \({\mathrm{L}}_{l} \left( R_{s} \left( \beta \left( \rho _{A} \right) \right) ,R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \right) \) (see also Fig. 2a).
Assuming that for each \(\sigma _{B,i} \) there exist a source set \({{{\mathscr {Q}}}}\left( \sigma _{B,i} \right) \) of g input entangled states,
the probability \(\Pr \left( \sigma _{B,i} ,{{{\mathscr {Q}}}}\left( \sigma _{B,i} \right) ,R_{d} \left( \beta \left( \sigma _{B,i} \right) \right) \right) \) can be yielded as
where
and
\(\square \)
Entanglement swapping deadlock
The entangled state selection procedure of the entanglement swapping in a quantum repeater \(R_{i} \) can lead to a deadlock in the establishment of an entangled connection \(L_{l} \left( R_{i} ,R_{d} \right) \) between \(R_{i} \), and a distant quantum repeater \(R_{d} \).
An entanglement swapping situation in a quantum Internet scenario is depicted in Fig. 2b, c, respectively.
The problem of deadlock-free entanglement swapping is discussed in Section A.1 of the Supplemental Information.
Strongly-entangled structure for resource balancing in the quantum internet
A quantum network structure called the strongly-entangled quantum network is defined. The aim of this network is optimal resource balancing within the quantum Internet to take care of problematic situations. The problematic situation considered here is the serving of an arbitrary number of low-priority quantum nodes. A low-priority quantum node cannot be served by an actual quantum node in the network due to resource issues or an arbitrary network issue. Instead, the set of low-priority nodes are served through the strongly-entangled quantum network, which comprises an arbitrary number of quantum repeaters such that all quantum repeaters are entangled with each other. The strongly-entangled structure represents a resource that can manage issues in the network. In the serving procedure of the low-priority nodes, the quantum repeaters are selected uniformly at random to handle the density matrix of a low-priority node. The randomized behavior leads to a random routing between the low-priority nodes and the quantum repeaters, as well as to optimal resource balancing within the network. It is also assumed that the strongly-entangled structure has connections with many subnetworks.
Resource allocation
In this section, the network situation is modeled via the definitions of “Strongly-entangled structure” section. A density matrix of \(R_{i} \) is associated with an \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) ingress quantum repeater of \({{\mathscr {S}}}_{{\mathscr {N}}} \) selected uniformly at random, thus a random routing is performed for the incoming query from the low-priority node \(R_{i} \) to \({{\mathscr {S}}}_{{\mathscr {N}}} \). Then, an arbitrary routing is preformed between the \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) egress quantum repeater of \({{\mathscr {S}}}_{{\mathscr {N}}} \) and the \(D\left( R_{i} \right) \) destination node of \(R_{i} \).
The quantum nodes and the entangled connections of the \({{\mathscr {S}}}_{{\mathscr {N}}} \) structure are characterized as follows. Let \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) be an q-th, \(q=1,\ldots ,\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \), quantum repeater in \({{\mathscr {S}}}_{{\mathscr {N}}} \), and let \(B\left( R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \) be the entanglement throughput request (Bell states per C) of the low-priority node \(R_{i} \). The structure of a \({{\mathscr {S}}}_{{\mathscr {N}}} \) strongly-entangled quantum network is depicted in Fig. 4.
Theorem 2
(Handling resource issues via a strongly-entangled structure). Let \(R_{i} \) be a low-priority quantum node with a non-servable resource request. The problem of resource allocation can be handled by a strongly-entangled quantum network structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) and a random routing \({{{\mathscr {R}}}}\) between the quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \) and \(R_{i} \).
Proof
The structure of \({{\mathscr {S}}}_{{\mathscr {N}}} \) allows to \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to split the \(B\left( R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \) entanglement throughput request to \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) smaller, \({B\left( R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \Bigg / \left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| } \) requests. As follows, within the structure of \({{\mathscr {S}}}_{{\mathscr {N}}} \), the entangled connection between quantum repeaters \(R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) and \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), is associated with the following entanglement throughput (Bell states per C):
As follows, using \({{\mathscr {S}}}_{{\mathscr {N}}} \), the entanglement throughputs of all of the \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -1\) entangled connections of \(R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) are associated with the \({1 \big / \left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| } \)-th of the incoming request of \(R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \). Therefore, the incoming of \(R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) request is divided into \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) fractions and distributed to the \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -1\) neighbors of \(R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) in the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \).
As the quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \) shared the entangled systems with each other, a random routing is utilized from all quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \) to the low-priority node \(R_{i} \). The request from \(R_{i} \) to the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) is served via
parallel entangled paths \({{\mathscr {P}}}\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \) between the quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \) and \(R_{i} \).
Therefore, the source of a \({{\mathscr {P}}}\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \) entangled path is the q-th quantum repeater \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) from \({{\mathscr {S}}}_{{\mathscr {N}}} \), \(q=1,\ldots ,\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \), while the target is \(R_{i} \). The \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) parallel entangled paths define the set \({{{\mathscr {R}}}}_{{{\mathscr {S}}}} \) of random quantum repeaters used in the routing procedure as
where \({{{\mathscr {R}}}}\left( R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \) identifies a set of random nodes used in the random routing \({{{\mathscr {R}}}}\) from \(R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to \(R_{i} \).
As the entangled paths are established, an \(U_{S} \left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) entanglement swapping operation is applied in all of the \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \). The aim of these operations is to swap the entangled connections to the egress quantum repeater \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) of \({{\mathscr {S}}}_{{\mathscr {N}}} \).
The result is \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) entangled connections between \(R_{i} \) and \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), i.e., the set of \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) entangled paths
such that the \(B_{F} \left( {{\mathscr {P}}}\left( R_{i} ,R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \right) \) entanglement throughput of entangled path \({{\mathscr {P}}}_{j} \left( R_{i} ,R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) is as
where \(B\left( R_{i} \right) \) is the total entanglement throughput request of \(R_{i} \) (Bell states per C), since the entangled path of \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) and \(R_{i} \) is swapped to the path between \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) and \(R_{i} \) via a swapping \(U_{S} \left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) in \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \).
Therefore the sum of the entanglement throughput of the \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) entangled paths (Bell states per C) is
thus it equals to the entanglement throughput request received from the low-priority node \(R_{i} \).
Assuming that there are \(n_{c} \) low-priority quantum nodes in N all with different entanglement throughput requests, the \({{\mathscr {S}}}_{{\mathscr {N}}} \) strongly-entangled structure has to serve all of these \(n_{c} \) low-priority quantum nodes simultaneously. In this case, the steps detailed above are established in parallel for all of the \(n_{c} \) low-priority nodes, thus the \(n_{\Sigma {{\mathscr {P}}}} \) total number of parallel entangled connections established via the \({{\mathscr {S}}}_{{\mathscr {N}}} \) structure is
As the \({\mathrm{L}}_{l} \left( R_{i} ,R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) entangled connection is built up via the entanglement swapping in \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), an arbitrary routing from \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to \(D\left( R_{i} \right) \) can be used to construct the entangled connection \({\mathrm{L}}_{l} \left( R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,D\left( R_{i} \right) \right) \). Then, an entanglement swapping in \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) yields the long-distance \({\mathrm{L}}_{l} \left( R_{i} ,D\left( R_{i} \right) \right) \) entangled connection.
\(\square \)
The construction method of a strongly-entangled structure is given Procedure 2.
Figure 3 depicts a quantum Internet scenario with the requirement of resource balancing in the quantum repeaters of the entanglement distribution process.
Resource balancing
Theorem 3
(Capability of the strongly-entangled structure). The strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) provides a structure to serve all the \(n_{c} \) low-priority quantum nodes simultaneously.
Proof
Using the metrics defined in “Capability of a strongly-entangled structure” section, first we derive some relevant attributes of \({{\mathscr {S}}}_{{\mathscr {N}}} \).
From (14), the \({{{\mathscr {F}}}}\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) fanout (ratio of the \(W\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) total entanglement throughput (14) within \({{\mathscr {S}}}_{{\mathscr {N}}} \) and the \(B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,{{\mathscr {S}}}_{n_{c} } \right) \) incoming request from the low-priority quantum repeaters, (12) of a quantum repeater \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) at \(n_{c} \) low-priority quantum repeaters is defined as
and the \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) fanout of \({{\mathscr {S}}}_{{\mathscr {N}}} \) as the maximum fanout among the quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \) as
such that
by theory135,136, where \(Z\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) is as given in (15), while \(B\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) is the total requests from the \(n_{c} \) quantum repeaters to \({{\mathscr {S}}}_{{\mathscr {N}}} \) (Bell states per C) as
Thus, (59) can be rewritten as
As a corollary, \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \le 1\) for any \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \ge 1\), while in a classical full-mesh structure \({{{\mathscr {M}}}}\), the fanout is lower bounded by 1, i.e. \({{{\mathscr {F}}}}\left( {{{\mathscr {M}}}}\right) \ge 1\). As follows, the \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \le 1\) property is strictly resulted from the attributes of the quantum structure (such as entanglement swapping), and it cannot be achieved within any classical full-mesh structure-based uniform load-balancing135,136.
Note, that in (61) it is assumed that within the structure of \({{\mathscr {S}}}_{{\mathscr {N}}} \), all the \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) are associated with the same \(B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,{{\mathscr {S}}}_{n_{c} } \right) \) values (see (12)), and a corollary, the throughputs of the entangled connections within \({{\mathscr {S}}}_{{\mathscr {N}}} \) are set equally to \(Q\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) (see (13)), since each quantum repeater receive the same amount of incoming request. Let us to derive \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) for the case if the \(B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,{{\mathscr {S}}}_{n_{c} } \right) \) values of \({{\mathscr {S}}}_{{\mathscr {N}}} \) are not equally set, while the condition
holds for the \(B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,{{\mathscr {S}}}_{n_{c} } \right) \) values in ingress quantum repeaters.
In this case, (15) is as
thus \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) is yielded as
thus (64) picks up its minimum (61) if the incoming density matrices of \({{\mathscr {S}}}_{{\mathscr {N}}} \) are not uniformly distributed.
On the other hand, if
such that
while the internal entangled connections of \({{\mathscr {S}}}_{{\mathscr {N}}} \) are set with relation \(\sum _{q}Q\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) =\sum _{i=1}^{n_{c} }B\left( R_{i} \right) \), then
On the relation of the incoming request and the internal entanglement throughputs of the entangled connections some derivations are as follows.
Let \(B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,{{\mathscr {S}}}_{n_{c} } \right) \) be the entanglement throughput request from the \(n_{c} \) low-priority nodes to \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) (Bell states per C), and let \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) be the egress node of the requests with entangled connection \({\mathrm{L}}_{l} \left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \).
If the entanglement throughput \(Q\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) within \({{\mathscr {S}}}_{{\mathscr {N}}} \) is set as
then a request from \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) can be served, while if
the request \(B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,{{\mathscr {S}}}_{n_{c} } \right) \) is served through different \({\mathrm{L}}_{l} \left( R_{i}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{j}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) entangled connections in \({{\mathscr {S}}}_{{\mathscr {N}}} \), such that
and
Assuming that (68) holds for all quantum repeaters of \({{\mathscr {S}}}_{{\mathscr {N}}} \), then
while if \(q=E\), then the \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) node is also the egress node, thus the aim is to achieve an arbitrary routing from \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to the distant node associated with the incoming request that is not part of the structure \({{\mathscr {S}}}_{{\mathscr {N}}} \).
The proof is concluded here. \(\square \)
The schematic model of the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) is illustrated in Fig. 4.
Lemma 2
(Resource-balancing efficiency of the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) for \(n_{c} \) low-priority nodes).In terms of fanout minimization and total traffic minimization, the strongly-entangled quantum network structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) is two times more efficient than a classical full-mesh network structure \({{{\mathscr {M}}}}\).
Proof
First, we compare the fanout coefficients of the classical full-mesh structure \({{{\mathscr {M}}}}\) and the strongly-entangled quantum network \({{\mathscr {S}}}_{{\mathscr {N}}} \). Then, we compare the total amount of traffic within the structures of \({{{\mathscr {M}}}}\) and \({{\mathscr {S}}}_{{\mathscr {N}}} \).
For simplicity, let us assume that \(\left| {{{\mathscr {M}}}}\right| =\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) and that the nodes of the structures are associated with the same incoming traffic (measured in the number of packets for \({{{\mathscr {M}}}}\), and the number of density matrices for \({{\mathscr {S}}}_{{\mathscr {N}}} \)):
where \(T\left( \cdot \right) \) is the traffic of \({{{\mathscr {M}}}}\), \(B\left( \cdot \right) \) is the traffic of \({{\mathscr {S}}}_{{\mathscr {N}}} \), \(x_{i} \) is a source node, \(x_{q}^{\left( {{{\mathscr {M}}}}\right) } \) is the q-th node of \({{{\mathscr {M}}}}\), \(R_{i} \) is a source quantum repeater, and \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) is the q-th quantum repeater of \({{\mathscr {S}}}_{{\mathscr {N}}} \).
It can be verified135,136, that for structure \({{{\mathscr {M}}}}\), the fanout coefficient \({{{\mathscr {F}}}}\left( {{{\mathscr {M}}}}\right) \) is
where \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) is as in (58). The fanout of the entangled structure is half of the fanout of \({{{\mathscr {M}}}}\); thus, \(\mu \left( {{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) ,{{{\mathscr {F}}}}\left( {{{\mathscr {M}}}}\right) \right) \), the ratio of \({{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) to \({{{\mathscr {F}}}}\left( {{{\mathscr {M}}}}\right) \), trivially follows: \(\mu \left( {{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) ,{{{\mathscr {F}}}}\left( {{{\mathscr {M}}}}\right) \right) ={\textstyle \frac{{{{\mathscr {F}}}}\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) }{{{{\mathscr {F}}}}\left( {{{\mathscr {M}}}}\right) }} ={\textstyle \frac{1}{2}} \).
Therefore, in terms of fanout minimization, the strongly-entangled structure is two times more efficient than a classical full-mesh structure.
In terms of the total traffic required within the structures, the results are as follows.
It can be proven that in the classical full-mesh structure \({{{\mathscr {M}}}}\), two phases of communications are required to establish a communication between a low-priority node \(x_{i} \) and an egress node \(x_{E}^{\left( {{{\mathscr {M}}}}\right) } \) of \({{{\mathscr {M}}}}\). In the first phase, the ingress node \(x_{I}^{\left( {{{\mathscr {M}}}}\right) } \) of \({{{\mathscr {M}}}}\) transmits the incoming packet to a random intermediate node of \({{{\mathscr {M}}}}\). In the second phase, the packet is transmitted from \(x_{z}^{\left( {{{\mathscr {M}}}}\right) } \) to the exit node \(x_{E}^{\left( {{{\mathscr {M}}}}\right) } \) of \({{{\mathscr {M}}}}\). Accordingly, an incoming packet traverses \({{{\mathscr {M}}}}\) twice135,136.
On the other hand, in the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \), only the first phase is required for seamless routing. The second step can be replaced via the entanglement swapping operator; thus, the incoming densities can be entangled with the target node without a second phase transmission.
In \({{\mathscr {S}}}_{{\mathscr {N}}} \), all quantum repeaters share an entangled connection with the low-priority node; thus, in a quantum repeater \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) of \({{\mathscr {S}}}_{{\mathscr {N}}} \) only an entanglement swapping \(U_{S} \left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) is required to establish an entangled connection between the low-priority node \(R_{i} \) and the egress quantum repeater \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) of \({{\mathscr {S}}}_{{\mathscr {N}}} \). Therefore, as the entangled path is established from \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to \(D\left( R_{i} \right) \), a swapping \(U_{S} \left( R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) in \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) connects \(D\left( R_{i} \right) \) with the low-priority node \(R_{i} \). Accordingly, in the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \), it is enough to apply only one phase to serve \(R_{i} \) via \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), whereas \({{{\mathscr {M}}}}\) requires two phases.
The corollaries for the amount of traffic within the structures are as follows. In \({{{\mathscr {M}}}}\), each node uniformly load-balances its incoming traffic to the other nodes of the structure, regardless of the destination, and then all packets are delivered to the final destination via an egress node by an arbitrary routing135,136. The two phases within \({{{\mathscr {M}}}}\) require a total traffic
In \({{\mathscr {S}}}_{{\mathscr {N}}} \), since only the first phase is required, it reduces the total traffic to
thus from (75) and (76), the ratio of the total transmissions within \({{{\mathscr {M}}}}\) and \({{\mathscr {S}}}_{{\mathscr {N}}} \) is
Then, let us further assume that there are \(n_{c} \) low-priority nodes with a node set \({{\mathscr {S}}}_{n_{c} } \) and that each node \(x_{i}^{\left( {{{\mathscr {M}}}}\right) } \) of \({{{\mathscr {M}}}}\) is an ingress node receiving incoming traffic \(T\left( x_{I,i}^{\left( {{{\mathscr {M}}}}\right) } ,S_{i}^{n_{c} } \right) \) from \(S_{i}^{n_{c} } \), where \(S_{i}^{n_{c} } \) is the i-th subset of \({{\mathscr {S}}}_{n_{c} } \).
In this case, the total traffic in \({{{\mathscr {M}}}}\) is \(T\left( {{\mathscr {S}}}_{n_{c} } ,{{{\mathscr {M}}}}\right) =\sum _{i=1}^{\left| {{{\mathscr {M}}}}\right| }{\textstyle \frac{2\left( \left| {{{\mathscr {M}}}}\right| -1\right) T\left( x_{I,i}^{\left( {{{\mathscr {M}}}}\right) } ,S_{i}^{n_{c} } \right) }{\left| {{{\mathscr {M}}}}\right| }} \),
whereas for the structure \({{\mathscr {S}}}_{{\mathscr {N}}} \),
thus, the ratio of the total traffic in the structures is also \({1 \big / 2} \), since
Assuming that the incoming traffic is the same for all ingress nodes in the structures of \({{{\mathscr {M}}}}\) and \({{\mathscr {S}}}_{{\mathscr {N}}} \), the result in (5.2) simplifies as
while (78) can be rewritten as
thus the ratio of (79) also follows.
As a corollary, using the total entanglement throughput \(T\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \) (16) of the entangled connections of \({{\mathscr {S}}}_{{\mathscr {N}}} \) (Bell states per C) and the total traffic \(T\left( {{{\mathscr {M}}}}\right) \) of \({{{\mathscr {M}}}}\),
the ratio
follows.
Therefore, with respect to the amount of total traffic, the proposed strongly-entangled network structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) is two times more efficient than a classical full-mesh network structure \({{{\mathscr {M}}}}\).
The proof is concluded here. \(\square \)
Random routing
Theorem 4
(Random routing efficiency via the strongly-entangled structure). The structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) enables an efficient random routing for all the \(n_{c} \) low-priority quantum repeaters \(R_{i} \), \(i=1,\ldots ,n_{c} ,\) via the total number of entanglement swapping operations \(\left| U_{S} \left( {{\mathscr {S}}}_{{\mathscr {N}}} ,R_{i} \right) \right| \) in \({{\mathscr {S}}}_{{\mathscr {N}}} \) for the serving of \(R_{i} \), with \(\Pr \left( \left| U_{S} \left( {{\mathscr {S}}}_{{\mathscr {N}}} ,R_{i} \right) \right| \ge 2c\right) \le {\textstyle \frac{1}{2^{\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| } }} ,\) for any \(c\ge 1\).
Proof
Our aim here is to show that the probability that more than entanglement swapping operation is required in a particular uniform randomly selected \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) ingress quantum repeater of \({{\mathscr {S}}}_{{\mathscr {N}}} \) to construct the entangled path between the source \(R_{i} \) and egress quantum repeater \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) of \({{\mathscr {S}}}_{{\mathscr {N}}} \) is low.
Let \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) be the number of \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) quantum repeaters, \(q=1,\ldots ,\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) in the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \), and let \(\left| E\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \right| \) be the number of entangled connections within \({{\mathscr {S}}}_{{\mathscr {N}}} \), \(\left| E\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \right| ={\textstyle \frac{\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \cdot \left( \left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -1\right) }{2}} \).
Then, let \(R_{i} \) a source quantum node from the set \({{\mathscr {S}}}_{n_{c} } \) of the \(n_{c} \) low-priority quantum repeaters, \(\left| {{\mathscr {S}}}_{n_{c} } \right| =n_{c} \). Then, a given \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) ingress quantum repeater is selected for \(R_{i} \) with probability
to formulate the random entangled path \({{\mathscr {P}}}_{i} \) from \(R_{i} \) to \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \),
Then, let assume that a random path \({{\mathscr {P}}}_{i} \) requires the egress quantum repeater \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), that formulates entangled path between \(R_{i} \) and \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \)
Let \(f\left( \cdot \right) \) be an indicator function, defined as
where \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{x} \right) \in {{\mathscr {S}}}_{{\mathscr {N}}} \) and \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{x} \right) \in {{\mathscr {S}}}_{{\mathscr {N}}} \) are the ingress and egress quantum repeaters of path \({{\mathscr {P}}}_{x} \). Thus, the indicator function indicates an event if the \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{i} \right) \) ingress node of \({{\mathscr {P}}}_{i} \) coincidences with the \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{j} \right) \) ingress node of \({{\mathscr {P}}}_{j} \) and the \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{i} \right) \) egress node of \({{\mathscr {P}}}_{i} \) coincidences with the \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{j} \right) \) egress node of \({{\mathscr {P}}}_{j} \). Thus, a \(f\left( {{\mathscr {P}}}_{i} ,{{\mathscr {P}}}_{j} \right) =1\) situation therefore indicates a collision between the paths \({{\mathscr {P}}}_{i} \) and \({{\mathscr {P}}}_{j} \) (A collision situation is illustrated in Fig. 5.).
Since for \({{\mathscr {P}}}_{i} \) and \({{\mathscr {P}}}_{j} \), the \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) ingress quantum repeaters are selected independently and uniformly random within \({{\mathscr {S}}}_{n_{c} } \), it follows that for the entangled paths \(\left\{ {{\mathscr {P}}}_{i} ,{{\mathscr {P}}}_{j} ,{{\mathscr {P}}}_{k} \right\} \), the \(f\left( {{\mathscr {P}}}_{i} ,{{\mathscr {P}}}_{j} \right) \) and \(f\left( {{\mathscr {P}}}_{i} ,{{\mathscr {P}}}_{k} \right) \) indicator functions are independent random variables for \(i\ne j\ne k\ne i\).
As follows, indicator functions \(f\left( {{\mathscr {P}}}_{i} ,{{\mathscr {P}}}_{j} \right) \) and \(f\left( {{\mathscr {P}}}_{i} ,{{\mathscr {P}}}_{k} \right) \) can be rewritten as Bernoulli random variables
and
such that
where\(\left| {{\mathscr {P}}}_{{{\mathscr {S}}}_{{\mathscr {N}}} } \right| \) is the path length within \({{\mathscr {S}}}_{{\mathscr {N}}} \), such that
due to the structural attributes of \({{\mathscr {S}}}_{{\mathscr {N}}} \). (Thus, (91) holds because only one entangled connection within \({{\mathscr {S}}}_{{\mathscr {N}}} \) is required for the swapping from the ingress node to an egress node.).
As follows, (90) can be rewritten as
Taking (92) for all the \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) nodes, yields a tail distribution for the sum of \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) Bernoulli variables, as
where \(X_{\Sigma } \) is the sum of \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) Bernoulli random variables,
for any positive x, with a relation by Markov inequality
Then, since (95) is not sufficiently small if
for any constant c, (95) can be reformulated as
for any positive n.
Thus, from the Chernoff-bound181, the relation
follows.
Since \(X_{\Sigma } \) is the sum of \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| \) Bernoulli random variables, \({{\mathbb {E}}}\left[ e^{nX_{\Sigma } } \right] \) can be evaluated as
that can be rewritten as
since \(1+a\le e^{a} \), by theory.
Therefore, \(\Pr \left( X_{\Sigma } \ge x\right) \) can be rewritten as
thus at
the following relation is yielded
It can be verified, that if \(\xi \) is sufficiently large, then (103) can be rewritten as
thus the probability that for a given resource node \(R_{i} \) with path \({{\mathscr {P}}}_{i} \) more than one \(U_{S} \left( {{\mathscr {S}}}_{{\mathscr {N}}} ,R_{i} \right) \) entanglement swapping operation is required within \({{\mathscr {S}}}_{{\mathscr {N}}} \) to construct the entangled path between \(R_{i} \) and \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{i} \right) \), is yielded as
where \(c\ge 1\) is a positive integer, while \(\left| U_{S} \left( {{\mathscr {S}}}_{{\mathscr {N}}} ,R_{i} \right) \right| \) is the number of entanglement swapping operations within \({{\mathscr {S}}}_{{\mathscr {N}}} \) associated with \(R_{i} \).
The proof is therefore concluded here. \(\square \)
A path collision between entangled paths \({{\mathscr {P}}}_{i} \) and \({{\mathscr {P}}}_{j} \) in the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) is illustrated in Fig. 5. Both entangled paths are associated with the same ingress node \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{i} \right) =R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{j} \right) \) and egress node \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{i} \right) =R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \left( {{\mathscr {P}}}_{j} \right) \). Assuming that \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) and \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) share only one entangled connection within \({{\mathscr {S}}}_{{\mathscr {N}}} \), only the serving of one path from \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) to \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) is allowed. Path \({{\mathscr {P}}}_{i} \) is served via the entangled connection between \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) and \(R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), while the serving of \({{\mathscr {P}}}_{j} \) is decomposed as \(R_{I}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \rightarrow R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \rightarrow R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \), where \(R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \ne R_{E}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \).
Fault tolerance
Theorem 5
(Fault tolerance of the strongly-entangled structure). The strongly-entangled structure provides a seamless service at \(1\le k\le \left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -2\) arbitrary entangled connection failures by increasing the entanglement throughputs of the remaining \(\left| E\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \right| -k\) entangled connections of \({{\mathscr {S}}}_{{\mathscr {N}}} \).
Proof
Let \(Q\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) ={\textstyle \frac{1}{\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| }} B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \) be the entanglement throughputs (see (50)) of the entangled connections within \({{\mathscr {S}}}_{{\mathscr {N}}} \) at no failures.
At k entangled connection failures, let \(\Delta _{k} \) be the increment of the entanglement throughputs (Bell states per C) of the remaining \(\left| E\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) \right| -k\) entangled connections of \({{\mathscr {S}}}_{{\mathscr {N}}} \), and let
be the updated entanglement throughputs of the entangled connections of \({{\mathscr {S}}}_{{\mathscr {N}}} \) (Bell states per C).
Let us define entangled connection failure events \(\mathrm{E}_{1} \), \(\mathrm{E}_{2} \) and \(\mathrm{E}_{3} \) in the following manner:
Then, using the formalisms of136, after some calculations \(\Delta _{k} \) can be evaluated as
As follows, at an initial \(Q\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) ={\textstyle \frac{1}{\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| }} B\left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{i} \right) \), the updated \(Q_{k}^{*} \left( R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } ,R_{z}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \right) \) at the failure of k entangled connections in \({{\mathscr {S}}}_{{\mathscr {N}}} \) is on the order of
As h quantum repeater \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) fails within \({{\mathscr {S}}}_{{\mathscr {N}}} \), then the structure of \({{\mathscr {S}}}_{{\mathscr {N}}} \) becomes a strongly-entangled network formulated by \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -h\) quantum repeaters, therefore \(\Delta _{h} \) is yielded as
If both k entangled connections and h quantum repeater \(R_{q}^{\left( {{\mathscr {S}}}_{{\mathscr {N}}} \right) } \) fails in the structure, then the problem is analogous to k entangled connection failures within a strongly-entangled structure formulated by \(\left| {{\mathscr {S}}}_{{\mathscr {N}}} \right| -h\) quantum repeaters135,136. Therefore, \(\Delta _{k,h} \) can be evaluated via (108) and (110) in the following manner:
\(\square \)
Performance evaluation
Here, we analyze the performance of the strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) and compare it with a classical full-mesh structure \({{{\mathscr {M}}}}\). Using the results of “Method” and “Strongly-entangled structure for resource balancing in the quantum internet” sections, a numerical evidence is given to characterize the amount of transmitted traffic within the structures as a function of the number of nodes, to characterize the fanout coefficients of the structures as a function of the number of nodes, and to compare the traffic increments of the connections at connection failures. For the comparison between classical resource balancing and quantum resource balancing, the results of “Method” and “Strongly-entangled structure for resource balancing in the quantum internet” sections are compared with the results of135,136.
In Fig. 6a the amounts of traffic are compared within a strongly-entangled structure \({{\mathscr {S}}}_{{\mathscr {N}}} \) and a classical full-mesh structure \({{{\mathscr {M}}}}\). In Fig. 6b, the fanout coefficients of the structures are compared. In Fig. 6c compares the fault tolerant capabilities of the structures.
The strongly-entangled quantum network is two times more effective than a classical full-mesh structure: The required amount of traffic is half that of the classical structure135,136, the fanout coefficient of the strongly-entangled structure is half that of the classical structure, and the required entanglement throughput of the entangled connection is half that of the classical structure. As future work, our aim is to provide a detailed performance comparison with other related approaches on resource allocation and routing in quantum networks62,70,71.
Conclusions
Here, we defined methods and procedures for optimizing the resource allocation mechanisms of the quantum Internet. We proposed a model for resource consumption optimization of quantum repeaters, proposed a method for optimizing the entanglement swapping procedure, and studied the conditions of deadlock-free entanglement swapping. We defined a strongly-entangled network structure for optimal resource balancing in the quantum Internet. We proved the resource-balancing efficiency of the strongly-entangled structure and its fault tolerance.
Data availability
This work does not have any experimental data.
References
Gyongyosi, L. & Imre, S. Resource Prioritization and Resource Balancing for the Quantum Internet, FIO19 Proceedings. Washington DC. United States. https://doi.org/10.1364/FIO.2019.JTu4A.47 (2019).
Van Meter, R. Quantum Networking. ISBN 1118648927, 9781118648926, Wiley (2014).
Lloyd, S. et al. Infrastructure for the quantum internet. ACM SIGCOMM Compu. Commun. Rev. 34, 9–20 (2004).
Kimble, H. J. The quantum internet. Nature 453, 1023–1030 (2008).
Gyongyosi, L. Services for the Quantum Internet. D.Sc. Dissertation, Hungarian Academy of Sciences (MTA) (2020).
Gyongyosi, L. Dynamics of entangled networks of the quantum internet. Sci. Rep.https://doi.org/10.1038/s41598-020-68498-x (2020).
Gyongyosi, L. & Imre, S. Routing space exploration for scalable routing in the quantum internet. Sci. Rep.https://doi.org/10.1038/s41598-020-68354-y (2020).
Gyongyosi, L. & Imre, S. Entanglement concentration service for the quantum internet. Quantum Inf. Process.https://doi.org/10.1007/s11128-020-02716-3 (2020).
Gyongyosi, L. & Imre, S. Optimizing high-efficiency quantum memory with quantum machine learning for near-term quantum devices. Sci. Rep.https://doi.org/10.1038/s41598-019-56689-0 (2020).
Gyongyosi, L. & Imre, S. Theory of noise-scaled stability bounds and entanglement rate maximization in the quantum internet. Sci. Rep.https://doi.org/10.1038/s41598-020-58200-6 (2020).
Gyongyosi, L. & Imre, S. Entanglement accessibility measures for the quantum internet. Quantum Inf. Process.https://doi.org/10.1007/s11128-020-2605-y (2020).
Gyongyosi, L. & Imre, S. Decentralized base-graph routing for the quantum internet. Phys. Rev. A Am. Phys. Soc.https://doi.org/10.1103/PhysRevA.98.022310 (2018).
Gyongyosi, L. & Imre, S. Dynamic topology resilience for quantum networks. In Proceedings of SPIE 10547, Advances in Photonics of Quantum Computing, Memory, and Communication XI, 105470Z; https://doi.org/10.1117/12.2288707 (2018).
Gyongyosi, L. & Imre, S. Topology adaption for the quantum internet. Quantum Inf. Process.https://doi.org/10.1007/s11128-018-2064-x (2018).
Gyongyosi, L. & Imre, S. Entanglement access control for the quantum internet. Quantum Inf. Process.https://doi.org/10.1007/s11128-019-2226-5 (2019).
Gyongyosi, L. & Imre, S. Opportunistic entanglement distribution for the quantum internet. Sci. Rep. Nat.https://doi.org/10.1038/s41598-019-38495-w (2019).
Gyongyosi, L. & Imre, S. Adaptive routing for quantum memory failures in the quantum internet. Quantum Inf. Process.https://doi.org/10.1007/s11128-018-2153-x (2018).
Pirandola, S. & Braunstein, S. L. Unite to build a quantum internet. Nature 532, 169–171 (2016).
Pirandola, S. End-to-end capacities of a quantum communication network. Commun. Phys. 2, 51 (2019).
Wehner, S., Elkouss, D. & Hanson, R. Quantum internet: a vision for the road ahead. Science 362, 6412 (2018).
Pirandola, S., Laurenza, R., Ottaviani, C. & Banchi, L. Fundamental limits of repeaterless quantum communications. Nat. Commun. 8, 15043. https://doi.org/10.1038/ncomms15043 (2017).
Pirandola, S. et al. Theory of channel simulation and bounds for private communication. Quantum Sci. Technol. 3, 035009 (2018).
Pirandola, S. Bounds for multi-end communication over quantum networks. Quantum Sci. Technol. 4, 045006 (2019).
Pirandola, S. Capacities of repeater-assisted quantum communications. arXiv:1601.00966 (2016).
Pirandola, S. et al. Advances in quantum cryptography. Adv. Opt. Photon.https://doi.org/10.1364/AOP.361502 (2020).
Laurenza, R. & Pirandola, S. General bounds for sender-receiver capacities in multipoint quantum communications. Phys. Rev. A 96, 032318 (2017).
Gyongyosi, L. & Imre, S. Multilayer optimization for the quantum internet. Sci Rep. Nat.https://doi.org/10.1038/s41598-018-30957-x (2018).
Gyongyosi, L. & Imre, S. Entanglement availability differentiation service for the quantum internet. Sci. Rep. Nat.https://doi.org/10.1038/s41598-018-28801-3 (2018).
Gyongyosi, L. & Imre, S. Entanglement-gradient routing for quantum networks. Sci. Rep. Nat.https://doi.org/10.1038/s41598-017-14394-w (2017).
Gyongyosi, L., Bacsardi, L. & Imre, S. A survey on quantum key distribution. Infocom. J X I(2), 14–21 (2019).
Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Naturehttps://doi.org/10.1038/s41586-019-1666-5 (2019).
Aaronson, S. & Chen, L. Complexity-theoretic foundations of quantum supremacy experiments. Proceedings of the 32nd Computational Complexity Conference, CCC ’17, 22:1–22:67 (2017).
Harrow, A. W. & Montanaro, A. Quantum computational supremacy. Nature 549, 203–209 (2017).
Foxen, B. et al. Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms. Phys. Rev. Lett. 125, 120504 (2020).
Harrigan, M. et al. Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor. arXiv:2004.04197v1 (2020).
Rubin, N. et al. Hartree–Fock on a superconducting qubit quantum computer. Science 369(6507), 1084–1089 (2020).
Arute, F. et al. Observation of separated dynamics of charge and spin in the Fermi–Hubbard model. arXiv:2010.07965 (2020).
Farhi, E., Goldstone, J. & Gutmann, S. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 (2014).
Farhi, E., Goldstone, J., Gutmann, S. & Neven, H. Quantum Algorithms for Fixed Qubit Architectures. arXiv:1703.06199v1 (2017).
Alexeev, Y. et al. Quantum Computer Systems for Scientific Discovery. arXiv:1912.07577 (2019).
Loncar, M. et al. Development of Quantum InterConnects for Next-Generation Information Technologies. arXiv:1912.06642 (2019).
Ajagekar, A., Humble, T. & You, F. Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization Problems. Comput. Chem. Eng. 132, 106630 (2020).
Ajagekar, A. & You, F. Quantum computing for energy systems optimization: challenges and opportunities. Energy 179, 76–89 (2019).
IBM. A new way of thinking: The IBM quantum experience. URL: http://www.research.ibm.com/quantum. (2017).
Farhi, E., Gamarnik, D. & Gutmann, S. The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case.arXiv:2004.09002v1 (2020).
Farhi, E., Gamarnik, D. & Gutmann, S. The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples. arXiv:arXiv:2005.08747 (2020).
Lloyd, S. Quantum Approximate Optimization is Computationally Universal. arXiv:1812.11075 (2018).
Sax, I. et al. Approximate approximation on a quantum annealer. Proceedings of the 17th ACM International Conference on Computing Frontiers (CF 2020) (2020).
Brown, K. A. & Roser, T. Towards storage rings as quantum computers. Phys. Rev. Accel. Beams 23, 054701 (2020).
Gyongyosi, L. Quantum state optimization and computational pathway evaluation for gate-model quantum computers. Sci. Rep.https://doi.org/10.1038/s41598-020-61316-4 (2020).
Gyongyosi, L. & Imre, S. Dense quantum measurement theory. Sci. Rep.https://doi.org/10.1038/s41598-019-43250-2 (2019).
Gyongyosi, L. Objective function estimation for solving optimization problems in gate-model quantum computers. Sci. Rep.https://doi.org/10.1038/s41598-020-71007-9 (2020).
Gyongyosi, L. Decoherence dynamics estimation for superconducting gate-model quantum computers. Quantum Inf. Process.https://doi.org/10.1007/s11128-020-02863-7 (2020).
Gyongyosi, L. & Imre, S. Scalable distributed gate-model quantum computers. Sci. Rep.https://doi.org/10.1038/s41598-020-76728-5 (2020).
Gyongyosi, L. Unsupervised quantum gate control for gate-model quantum computers. Sci. Rep.https://doi.org/10.1038/s41598-020-67018-1 (2020).
Gyongyosi, L. Circuit depth reduction for gate-model quantum computers. Sci. Rep.https://doi.org/10.1038/s41598-020-67014-5 (2020).
Gyongyosi, L. & Imre, S. Quantum circuit design for objective function maximization in gate-model quantum computers. Quantum Inf. Process.https://doi.org/10.1007/s11128-019-2326-2 (2019).
Teplukhin, A., Kendrick, B. & Babikov, D. Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances. Phys. Chem. Chem. Phys. https://doi.org/10.1039/D0CP04272B (2020).
Gill, S. S. et al. Quantum computing: A taxonomy, systematic review and future directions. ACM Comput. Surv. submitted (2020).
Caleffi, M. End-to-End Entanglement Rate: Toward a Quantum Route Metric, (2017) IEEE Globecom, https://doi.org/10.1109/GLOCOMW.2017.8269080 (2018).
Caleffi, M. Optimal routing for quantum networks. IEEE Accesshttps://doi.org/10.1109/ACCESS.2017.2763325 (2017).
Caleffi, M. Cacciapuoti, A. S. & Bianchi, G. Quantum internet: from communication to distributed computing. In NANOCOM ’18: Proceedings of the 5th ACM International Conference on Nanoscale Computing and Communication (2018).
Castelvecchi, D. The quantum internet has arrived. Nature, News and Comment. https://www.nature.com/articles/d41586-018-01835-3 (2018).
Cacciapuoti, A. S. et al. Quantum internet: networking challenges in distributed quantum computing. IEEE Netw.https://doi.org/10.1109/MNET.001.1900092 (2018).
Cuomo, D., Caleffi, M. & Cacciapuoti, A. S. Towards a distributed quantum computing ecosystem. https://digital-library.theiet.org/content/journals/10.1049/iet-qtc.2020.0002, https://doi.org/10.1049/iet-qtc.2020.0002 (2020).
Gyongyosi, L. & Imre, S. Training optimization for gate-model quantum neural networks. Sci. Rep.https://doi.org/10.1038/s41598-019-48892-w (2019).
Van Meter, R., Ladd, T. D., Munro, W. J. & Nemoto, K. System design for a long-line quantum repeater. IEEE/ACM Trans. Netw. 17(3), 1002–1013 (2009).
Van Meter, R., Satoh, T., Ladd, T. D., Munro, W. J. & Nemoto, K. Path selection for quantum repeater networks. Netw. Sci. 3(1–4), 82–95 (2013).
Pant, M. et al. Routing entanglement in the quantum internet. npj Quantum Inf. 5, 25. https://doi.org/10.1038/s41534-019-0139-x (2019).
Chakraborty, K., Rozpedeky, F., Dahlbergz, A. & Wehner, S. Distributed routing in a quantum internet. arXiv:1907.11630v1 (2019).
Khatri, S., Matyas, C. T., Siddiqui, A. U. & Dowling, J. P. Practical figures of merit and thresholds for entanglement distribution in quantum networks. Phys. Rev. Res. 1, 023032 (2019).
Khatri, S. Policies for elementary link generation in quantum networks. arXiv:2007.03193 (2020).
Kozlowski, W. & Wehner, S. Towards large-scale quantum networks. In Proceedings of the Sixth Annual ACM International Conference on Nanoscale Computing and Communication, Dublin, Ireland, arXiv:1909.08396 (2019).
Pathumsoot, P. et al. Modeling of measurement-based quantum network coding on IBMQ devices. Phys. Rev. A 101, 052301 (2020).
Pal, S., Batra, P., Paterek, T. & Mahesh, T. S. Experimental localisation of quantum entanglement through monitored classical mediator. arXiv:1909.11030v1 (2019).
Miguel-Ramiro, J. & Dur, W. Delocalized information in quantum networks. New J. Phys.https://doi.org/10.1088/1367-2630/ab784d (2020).
Miguel-Ramiro, J., Pirker, A. & Dur, W. Genuine quantum networks: superposed tasks and addressing. arXiv:2005.00020v1 (2020).
Pirker, A. & Dur, W. A quantum network stack and protocols for reliable entanglement-based networks. New J. Phys. 21, 033003. https://doi.org/10.1088/1367-2630/ab05f7 (2019).
Shannon, K., Towe, E. & Tonguz, O. On the Use of Quantum Entanglement in Secure Communications: A Survey. arXiv:2003.07907 (2020).
Amoretti, M. & Carretta, S. Entanglement verification in quantum networks with tampered nodes. IEEE J. Sel. Areas Commun.https://doi.org/10.1109/JSAC.2020.2967955 (2020).
Cao, Y. et al. Multi-tenant provisioning for quantum key distribution networks with heuristics and reinforcement learning: a comparative study. IEEE Trans. Netw. Serv. Manag.https://doi.org/10.1109/TNSM.2020.2964003 (2020).
Cao, Y. et al. Key as a service (KaaS) over quantum key distribution (QKD)-integrated optical networks. IEEE Commun. Mag.https://doi.org/10.1109/MCOM.2019.1701375 (2019).
Liu, Y. Preliminary Study of Connectivity for Quantum Key Distribution Network. arXiv:2004.11374v1 (2020).
Sun, F. Performance analysis of quantum channels. Quantum Eng.https://doi.org/10.1002/que2.35 (2020).
Chai, G. et al. Blind channel estimation for continuous-variable quantum key distribution. Quantum Eng.https://doi.org/10.1002/que2.37 (2020).
Ahmadzadegan, A. Learning to Utilize Correlated Auxiliary Classical or Quantum Noise. arXiv:2006.04863v1 (2020).
Bausch, J. Recurrent Quantum Neural Networks. arXiv:2006.14619v1 (2020).
Xin, T. Improved Quantum State Tomography for Superconducting Quantum Computing Systems, arXiv:2006.15872v1 (2020).
Dong, K. et al. Distributed subkey-relay-tree-based secure multicast scheme in quantum data center networks. Opt. Eng. 59(6), 065102. https://doi.org/10.1117/1.OE.59.6.065102 (2020).
Amer, O., Krawec, W. O. & Wang, B. Efficient Routing for Quantum Key Distribution Networks. arXiv:2005.12404 (2020).
Krisnanda, T. et al. Probing quantum features of photosynthetic organisms. npj Quantum Inf. 4, 60 (2018).
Krisnanda, T. et al. Revealing nonclassicality of inaccessible objects. Phys. Rev. Lett. 119, 120402 (2017).
Krisnanda, T. et al. Observable quantum entanglement due to gravity. npj Quantum Inf. 6, 12 (2020).
Krisnanda, T. et al. Detecting nondecomposability of time evolution via extreme gain of correlations. Phys. Rev. A 98, 052321 (2018).
Krisnanda, T. Distribution of quantum entanglement: Principles and applications. Ph.D. Dissertation, Nanyang Technological University. arXiv:2003.08657 (2020).
Ghosh, S. et al. Universal quantum reservoir computing. arXiv:2003.09569 (2020).
Mewes, L. et al. Energy relaxation pathways between light-matter states revealed by coherent two-dimensional spectroscopy. Commun. Phys. 3, 157 (2020).
Kopszak, P., Mozrzymas, M. & Studzinski, M. Positive maps from irreducibly covariant operators. J. Phys. A Math. Theor. 53, 395306 (2020).
Guo, D. et al. Comprehensive high-speed reconciliation for continuous-variable quantum key distribution. Quantum Inf. Process. 19, 320 (2020).
Chen, L. & Hu, M. Locally maximally mixed states. Quantum Inf. Process. 19, 305 (2020).
Barbeau, M. et al. Capacity Requirements in Networks of Quantum Repeaters and Terminals. In Proceedings of IEEE International Conference on Quantum Computing and Engineering (QCE 2020) (2020).
Yin, J. et al. Entanglement-based secure quantum cryptography over 1,120 kilometres. Nature 582, 501 (2020).
Santra, S. & Malinovsky, V. S. Quantum networking with short-range entanglement assistance. arXiv:2008.05553 (2020).
Komarova, K. et al. Quantum device emulates dynamics of two coupled oscillators. J. Phys. Chem. Lett.https://doi.org/10.1021/acs.jpclett.0c01880 (2020).
Gattuso, H. et al. Massively parallel classical logic via coherent dynamics of an ensemble of quantum systems with dispersion in size. ChemRxivhttps://doi.org/10.26434/chemrxiv.12370538.v1 (2020).
Chessa, S. & Giovannetti, V. Multi-level amplitude damping channels: quantum capacity analysis. arXiv:2008.00477 (2020).
Pozzi, M. G. et al. Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers. arXiv:2007.15957 (2020).
Bartkiewicz, K. et al. Experimental kernel-based quantum machine learning in finite feature space. Sci. Rep. 10, 12356. https://doi.org/10.1038/s41598-020-68911-5 (2020).
Kozlowski, W., Dahlberg, A. & Wehner, S. Designing a Quantum Network Protocol. arXiv:2010.02575 (2020).
Khan, T. M. & Robles-Kelly, A. A derivative-free method for quantum perceptron training in multi-layered neural networks. ICONIP 2020 (2020).
Mehic, M. et al. Quantum key distribution: a networking perspective. ACM Comput. Surv.https://doi.org/10.1145/3402192 (2020).
Kao, J. & Chou, C. Entangling capacities and the geometry of quantum operations. Sci. Rep. 10, 15978. https://doi.org/10.1038/s41598-020-72881-z (2020).
Bae, J. et al. Quantum circuit optimization using quantum Karnaugh map. Sci. Rep. 10, 15651. https://doi.org/10.1038/s41598-020-72469-7 (2020).
Bugu, S., Ozaydin, F. & Kodera, T. Surpassing the Classical Limit in Magic Square Game with Distant Quantum Dots Coupled to Optical Cavities. arXiv:2011.01490 (2020).
Welland, I. & Ferry, D. K. Wavepacket phase-space quantum Monte Carlo method. J. Comput. Electron.https://doi.org/10.1007/s10825-020-01602-6 (2020).
Ferguson, M. S., Zilberberg, O. & Blatter, G. Open quantum systems beyond Fermi’s golden rule: Diagrammatic expansion of the steady-state time-convolutionless master equation. arXiv:2010.09838 (2020).
Villalba-Diez, J. & Zheng, X. Quantum strategic organizational design: alignment in industry 4.0 complex-networked cyber-physical lean management systems. Sensors 20, 5856. https://doi.org/10.3390/s20205856 (2020).
Li, S. et al. Implementing Unitary Operators with Decomposition into Diagonal Matrices of Transform Domains. arXiv:2011.03250 (2020).
Xin, T. Improved quantum state tomography for the systems with XX+YY couplings and Z readouts. Phys. Rev. A 102, 052410 (2020).
Pereg, U., Deppe, C. & Boche, H. Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters. arXiv:2011.09233 (2020).
Gao, Y. L. et al. A novel quantum blockchain scheme base on quantum entanglement and DPoS. Quantum Inf. Process. 19, 420. https://doi.org/10.1007/s11128-020-02915-y (2020).
Bacsardi, L. On the way to quantum-based satellite communication. IEEE Commun. Mag. 51(08), 50–55 (2013).
Noelleke, C. et al. Efficient teleportation between remote single-atom quantum memories. Phys. Rev. Lett. 110, 140403 (2013).
Kok, P. et al. Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 79, 135–174 (2007).
Muralidharan, S., Kim, J., Lutkenhaus, N., Lukin, M. D. & Jiang, L. Ultrafast and fault-tolerant quantum communication across long distances. Phys. Rev. Lett. 112, 250501 (2014).
Notzel, J. & DiAdamo, S. Entanglement-enhanced communication networks. In IEEE International Conference on Quantum Computing and Engineering (QCE). https://doi.org/10.1109/QCE49297.2020.00038 (2020).
Wereszczynski, K. et al. Cosine series quantum sampling method with applications in signal and image processing. arXiv:2011.12738v1 (2020).
Dai, W. Quantum Networks: State Transmission and Network Operation, PhD Dissertation, MIT (2020).
Qian, Z. & Tsui, C. Y. A Thermal Aware Routing Algorithm for Application-Specific Network-on-Chip. In: Palesi, M. and Daneshtalab, M. (Editors) Routing Algorithms in Networks-on-Chip, Springer, ISBN 978-1-4614-8273-4, ISBN 978-1-4614-8274-1 (eBook) (2014).
Palesi, M., Holsmark, R., Kumar, S. & Catania, V. Application specific routing algorithms for networks on chip. IEEE Trans. Parallel Distrib. Syst. 20(3), 316–330 (2009).
Duato, J. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parallel Distrib. Syst. 6(10), 1055–1067 (1995).
Tarjan, R. Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972).
Chen, K. C., Chao, C. H., Lin, S. Y. & Wu, A. Y. Traffic- and Thermal-Aware Routing Algorithms for 3D Network-on-Chip (3D NoC) Systems. In: Palesi, M. and Daneshtalab, M. (Editors) Routing Algorithms in Networks-on-Chip, Springer, ISBN 978-1-4614-8273-4, ISBN 978-1-4614-8274-1 (eBook) (2014).
Zhang-Shen, R. & McKeown, N. Designing a predictable internet backbone with valiant load-balancing. In Proceeding of Workshop of Quality of Service (IWQoS) 2005 (2005).
Zhang-Shen, R. & McKeown, B. Designing a predictable internet backbone network. In Third Workshop on Hot Topics in Networks (HotNets-III) (2004).
Gyongyosi, L., Imre, S. & Nguyen, H. V. A survey on quantum channel capacities. IEEE Commun. Surv. Tutor.https://doi.org/10.1109/COMST.2017.2786748 (2018).
Van Meter, R. & Devitt, S. J. Local and distributed quantum computation. IEEE Comput. 49(9), 31–42 (2016).
Rozpedek, F. et al. Optimizing practical entanglement distillation. Phys. Rev. A 97, 062333 (2018).
Liao, S.-K. et al. Satellite-to-ground quantum key distribution. Nature 549, 43–47 (2017).
Ren, J.-G. et al. Ground-to-satellite quantum teleportation. Nature 549, 70–73 (2017).
Hensen, B. et al. Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres. Nature 526 (2015).
Hucul, D. et al. Modular entanglement of atomic qubits using photons and phonons. Nat. Phys. 11(1) (2015).
Sangouard, N. et al. Quantum repeaters based on atomic ensembles and linear optics. Rev. Mod. Phys. 83, 33 (2011).
Humphreys, P. et al. Deterministic delivery of remote entanglement on a quantum network. Nature 558 (2018).
Gyongyosi, L. & Imre, S. A survey on quantum computing technology. Comput. Sci. Rev.https://doi.org/10.1016/j.cosrev.2018.11.002 (2018).
Biamonte, J. et al. Quantum machine learning. Nature 549, 195–202 (2017).
Lloyd, S., Mohseni, M. & Rebentrost, P. Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411 (2013).
Lloyd, S. & Weedbrook, C. Quantum generative adversarial learning. Phys. Rev. Lett. 121. arXiv:1804.09139 (2018).
Sheng, Y. B. & Zhou, L. Distributed secure quantum machine learning. Sci. Bull. 62, 1019–1025 (2017).
Imre, S. & Gyongyosi, L. Advanced Quantum Communications—An Engineering Approach (Wiley-IEEE Press, New York, 2013).
Petz, D. Quantum Information Theory and Quantum Statistics Vol. 6 (Springer, Heidelberg, 2008).
Lloyd, S. Capacity of the noisy quantum channel. Phys. Rev. A 55, 1613–1622 (1997).
Gisin, N. & Thew, R. Quantum communication. Nat. Photon. 1, 165–171 (2007).
Leung, D., Oppenheim, J. & Winter, A. IEEE Trans. Inf. Theory 56, 3478–90 (2010).
Quantum Internet Research Group (QIRG), web: https://datatracker.ietf.org/rg/qirg/about/(2018).
Chou, C. et al. Functional quantum nodes for entanglement distribution over scalable quantum networks. Science 316(5829), 1316–1320 (2007).
Yuan, Z. et al. Nature 454, 1098–1101 (2008).
Schoute, E., Mancinska, L., Islam, T., Kerenidis, I. & Wehner, S. Shortcuts to quantum network routing. arXiv:1610.05238 (2016).
Zhang, W. et al. Quantum secure direct communication with quantum memory. Phys. Rev. Lett. 118, 220501 (2017).
Enk, S. J., Cirac, J. I. & Zoller, P. Photonic channels for quantum communication. Science 279, 205–208 (1998).
Briegel, H. J., Dur, W., Cirac, J. I. & Zoller, P. Quantum repeaters: the role of imperfect local operations in quantum communication. Phys. Rev. Lett. 81, 5932–5935 (1998).
Dur, W., Briegel, H. J., Cirac, J. I. & Zoller, P. Quantum repeaters based on entanglement purification. Phys. Rev. A 59, 169–181 (1999).
Duan, L. M., Lukin, M. D., Cirac, J. I. & Zoller, P. Long-distance quantum communication with atomic ensembles and linear optics. Nature 414, 413–418 (2001).
Van Loock, P. et al. Hybrid quantum repeater using bright coherent light. Phys. Rev. Lett. 96, 240501 (2006).
Zhao, B., Chen, Z. B., Chen, Y. A., Schmiedmayer, J. & Pan, J. W. Robust creation of entanglement between remote memory qubits. Phys. Rev. Lett. 98, 240502 (2007).
Goebel, A. M. et al. Multistage entanglement swapping. Phys. Rev. Lett. 101, 080403 (2008).
Simon, C. et al. Quantum repeaters with photon pair sources and multimode memories. Phys. Rev. Lett. 98, 190503 (2007).
Tittel, W. et al. Photon-echo quantum memory in solid state systems. Laser Photon. Rev. 4, 244–267 (2009).
Sangouard, N., Dubessy, R. & Simon, C. Quantum repeaters based on single trapped ions. Phys. Rev. A 79, 042340 (2009).
Dur, W. & Briegel, H. J. Entanglement purification and quantum error correction. Rep. Prog. Phys 70, 1381–1424 (2007).
Lloyd, S., Mohseni, M. & Rebentrost, P. Quantum principal component analysis. Nat. Phys. 10, 631 (2014).
Lloyd, S. The Universe as Quantum Computer, A Computable Universe: Understanding and exploring Nature as computation, Zenil, H. ed., World Scientific, Singapore. arXiv:1312.4455v1 (2013).
Shor, P. W. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52, R2493–R2496 (1995).
Kobayashi, H., Le Gall, F., Nishimura, H. & Rotteler, M. General scheme for perfect quantum network coding with free classical communication, Lecture Notes in Computer Science (Automata, Languages and Programming SE-52 vol. 5555, Springer) 622–633 (2009).
Hayashi, M. Prior entanglement between senders enables perfect quantum network coding with modification. Phys. Rev. A 76, 040301(R) (2007).
Hayashi, M., Iwama, K., Nishimura, H., Raymond, R. & Yamashita, S, Quantum network coding, Lecture Notes in Computer Science (STACS 2007 SE52 vol. 4393) ed Thomas, W. and Weil, P. (Berlin Heidelberg: Springer) (2007).
Kobayashi, H., Le Gall, F., Nishimura, H. & Rotteler, M. Perfect quantum network communication protocol based on classical network coding, Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT) 2686-90. (2010).
Chen, L. & Hayashi, M. Multicopy and stochastic transformation of multipartite pure states. Phys. Rev. A 83(2), 022331 (2011).
Xiao, Y. F. & Gong, Q. Optical microcavity: from fundamental physics to functional photonics devices. Sci. Bull. 61, 185–186 (2016).
Mitzenmacher, N. & Upfal, E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, Cambridge, 2005).
Acknowledgements
Open access funding provided by Budapest University of Technology and Economics (BME). The research reported in this paper has been supported by the Hungarian Academy of Sciences (MTA Premium Postdoctoral Research Program 2019), by the National Research, Development and Innovation Fund (TUDFO/51757/2019-ITM, Thematic Excellence Program), by the National Research Development and Innovation Office of Hungary (Project No. 2017-1.2.1-NKP-2017-00001), by the Hungarian Scientific Research Fund - OTKA K-112125, in part by the BME Artificial Intelligence FIKP grant of EMMI (Budapest University of Technology, BME FIKP-MI/SC), and by the Ministry of Innovation and Technology and the National Research, Development and Innovation Office within the Quantum Information National Laboratory of Hungary.
Author information
Authors and Affiliations
Contributions
L.G.Y. designed the protocol and wrote the manuscript. L.G.Y. and S.I. and analyzed the results.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Gyongyosi, L., Imre, S. Resource prioritization and balancing for the quantum internet. Sci Rep 10, 22390 (2020). https://doi.org/10.1038/s41598-020-78960-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-020-78960-5
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.