Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2020 Jul 31;10:12909. doi: 10.1038/s41598-020-68498-x

Dynamics of entangled networks of the quantum Internet

Laszlo Gyongyosi 1,2,3,
PMCID: PMC7395178  PMID: 32737328

Abstract

Entangled quantum networks are a fundamental of any global-scale quantum Internet. Here, a mathematical model is developed to quantify the dynamics of entangled network structures and entanglement flow in the quantum Internet. The analytical solutions of the model determine the equilibrium states of the entangled quantum networks and characterize the stability, fluctuation attributes, and dynamics of entanglement flow in entangled network structures. We demonstrate the results of the model through various entangled structures and quantify the dynamics.

Subject terms: Mathematics and computing, Computer science, Pure mathematics

Introduction

As quantum computers continue to evolve significantly118, there arises a fundamental need for a communication network that provides unconditionally secure communication and all the network functions of the traditional internet. This novel network structure is called the quantum Internet1943, a quantum communication network2023,25,27,3136,3842,4476 in which the nodes are represented by quantum devices (such as quantum repeaters28,29,43,49,58,7782 or quantum computers15, 8386), while the connections among the nodes are formulated via quantum entanglement. An entangled connection refers to a shared entangled quantum system among the quantum nodes19,20,87,88111. Therefore, quantum entanglement is the key to any global-scale quantum Internet. Due to the fundamentally different processes and procedures associated with communication in the quantum Internet, the dynamic nature of these networks is also fundamentally different from a traditional network7781,112124. The dynamics125127 involve the behavior of the network structure, which fluctuates along with the stability and reliability of the communication processes within the entangled structures. Quantifying the dynamics of the entangled structures allows us to determine the conditions for the development of stable quantum communications in strongly fluctuating and noisy environments, as well as to derive the basis for reliable and stable quantum communications in a global-scale quantum Internet21,23,25,28,4850 setting. The quantum Internet is not yet available for experimentation, however, it must be ready for use as quantum computers become publicly available. Therefore, derivation of the fundamental dynamical attributes and behavioral characteristics of the entangled structures of the quantum Internet is fundamentally important and represents an emerging issue. While in a classical Internet a TCP/IP dynamics serves as an analytical tool to model the transmission, in a quantum Internet setting a dynamics model that characterizes the transmission of quantum states (density matrices) over the quantum channels is not available. A fundamental difference between the two settings, that in a quantum Internet the communication between distant points is realized over quantum channels (i.e., via CPTP—completely positive trace preserving—maps in a mathematical formalism), while the transmitted systems are entangled density matrices (assuming a general quantum Internet scenario). The correlation measure functions are also different in a quantum Internet setting, due to the fundamental nature of a classical communication channel and a quantum channel128.

Here, we develop an analytical model to quantify the dynamics of entangled network structures and entanglement flow in the quantum Internet. The analytical solutions of the model determine the equilibrium states of entangled quantum networks and characterize their stability and fluctuation attributes and the dynamics of entanglement flow within entangled network structures. Our work provides fundamental definitions and terms and proves fundamental theorems that quantify the dynamics of the entangled quantum networks of the quantum Internet. The proposed results are independent of the actual physical implementations; therefore, they can be applied within the heterogeneous structures of a global-scale quantum Internet.

To quantify the dynamic attributes of entangled structures of the quantum Internet, the analytical model defines a ΨFN stability function motivated by the free energy thermodynamical potential function in thermondynamics129131 and statistical physics132135 (The free energy thermodynamical potential function Ψ is defined as Ψ=E-TS, where E is the energy, T is an absolute temperature, while S is the entropy. The free energy thermodynamical potential function can also be interpreted as Gibbs free energy if E is interpreted as enthalpy135 (chemical reactions at constant pressure.) The concept of stability function Ψ is therefore essentially roots in the Le Chatelier principle136,137 in a chemical equilibrium. The Le Chatelier principle says that chemical equilibrium occurs at minimum Gibbs energy of the reactants and the products and disturbance of the mix would result in restoration of the equilibrium in a way that cancels the perturbation.). In the developed model, the stability function determines the SN equilibrium state of the entangled structure. A SN stable equilibrium state of the entangled quantum network N is stable if heavy fluctuations in the network have zero effect on the entanglement flow FN in the entangled quantum network. If ΨFN is in a global minima, then the entangled structure is in a stable equilibrium state SN. The determination of the stable equilibrium states of an entangled structure is fundamental to any seamless communication in a global-scale quantum Internet. The seamless quantum communication refers to a stable (reliable) transmission without fluctuations (the fluctuation does not exceed a critical limit). In a stable network state, the Rx,yt0,t probability of non-erroneous information transmission between nodes and at moment is above a critical bound C, Rx,yt0,t>C, given that at moment t0 the communication is correct. The entanglement flow is considered seamless optimal if it is seamless and if the entanglement rate exceeds a critical lower bound set for the entangled connections. We quantify the stability function for various entangled structures. The reliability of quantum communication is analyzed via the stability function of the entangled quantum network, since the stability of the entangled structure implies the reliability of quantum communication within the network.

Depending on the entanglement transmission rate of the entangled connections, the global quantum network can be decomposed into weakly and strongly entangled subnetworks. In a weakly entangled structure, the entanglement rate of the entangled connections is below a critical limit, while in a strongly entangled structure, the entanglement rate of the entangled connections exceeds this limit. As we prove, these structures are characterized by fundamentally different dynamic attributes and stability properties.

Entanglement purification is a cornerstone of the entangled networks of the quantum Internet21,23,25,28,48,56,138140. Entanglement purification is a process that allows us to improve the entanglement fidelity of entangled states. It is a high-cost procedure since it requires the transmission of several quantum systems between the nodes to improve the final fidelity. Similar to the fundamental dynamic attributes of the quantum Internet, the dynamic effects of entanglement purification on an entangled structure remain unknown. We reveal the effects of entanglement purification on a large quantum network and show that the application of entanglement purification in a separated manner does not improve the capabilities of the quantum network.

The FN entanglement flow in the entangled structure is the process of entanglement transmission in a large-scaled quantum entangled network N. Using the analytical model, we prove the conditions of seamless and seamless optimal entanglement transmission. The fluctuation of the entangled connections is derived via the Laplacian of the entangled structure, which is an important tool in spectral graph theory141144.

The proposed analytical model also reveals the quantum supremacy (properties and attributes that are not available in a traditional internet) of the quantum Internet over the traditional internet. The proposed analytical solutions indicate that, for both weakly and strongly entangled structures, seamless optimal entanglement flow is always possible. Furthermore, the model revealed that an entangled structure can be transformed into a zero-fluctuation network via the establishment of a novel connection between the nodes, the result of which is proven via the use of spectral graph theory.

The novel contributions of our manuscript are as follows.

  1. Dynamics of the entangled network structures of the quantum Internet is quantified in a closed-form. The fundamental definitions and terms are provided, fundamental theorems proven for entangled quantum networks.

  2. We evaluate the stability of the entangled quantum networks of the quantum Internet and define the characteristics of weakly and strongly entangled structures.

  3. We prove the stable equilibrium states of weakly and strongly entangled structures and quantify them in an exact closed form. We study the effects of noise on the stable equilibrium states of entangled structures.

  4. We derive the fluctuation dynamics of entanglement transmission in the quantum Internet. Using the stable equilibrium states of entangled structures, we determine the conditions of seamless and seamless optimal entanglement flow in the quantum Internet.

  5. We quantify the maximally allowed fluctuations in entangled structures for the seamless and seamless optimal entanglement flow in the quantum Internet. We prove the conditions for the construction of an entangled network structure with zero fluctuations.

This paper is organized as follows. Second section gives the basic terms and definitions. Third section  evaluates the dynamics and equilibrium states of entangled networks. Fourth section focuses on the dynamics of entanglement flow. Finally, fifth section concludes the results. Supplementary Information is included in the Appendix.

Problem statement

The problems to be solved are as follows.

Problem 1

Evaluate and quantify the dynamics and stability of an entangled network structure in an exact closed form. Prove the equilibrium state and fluctuation dynamics of the entangled network structures of the quantum Internet. Determine the effects of noise on the equilibrium states of the entangled network.

Problem 2

Prove the attributes of weakly and strongly entangled structures of the quantum Internet. Determine the stable equilibrium states of the entangled network structures for both noiseless and noisy cases and for both weakly and strongly entangled structures.

Problem 3

Prove the dynamic effects of local entanglement purification in the quantum Internet.

Problem 4

Prove the maximally allowed fluctuations in entangled structures for seamless entanglement flow in the quantum Internet.

Problem 5

Determine the attributes of an entangled network structure that statistically leads to zero fluctuations.

The resolutions to Problems 15 are proposed in the Theorems and Lemmas of the manuscript.

Preliminaries

This section briefly summarizes the basic terms and definitions. For further details, we suggest28,128.

Entanglement fidelity

Let |β00=1200+11 be the target Bell state subject to be generated between distant nodes A and B145. The entanglement fidelity F at a given shared system σ between A and B is

Fσ=β00|σ|β00, 1

such that F=1 for a perfect Bell state and F<1 for an imperfect state28,145.

Entanglement levels

Let V refer to the nodes of an entangled quantum network N, which consists of a transmitter node AV, a receiver node BV, and quantum repeater nodes RiV, i=1,,q145. Let E=Ej, j=1,,m refer to a set of edges between the nodes of V, where each Ej identifies an Ll-level entanglement, l=1,,r, between quantum nodes xj and yj , respectively. In the doubling architecture28, the number of spanned nodes is doubled in each level of entanglement swapping. The dx,yLl hop distance for an l-level entangled connection Ll-level between nodes x,yV is51

dx,yLl=2l-1, 2

where l=1 refers to a direct connection between x and y with no intermediate quantum repeaters145.

Entanglement throughput, entanglement purification, entanglement swapping

Entanglement throughput

The BFElx,y entanglement throughput of an l-level entangled connection Elx,y is a quantity that measures the number of entangled density matrices transmittable over Elx,y per a unit time πS=stC, where s is a nonzero real number, s>0, of a particular entanglement fidelity F, where C is a cycle (see “Dynamics of the entangled structure” section). (Since Elx,y is formulated via a set of N physical links, it abstracts the capabilities of the physical links of Elx,y and the efficiency of entanglement swapping in the nodes). Practically, the entangled states are realized via Bell states in current implementations145 (The BF entanglement throughput is related to the term “bandwidth” from classical communication theory. A fundamental difference that a quantum channel N can transmit several different correlations, such as classical, private classical and quantum correlation128, and the quantum repeaters generate and outputs entangled density matrices (halves of an EPR states in practice) to establish an l-level entangled connection (see (2)). Quantum entanglement is a quantum correlation, therefore the term “bandwidth” is related to the QN quantum capacity128,146 of the quantum channel N. In a classical setting only classical correlations can be transmitted over a classical channel N, therefore the “bandwidth” in a traditional interpretation is related to the C(N) classical capacity of N.).

Entanglement purification

The PN entanglement purification process28,56,138140 takes two imperfect systems σ1 and σ2 with F0<1, and outputs a higher-fidelity system ρ such that

Fρ>F0. 3

For a detailed technical description of entanglement purification, we suggest28.

Entanglement swapping

The entanglement swapping operation splices two short-distance Bell states into a longer-distance Bell pair via operations applied in an intermediate quantum node and via classical side information (i.e., a similar mechanism to quantum teleportation28,145).

Definitions

The dynamics terms utilized in the model are defined as follows. The aim of the definitions is to introduce the related quantities, the detailed definitions are given in the particular sections.

Entanglement flow

Definition 1

(Entanglement flow) The FN entanglement flow is the entanglement transmission over the V quantum repeaters of the physical network N. For a given jth entangled path Pj of FN, j=1,,Q, where Q is the total number of paths in N, an ith quantum node Ri, i=1,,V, outputs n density matrices on path Pj. For the total Q paths of N, an ith quantum repeater Ri outputs Dn density matrices on the Q paths P1,,PQ.

Entanglement flow is the number of entangled density matrices (half of EPR pairs in a practical setting) generated and outputted by the quantum repeaters, see also “Average entanglement rate of an entanglement flow” section. In the entanglement distribution procedure, a given quantum repeater Ri has a particular number of incoming density matrices (halves of EPR states received from source neighbor quantum nodes in a practical scenario) and outcoming density matrices (the given quantum repeater Ri generates entangled states, and sends out one half of the EPR states to a destination node, see also “Entanglement throughput” section.) The terminology “outputs a state into a path” means that a particular output state of the quantum repeater belongs to a particular path. Other outputs belong to other paths, etc.

Stability of the entangled quantum network

Definition 2

(Stability function) The ΨFNR stability function (will be detailed in (20)) measures the effects of any network fluctuation and noise on the entangled structure and the entanglement flow. If ΨFN is in a local minima, then the entangled structure is in an SN equilibrium state. If ΨFN is in a global minima, then the entangled structure is in a stable equilibrium state SN.

Equilibrium state of an entangled quantum network

Definition 3

(Equilibrium state of the quantum network) The SN equilibrium state of the entangled quantum network N is a state of the entangled structure in which the network structure keeps the SN network state at φN=φ1,,φVT fluctuations of the quantum network, where φiR is a (normalized) fluctuation of a node Ri, defined as

φi=1BFFNBFRi-BFFN, 4

where BFi is the outcoming entanglement throughput of node Ri (number of density matrices – half of EPR pairs in a practical setting – outputted by Ri), while BFFN is a critical lower bound for the entanglement throughput of FN. The state of the quantum network is detailed in “State of the quantum network” section, see also (21).

Stable equilibrium state

Definition 4

(Stable equilibrium state of the quantum network) The SN equilibrium state of the entangled quantum network is stable if heavy fluctuations, φi>φ, where φR is a critical bound on network fluctuation φ set for the i=1,,V nodes of N, keeps the network state SN (Detailed definition of φ is given in (45).).

Average entanglement fidelity of an entanglement flow

For a jth path Pj, the function FPjRi identifies the average (Note: an averaging of quantities is used by the statistical model of the quantum network.) entanglement fidelity output via the quantum repeater Ri in the FN entanglement flow of N, as

FPjRi=1nf=1nFiσf, 5

where σf is an fth, f=1,,n, entangled subsystem outputted by Ri on path Pj. For the Q paths of N, the FPRi fidelity is derived for Ri as

FPRi=1Dif=1DiFiσf, 6

where Di is the number of density matrices outputted to the Q paths P1,,PQ by Ri. From (6), the FFN average fidelity of FN is as

FFN=1Vi=1VFPRi=1Vi=1V1Dif=1DiFiσf. 7

Average entanglement rate of an entanglement flow

For a jth path Pj of FN with VPj quantum nodes and SPj entangled connections, the BF,PjFN average entanglement rate of Pj at a particular entanglement fidelity F is

BF,PjFN=1SPjs=1SPjBF,PjEs, 8

where BF,PjEs identifies the average entanglement throughput of an sth entangled connection Es for a particular entanglement fidelity F, s=1,,SPj.

For the total Q paths of N, the BFN average entanglement throughput of FN for a particular entanglement fidelity F is as

BFFN=1Qj=1Q1SPjs=1SPjBF,PjEs. 9

Average noise of an entanglement flow

The 0ΔFN1 average (Note: an averaging of quantities is used by the statistical model of the quantum network.) noise probability (referred to as average noise) of FN is defined as

ΔFN=1Vi=1VΔRi=1Vi=1V1Dif=1DiΔiσf, 10

where 0ΔRi1 is the average noise of an ith quantum node Ri,

ΔRi=1Dif=1DiΔiσf, 11

where 0Δiσf1 is the noise probability on an fth output density matrix σf of Ri, defined as

Eσf=1-Δiσfσf+Δiσfσf, 12

where E is a noisy channel, while σf is the noisy density matrix with an arbitrary noise, defined as

σf=Uefσf(Uef), 13

where Uef is an error transformation.

State of the quantum network

Let SN refer to the state (statistical model) of N, as

SN=fBFFN,ΔFN,ϕFFN, 14

where fBFFN is a normalized value of BFFN (see (9)), ΔFN is given in (10), while ϕFFN is a normalized value of FFN (see (7)).

Seamless property and optimality of an entanglement flow

Seamless entanglement flow

Definition 5

(Seamless property of entanglement flow) An FN entanglement flow is seamless, FN=F~N, if for all V nodes of N

φiφ, 15

where φ is a critical bound on network fluctuation φ (see (45)) set for the i=1,,V nodes of N.

Seamless optimal entanglement flow

Definition 6

(Seamless optimal entanglement flow) An FN entanglement flow is seamless optimal, FN=FN, if FN is seamless, FN=F~N, and

BFFNBFSN, 16

where BFSN is a lower bound on BFSN in a SN stable equilibrium state of N.

Dynamics of the entangled structure

Weakly entangled quantum networks

Definition 7

(Weakly entangled subnetwork of the entangled quantum network) Let SN be a subnetwork of N with SN quantum nodes. The SN subnetwork is weakly entangled, SN, if only

BFSN<BFSN, 17

holds for the BFSN average entanglement throughput of SN for a particular entanglement fidelity F,

BFFN=1ΩSNj=1ΩSN1SPjs=1SPjBF,PjEs. 18

where ΩSN is the number of paths of SN, while BFSN is an expected value of BFSN for a particular entanglement fidelity F.

Strongly entangled quantum networks

Definition 8

(Strongly entangled subnetwork of the entangled quantum network) The SN subnetwork of N is strongly entangled, SN, if only

BFSNBFSN, 19

for a particular entanglement fidelity F.

Cycle

Definition 9

A cycle C with cycle-time tC=1/fCsec is set via an oscillator OC with frequency fC=1/tC in the quantum nodes used for synchronization of a quantum network.

The sC cycles identify stC=s/fCsec, where s is a nonzero real number.

Dynamics and equilibrium states of entangled networks

Stability of an entangled quantum network

Theorem 1

(Dynamics of the entangled network structure) The ΨFN stability function defines the stability of the entangled structure N as

ΨFNϕFFN=VcBφχFN, 20

where FFN is the average fidelity of FN, ϕ· is a normalizing function, cB and φ are constants, while χFN is statistical quantity determined via ΔFN,ϕFFN and FFN.

Proof

The proof is purely statististical, defines the stability function motivated by the terminology of free energy potential, showing how the network state evolves where a challenge is evaluating the Chapman–Kolmogorov equation, that will be defined in (48).

Let SN refer to the state of N as given by (14). Then, a SN stable equilibrium state of (14) is defined as

SN=fBFFN,ΔFN,ϕFFN, 21

where refers to the function values in SN.

The formalization of (14) is plausible model for the fluctuation dynamics analysis, since the entangled network structure formulates a macroscopic system with local interactions125,126. In our analytical model, the local interactions are represented by a normalized value of the BFFN average entanglement rate of entanglement flow, while the global parameter is the ΔFN average noise of entanglement flow in the entangled structure. Another important parameter of the statistical model is the order parameter, which represents the statistical orderliness of the system. In the statistical physics model of the entangled quantum network structure, the orderliness of the system is represented by a normalized value of the FFN average fidelity of the entanglement flow in the quantum network.

The ϕ· and f· normalizing functions are defined as follows.

The ϕFFN normalized value of FFN (see (7)) is defined as

ϕFFN=FFNξ~FN, 22

where -1ξ~FN1 identifies the ratios of quantum repeaters in N for which the FPRi average fidelity (see (6)) is FPRi<FPRi and FPRiFPRi, where FPRi is a lower bound on FPRi. See also (29) and (33) for a detailed definition of ξ~FN.

The fBFFN normalized value of BFFN is defined as

fBFFN=BFFN1BFFN, 23

where BFFN is a critical bound for BFFN.

The function in (23) can be characterized as

fBFFN=fBFFN<1,ifBFFN<BFFNfBFFN=1,ifBFFN=BFFNfBFFN>1,ifBFFN>BFFN. 24

Using the statistical physics model SN of (14), let HFN be the Hamiltonian of the entanglement flow FN in the entangled network structure N, as

HFN=-HΔFNiVσi-Ei,kSJi,kσiσk, 25

where Ji,k is an interaction parameter, while HΔFN is the Hamiltonian125,126 of the average noise ΔFN (see (10)), as

HΔFN=1μ0ΔFNcBφ, 26

where μ0 is a normalization term defined via Ji,k125,126, as

Ji,k=1μ02JJ-JJ, 27

while cB and φ constants, while σi represents a state of quantum node RiV of N, i=1,,V, defined as

σi=ξiμ0, 28

where ξi is as

ξi=signΔFPRi, 29

where the signx function returns the sign of x (sign0 is considered as negative), ΔFPRi is as

ΔFPRi=FPRi-FPRi, 30

The HFN Hamiltonian of FN from (25) can be rewritten as

HFN=-HΔFNμ0iξi-Ji,kξiξk. 31

The result in (31) is equivalent to an Ising system125127 in statistical physics, while in some physical models ξi,ξj can also refer to spin up/down of qubits ij. In the current system model, these parameters refer to the state of quantum nodes in terms of quantum fidelity, see (29) and (30).

From some fundamentals of statistical physics125127, the Hξi Hamiltonian of (29) can be derived in the following manner. Let ξi and ξk be associated to Ri and Rk, as given in (29). Then, by utilizing the Weiss mean field147 approximation (The Weiss mean field theory is the mean field theory of an Ising model147.), ξiξk can be evaluated as

ξiξk=ξi-ξ~FNξk-ξ~FN-ξ~FN2+ξ~FNξi+ξkξ~FN2+ξ~FNξi+ξk, 32

where ξ~FN is defined as

ξ~FN=1Vi=1Vξi. 33

As follows, (22) can be rewritten as a statistical quantity, as

ϕFFN=FFNVi=1Vξi, 34

and the range of (34) can be characterized as

ϕFFN=-1ϕFFN<0,if-1ξ~FN<0FFN>0ϕFFN=0,ifξ~FN=0FFN00<ϕFFN1,if0<ξ~FN1FFN>0. 35

From the relations (32) and (33), the Hamiltonian HFN from (31) can be rewritten as

HFN=-HΔFNμ0iVξi-JEi,kS-ξ~FN2+ξ~FNξi+ξk=-HΔFNμ0Vξ~FN-J-ξ~FN2Ei,kS1+ξ~FNEi,kSξi+ξk=-HΔFNμ0Vξ~FN-J-ξ~FN212K~V+ξ~FNK~iVξi=-HΔFNμ0Vξ~FN-J-ξ~FN212K~V+ξ~FN2K~V=-V-HΔFNμ0ξ~FN+12JK~ξ~FN2, 36

where K~ is the average number of entangled connections between the nodes, defined as

K~=1JcBφfBFFN, 37

where fBFFN is given in (23), while

Ei,kS1=12K~V, 38

since the term K~V takes twice the entangled connections of N.

Since Hξi is derived for the V=1 and S=K case, from (36), the Hamiltonian Hξi of ξi is as

Hξi=-HΔFNμ0ξi-JξiEi,kSξk=-ξiHΔFNμ0+JKξ~FN. 39

From the Hamiltonian HFN in (36), the EFN energy of the system SN can be straightforwardly evaluated as

EFN=-VHΔFNμ0ξ~FN+12K~Jξ~FN2, 40

while the SeFN entropy of SN is as (see also the Shannon–Boltzmann formula125127)

SeFN=-VcBifξilnfξi, 41

where cB is a constant (set as the Boltzmann’s constant in statistical physics), while fξi is a distribution function (Gibbs state125127) as

fξi=exp-HξicBφ, 42

where φ is the temperature in statistical physics125127, however in our setting, φ is an internal parameter called fluctuation frequency. The value of φ quantifies the fluctuations of the network structure, and determined as follows.

Using Hξi (see (39)) in (42), allows us to rewrite fξi in function of fBFFN, ΔFN and ξ~FN, as

fξi=1XexpΔFN+fBFFNξ~FNξi, 43

where X is a normalization term, defined as

X=i=1VexpΔFN+fBFFNξ~FNξi, 44

thus from (42) and (43), φ is yielded as

φ=-HξicBln1XΔFN+fBFFNξ~FNξi. 45

Since, from some fundamentals of statistical physics125, the ΨFN stability of SN is analogous to the difference of the EFN energy and the weighted entropy φSeFN,

ΨFN=EFN-φSeFN, 46

where φ is the fluctuation frequency (analogous to temperature in the thermodynamical free energy potential function). The ϕFFN term (34) therefore identifies the weighted average fidelity of FN, such that ξ~FN is a stochastic variable, since ξ~FN fluctuates over the system states SNt, t=1,,T, where T is a total system evaluation time period, and Nt is the state of N at a particular t. Therefore, at a particular system state SNt, ξ~FN can be characterized by a function

ψξ~FN,SNt=fξ~FN,SNt, 47

such that fξ~FN,SNt refers to (42) taken over ξ~FN at a given SNt. The derivative of ψξ~FN,SNt=fξ~FN,SNt is evaluated as

dψξ~FN,SNtdSNt=ξ~FNPrξ~FNξ~FNψξ~FN,SNt-ψξ~FN,SNtξ~FNPrξ~FNξ~FN, 48

where Prξ~FNξ~FN is the probability of the transition ξ~FNξ~FN at a given state SNt, Prξ~FNξ~FN is the probability of ξ~FNξ~FN at a given SNt. In statistical physics, (48) identifies the so-called master equation, or Chapmann–Kolmogorov equation125,126.

A challenge in the evaluation of (48) is the determination of the conditional probabilities for a given SNt, and to find the solutions of the derivative dψξ~FN,SNtdSNt=0 to determine the probability distribution of the state-transition function ψξ~FN,SNt .

The conditional probabilities in (48) are derived as follows. Assuming that SN is a current system state, the following condition can be written for the conditional probabilities:

Prξiξiψξi,SNt=Prξiξiψξi,SNt. 49

Then, using (42) with the Hamiltonian, the Φξi,ξ~FN distribution function at a particular ξ~FN can be evaluated, as

Φξi,ξ~FN=1ωexpΔFN+fBFFNξ~FNξi, 50

where ω is a normalization term,

ω=iexpΔFN+fBFFNξ~FNξi. 51

Using (50) and (51), ξ~FN can be yielded as

ξ~FN=iξiΦξi,ξ~FN=1ωiξiexpΔFN+fsBFFNξ~FNξi=iξiexpζFNξiiexpζFNξi=ΩFNζFN, 52

where

ΩFN=lniexpζFNξi, 53

and

ζFN=ΔFN+fBFFNξ~FN. 54

Since, the value of ξi can be selected from W possible values, the formula of (52) can be written as

ξ~FN=s0+ΔsexpζFNΔs1-expζFNΔsW1-expζFNΔsW1-expζFNΔs-WexpζFNΔsW-1, 55

where W=2, s0=-1, and

Δs=1iξi-s0=2. 56

Therefore, for the entangled quantum network N, (55) can be written as

ξ~FN=expζFNΔs-1expζFNΔs+1=exp2ζFN-1exp2ζFN+1=expζFN-exp-ζFNexpζFN+exp-ζFN=tanhζFN=tanhΔFN+fsBFFNξ~FN. 57

Then, using (50), the formula of (49) can be rewritten as

PrξiξiΦξi,ξ~FN=PrξiξiΦξi,ξ~FN, 58

and since ξi=±1,ξi=1, the conditional probabilities are yielded as

Prξiξi=Qexp-ΔFN+fBFFNξ~FN 59

and

Prξiξi=QexpΔFN+fBFFNξ~FN, 60

where Q is a constant.

From (59) and (60), the derivative in (48) can be rewritten as

dψξ~FN,SNtdSNt=-κFNξ~FNfsBFFNψξ~FN,SNt+ΠFNξ~FNfsBFFNψξ~FN,SNtξ~FN, 61

where

κFNξ~FN=Qα-ξ~FNβ, 62

where

α=sinhΔFN+fBFFNξ~FN 63

and

β=coshΔFN+fBFFNξ~FN, 64

while

ΠFNξ~FN=1VQβ-ξ~FNα, 65

therefore the solution125,126 of the derivative dψξ~FN,SNtdSNt=0 is yielded as

ψξ~FN,SNt=cΠFNξ~FNexp-1ξ~FNκFNxΠFNxdx, 66

where c is a constant.

It also can verified, that for ξi=±1, (50) picks up the value of

Φξi,ξ~FN=1±ξ~FN2, 67

thus using (39), the SeϕFFN entropy at a particular ϕFFN is as

SeϕsFFN=-VcBiΦξi,ξ~FNlnΦξi,ξ~FN=-VcB121+ϕsFFNFFNln1+ϕsFFNFFN+121-ϕsFFNFFNln1-ϕsFFNFFN. 68

As a corollary, from (46) and (68), the ΨFNϕFFN stability function at a particular ϕFFN is yielded as

ΨFNϕsFFN=EFN-φSeϕsFFN=VcBφχFN, 69

where χFN is defined as

χFN=-ΔFNϕsFFNFFN-12fsBFFNϕsFFNFFN2+121+ϕsFFNFFNln1+ϕsFFNFFN+121-ϕsFFNFFNln1-ϕsFFNFFN, 70

where ΔFN is evaluated via (26) as

ΔFN=μ0HΔFNcBφ=-lnfξiμ0HΔFNHξi, 71

where fξi is given in (42), Hξi is as in (39), while fBFFN can be rewritten via (37) as a statistical quantity

fsBFFN=K~JcBφ=-lnfξiK~JHξi. 72

Therefore, such as ϕFFN in (34), both ΔFN and fBFFN can be rewritten as statistical parameters of SN of the entangled quantum network N.

The next problem is the analysis of function (69) to derive the fluctuation model and the SN stable equilibrium state of the entangled network. The stability analysis of N is as follows.

To find the SN state of N, the derivative of (69) is taken, as

ΨFNϕsFFN=dΨFNϕsFFNdξ~FN=-ΔFN+fsBFFNξ~FN+12ln1+ξ~FN1-ξ~FN, 73

from which the condition of ΨFNϕFFN=0 results in

ΔFN+fBFFNξ~FN=12ln1+ξ~FN1-ξ~FN. 74

Then, since

121±ξ~FN=exp±ΔFN+fBFFNξ~FN2coshΔFN+fBFFNξ~FN, 75

the result in (74) can be rewritten as

ξ~FN=121+ξ~FN-121-ξ~FN=tanhΔFN+fsBFFNξ~FN. 76

As, the ΔFN average noise of the entanglement flow in the entangled structure is zero, ΔFN=0, (76) is yielded as

ξ~FN=s0+ΔsW-12+W2-112Δs2fsBFFNξ~FN-W4-1720Δs4fsBFFN3ξ~FN3, 77

where W=2, s0=-1, Δs=1iξi-s0=2, thus (77) can be rewritten as

ξ~FN=tanhfsBFFNξ~FN=fsBFFNξ~FN-13fsBFFN3ξ~FN3, 78

with solutions ξ~FN0,1,2, as125

ξ~FN0=0, 79

and

ξ~FN1,2=±3fBFFN-1fBFFN3. 80

As SN is determined via (79) and (80), the stability of SN can be determined via the second derivative of ΨFNϕFFN, which is for a given solution ξi~FN, i=0,1,2 is as

ΨFNϕFFN=-fBFFN+11-ξi~FN. 81

From (81), the stability of the SN equilibrium state of the entangled quantum network N is as follows.

If

ΨFNϕFFN<0, 82

then the SN equilibrium state of the entangled quantum network N is stable (in a stable equilibrium state, system fluctuations cannot transform SN to a non-stable system state), if

ΨFNϕFFN=0, 83

then SN equilibrium state is critical stable (in a critical stable equilibrium state, the system is fragile and a small fluctuation can transform SN to a non-stable system state), while if

ΨFNϕFFN>0, 84

then the SN equilibrium state of the entangled quantum network N is non-stable.

As a corollary, if ΔFN=0 and

BFFN<BFFN, 85

then the SN equilibrium state of N is stable only for ξ~FN0=0. If ΔFN=0 and

BFFNBFFN, 86

then the SN equilibrium state is stable only for ξ~FN1,2.

The stability derivation for the ΔFN>0 case, is as follows.

From the series expansion of (69), ΨFNϕFFN can be rewritten as

ΨFNϕsFFN=-ln2-ΔFNξ~FN+121-fsBFFNξ~FN2+112ξ~FN4, 87

thus the SN equilibrium state can be determined from the ΨFNϕFFN derivative of (87), as

ΨFNϕsFFN=-ΔFN+1-fsBFFNξ~FN+13ξ~FN3=0, 88

with solutions125,126

i=02ξ~FNi=31-fsBFFN+ξ~FN22-i=01ξ~FNi=3ΔFN-i=02ξ~FNi=0. 89

The stability of the SN equilibrium state can be determined from the second derivate of (87),

ΨFNϕFFN=1-fBFFN+ξ~FN2. 90

If SN is a critical stable equilibrium state, then

ΨFNϕFFN=1-fBFFN+x2=0, 91

which holds only if the parameters in (89) are set as

ξ~FN0,1=x, 92

and

ξ~FN2=-2x, 93

where

x=±fBFFN-1, 94

with

fBFFN>1 95

for a critical stable equilibrium state (91).

Therefore, if fBFFN1, then for any ΔFN>0, ΨFNϕFFN0 in (90). However, the entangled network structure still could have stable SN equilibrium state at fBFFN1 and ΔFN>0, but not a critical stable.

At (91), the ΔFN average noise for a critical stable equilibrium state (see (91)) is as

ΔFN=-23x3=23fBFFN-13, 96

such that

ΔFN2=49fBFFN-13 97

from which fBFFN can be rewritten as

fBFFN=943ΔFN23+1. 98

As follows, (95) can be rewritten as

943ΔFN23+1>1, 99

which yields the condition for a critical stable state

ΔFN>0. 100

The result in (100) indicates that for any ΔFN>0 and fBFFN1, the entangled network is in a ξ~FN=x critical stable equilibrium state SN. If ΔFN>0 and fBFFN<1, the entangled network is in a stable or in a non-stable equilibrium state SN.

To conclude the statements, if ΔFN>0, then the stable SN equilibrium state is yielded at a system state ξ~FNi that minimizes ΨFNϕFFN, as a global minima

ΨFNϕFFN=minΨFNFFNξ~FNii=02 101

such that 13i=02ξ~FNi=ΔFN>0.

The derivations also reveals that for any fBFFN0, the solutions of ξ~FN evaluated via (89) are determined by the actual value of ΔFN. As a corollary, the minimal values of ΨFNϕFFN in (101) also depend on ΔFN.

Then, let us assume that the entangled structure is in a SNtSN non-equilibrium state. Finally, it also can be verified that from SNt it is always possible to reach a stable SNt+Γ=SN equilibrium state, as follows.

Let ξ~SNtFN and ξ~SNFN refer to (33) at SNt and SN, defined as

ξ~SNtFN=ξ~SNFN+λ, 102

where λ after some calculations is yielded as

λ=Asinςt+Ncosςt, 103

where ς is as

ς=1-fBFFN+ξ~SNFN2G0.5, 104

where G is a constant, and

Gd2ξ~SNtFNdt2=-1-fBFFN+ξ~SNFN2λ. 105

Thus, from SNt the system will be in a stable SN at SNt+Γ, as

SNt+Γ=SN, 106

where

Γ=1ς, 107

where ς is given in (104).

The proof is concluded here.

Stable equilibrium state of the entangled network

This section illustrates the results of Theorem 1.

Noiseless scenarios Here, the stable equilibrium states of the entangled structure are determined for ΔFN=0 scenarios.

In Fig. 1, the stability function ΨFNϕFFN (see (69)) and the stable SN equilibrium states of the entangled quantum network N are depicted at average noise ΔFN=0 (71), in function of the normalized fidelity ϕFFN-FFN,FFN (see (22)) and normalized entanglement throughput fBFFN (see (23)). As it is depicted in Fig. 1a, if fBFFN1, then the entangled structure has only one stable equilibrium state at ϕFFN=0 (depicted by the green-line empty dot). As depicted in Fig. 1b, if fBFFN>1, then entangled structure has two different stable equilibrium states (depicted by the red dots) at ϕFFN=-FFN and ϕFFN=FFN.

Figure 1.

Figure 1

The stability function ΨFNϕFFN and the stable SN equilibrium states of the entangled quantum network N at ΔFN=0, in function of ϕFFN-FFN,FFN and fBFFN. (a) The stable SN equilibrium state of the entangled structure for fBFFN=0,1 (depicted by green-line empty dot), and the stable SN equilibrium states of the entangled structure for fBFFN=2 (depicted by red dots). As fBFFN1, the entangled structure has one stable equilibrium state (green), while as fBFFN>1, the entangled structure has two stable equilibrium states (red dots). (b) The stable SN equilibrium states of the entangled structure for fBFFN=3,4,5 (depicted by red dots). Since fBFFN>1, the entangled structure has two stable equilibrium states (red dots) for a given fBFFN.

Noisy scenarios Here, the stable equilibrium states of the entangled quantum network are determined for ΔFN>0 scenarios.

In Fig. 2, the stability function ΨFNϕFFN (see (69)) and the stable SN equilibrium states of the entangled quantum network N are depicted at average noise ΔFN>0 (71), in function of the normalized fidelity ϕFFN-FFN,FFN (see (22)) and normalized entanglement throughput fBFFN (see (23)). As it is depicted in Fig. 2a, c, e, g, if ΔFN>0 and fBFFN1, then the entangled structure has only one stable equilibrium state at a particular ϕFFN>0 (depicted by the green-line empty dot). As depicted in Fig. 2b, d, f, h, if ΔFN>0 and fBFFN>1, then entangled structure has two different stable equilibrium states (depicted by the red dots) at ϕFFN=-FFN and ϕFFN=FFN.

Figure 2.

Figure 2

The stability function ΨFNϕFFN and the stable SN equilibrium states of the entangled quantum network N at ΔFN>0, in function of ϕFFN-FFN,FFN and fBFFN, V=100. (a) The stable SN equilibrium state of the entangled structure at ΔFN=0.25 and for fBFFN=0,1 (depicted by green-line empty dot), and the stable SN equilibrium states of the entangled structure for fBFFN=2 (depicted by red dots). (b) The stable SN equilibrium states of the entangled structure for ΔFN=0.25 and fBFFN=3,4,5 (depicted by red dots). (c) The stable SN equilibrium state of the entangled structure at ΔFN=0.5 and for fBFFN=0,1 (depicted by green-line empty dot), and the stable SN equilibrium states of the entangled structure for fBFFN=2 (depicted by red dots). (d) The stable SN equilibrium states of the entangled structure for ΔFN=0.5 and fBFFN=3,4,5 (depicted by red dots). (e) The stable SN equilibrium state of the entangled structure at ΔFN=0.75 and for fBFFN=0,1 (depicted by green-line empty dot), and the stable SN equilibrium states of the entangled structure for fBFFN=2 (depicted by red dots). (f) The stable SN equilibrium states of the entangled structure for ΔFN=0.75 and fBFFN=3,4,5 (depicted by red dots). (g) The stable SN equilibrium state of the entangled structure at ΔFN=1 and for fBFFN=0,1 (depicted by green-line empty dot), and the stable SN equilibrium states of the entangled structure for fBFFN=2 (depicted by red dots). (h) The stable SN equilibrium states of the entangled structure for ΔFN=1 and fBFFN=3,4,5 (depicted by red dots).

A comparative analysis is included in Section A.1 of the Supplementary Information.

Weakly and strongly entangled structures of the quantum Internet

Theorem 2

(Weakly and strongly entangled subnetworks of the entangled network) For a weakly entangled subnetwork SN, the FSN=FPRii=1SN fidelities of the nodes of SN are uncorrelated, while for a strongly entangled subnetwork SN, the FSN=FPRii=1SN fidelities of the nodes in SN are correlated.

Proof

Let SN refer to a subnetwork of N with SN quantum nodes. For the definition of SN weakly entangled and SN strongly entangled subnetworks, see (17) and (19), respectively. For any ΔFN, N has strongly entangled subnetworks, SN, only if fBFFN1, while for fBFFN<1, N has only weakly entangled subnetworks.

For the SN nodes of SN, Ri, i=1,,SN, let ΔFSN be a fidelity measure, defined as

ΔFSN=i=1SNΔFPRi, 108

where ΔFPRi is defined in (30), RiSN.

Then, let MSN be the number of SN subnetworks, and let SNz refer to an zth subnetwork, z=1,,MSN. For the MSN subnetworks, let μNSN,ΔFN be the average of (108) , as

μNSN,ΔFN=1MSNz=1MSNΔFSNz=1MSNz=1MSNi=1SNzΔFPRi. 109

From (108) and (109), the weakly and strongly entangled subnetworks can be determined for any fBFFN and ΔFN.

As a corollary, at ΔFN=0 for a weakly entangled subnetwork SN, the

FSN=FPRii=1SN 110

fidelities of the nodes of SN are uncorrelated that leads to

μNSN,00, 111

since ΔFN=0, the value of ΔFSN in (108) is as

ΔFSN0 112

for the nodes of SN.

While for a strongly entangled subnetwork SN, the

FSN=FPRii=1SN 113

fidelities of the nodes in SN are correlated via an entanglement purification PSN, that leads to

μNSN,00. 114

It is because at ΔFN=0, the value of ΔFSN in (108) is as

ΔFSN0 115

for the nodes of SN.

As ΔFN>0, both μNSN and μNSN are increased,

μNSN,ΔFN>0>μNSN,0, 116

and

μNSN,ΔFN>0>μNSN,0, 117

since the values of ΔFSN in (108) and ΔFSN in (115) are decreased due to ΔFN>0.

The proof is concluded here.

Weakly and strongly entangled structures

In this section, the results are illustrated with entangled network structures.

Noiseless scenarios The results are depicted in Fig. 3 for strongly and weakly entangled structures at ΔFN=0, N=500 and MSN=5, SNz=100, z=1,,MSN.

Figure 3.

Figure 3

Weakly and strongly entangled structures at ΔFN=0, N=500 and MSN=5, SNz=100, z=1,,MSN. (a) The distribution of the FPRi node fidelities at FPRi=0.7, i=1,,N, of a weakly entangled structure at fBFFN=0.25 (depicted by black), and of a strongly entangled structure at fBFFN=1.25 (depicted by red). (b) The ϕFFN normalized fidelities of the MSN subnetworks SNz, z=1,,MSN, for a weakly entangled structure at fBFFN=0.25 (depicted by black), and of a strongly entangled structure at fBFFN=1.25 (depicted by red). (c) The ΔFSN values of the MSN subnetworks SNz, z=1,,MSN, for a weakly entangled structure at fBFFN=0.25 (depicted by black) and the μNSN,ΔFN=μNSN,00 average (depicted by dashed green line). (d) The ΔFSN values of the MSN subnetworks SNz, z=1,,MSN, for a strongly entangled structure at fBFFN=1.25 (depicted by black) and the μNSN,ΔFN=μNSN,00 average (depicted by dashed green line).

The results of Fig. 3 are detailed as follows. At ΔFN=0, the weakly and strongly entangled structures have a fundamentally different characteristics. While for a weakly entangled structure SN at fBFFN=0.25, the FPRi fidelities of the nodes are uncorrelated and statistically independent, for a given subnetwork SNz, the number of quantum repeaters with fidelity FPRi<FPRi and FPRiFPRi are statistically equal. As a corollary, in Fig. 3b, the ϕFFN normalized fidelities taken for the quantum repeaters of the subnetworks are around zero, ϕFFN0. On the other hand, for a strongly entangled structure SN at fBFFN=1.25, the distribution of the FPRi fidelities are fundamentally different, since the quantum repeaters are connected via high entanglement-throughput connections that allows to perform PSN entanglement purification between the nodes. As a corollary, if the quantum nodes are connected via high entanglement-throughput connections, the quantum nodes formulate a strongly entangled structure, and the FPRi fidelities become correlated. As follows, for a strongly entangled subnetwork SN, the fidelities of the quantum nodes are statistically not independent. Therefore, the ϕFFN normalized fidelities taken for the quantum repeaters of the subnetworks are as ϕFFN-FFN, since for the nodes of the strongly entangled subnetwork, the corresponding relation is FPRiFPRi. Since the ΔFSN values are evaluated from the FPRi node fidelities at a particular FPRi, the fundamentally different characteristics of the weakly and strongly entangled structure are also reflected in Fig. 3c, d. While for a weakly entangled structure SN, the ΔFSN is around zero, for a strongly entangled structure SN, ΔFSN is significantly below zero. As a corollary, the μNSN,ΔFN average converges to zero for a weakly entangled structure SN, while it is significantly below zero for a strongly entangled structure SN.

Noisy scenarios The results of are depicted in Fig. 4 for strongly and weakly entangled structures at ΔFN>0, N=500 and MSN=5, SNz=100, z=1,,MSN.

Figure 4.

Figure 4

Weakly and strongly entangled structures at ΔFN>0, N=500 and MSN=5, SNz=100, z=1,,MSN. The ΔSNz subnetwork noise for a zth subnetwork SNz is set as ΔSNz=z/10. (a) The distribution of the FPRi node fidelities at ΔFN>0, FPRi=0.7, i=1,,100, of a weakly entangled structure at fBFFN=0.25 (depicted by black), and of a strongly entangled structure at fBFFN=1.25 (depicted by red). (b) The ϕFFN values of the MSN subnetworks SNz, z=1,,MSN at ΔFN>0, for a weakly entangled structure at fBFFN=0.25 (depicted by black), and of a strongly entangled structure at fBFFN=1.25 (depicted by red). (c) The ΔFSN values of the MSN subnetworks SNz, z=1,,MSN at ΔFN>0, for a weakly entangled structure at fBFFN=0.25 (depicted by black) and the μNSN,ΔFN=μNSN,ΔFN>0>μNSN,0 average (depicted by dashed green line). (d) The ΔFSN values of the MSN subnetworks SNz, z=1,,MSN at ΔFN>0, for a strongly entangled structure at fBFFN=1.25 (depicted by black) and the μNSN,ΔFN=μNSN,ΔFN>0>μNSN,0 average (depicted by dashed green line).

The ΔFN>0 situation significantly differs from the ΔFN=0 case, however the relation between the weakly and strongly entangled structures is analogous to the ΔFN=0 case. As a fundamental impact of the increased noise level, the FPRi fidelity of the quantum nodes are decreased, therefore for a particular Ri, the probability of FPRi<FPRi is higher compared to the ΔFN=0 case. As a corollary, in Fig. 4b, the ϕFFN values are increased for both the weakly entangled SN and strongly entangled SN structures. Similarly, the ΔFSN values in Fig. 4c, d are also increased compared to the ΔFN=0 case, since in the ΔFN>0 setting, the values of ΔFPRi of the quantum nodes pick up a positive value with higher probability than in the ΔFN=0 setting for both the SN and SN entangled structures. Therefore, the corresponding relations μNSN,ΔFN>0>μNSN,0 and μNSN,ΔFN>0>μNSN,0 straightforwardly follow between the weakly and strongly entangled structure of the noisy and noiseless scenarios.

Impacts of noise on the equilibrium states of the entangled network

Lemma 1

(Impacts of noise on the equilibrium states of the entangled network) For a given fBFFN, the stable equilibrium states of the entangled network are determined only by ΔFN.

Proof

The proof trivially follows form the formula of (69).

The proof is concluded here.

Stable equilibrium states of the entangled structure at noise

This section demonstrates the results for noisy scenarios.

The stability function of the entangled network in the function of ΔFN is depicted in Fig. 5a–f. Figure 5a, b show a weakly entangled network structure, while Fig. 5c–f illustrate a strongly entangled network structure.

Figure 5.

Figure 5

Impacts of noise on the equilibrium states of a weakly entangled structure SN (a), (b) and strongly entangled (c)–(f) quantum network SN at a given fBFFN, V=100. The stability function ΨFNϕFFN (left) in function of ϕFFN and ΔFN, and ΨFNϕFFN in function of ΔFN, ΔFN0,1, at a given fBFFN (right) identify the: (a) Weakly entangled quantum network, fBFFN=0. (b) Weakly entangled quantum network, fBFFN=0.25. (c) Strongly entangled quantum network, fBFFN=1.25. (d) Strongly entangled quantum network, fBFFN=1.5. (e) Strongly entangled quantum network, fBFFN=2. (f) Strongly entangled quantum network, fBFFN=4.

Analysis of SN stable equilibrium states can be found in Section A.2 of the Supplementary Information.

Corollaries

The corollaries of the derivations are summarized in Corollaries 1, 3.

Corollary 1

For any ΔFN0, a weakly entangled network structure SN has only a global stable equilibrium state SN.

Corollary 2

For ΔFN=0, a strongly entangled network structure SN has a global stable equilibrium state SN or two local, symmetrical equilibrium states SN, depending on the value of fBFFN.

Corollary 3

For any ΔFN>0, a strongly entangled network structure SN has a global stable equilibrium state SN or two local, but asymmetrical equilibrium states SN depending on the value of fBFFN.

Dynamics of a local entanglement purification

Lemma 2

(Dynamics impacts of local entanglement purification in the quantum Internet) The use of entanglement purification for the improvement of the entanglement fidelity only for a given subset of quantum nodes statistically decreases the total capability of the quantum network to improve the average fidelity of the network.

Proof

To derive the proof via the statistical physics model, we construct a quantum repeater-level model, in the following manner.

Let δRi characterize the state of an ith quantum repeater Ri, defined as

δRi=ψBFPRi, 118

where BFPRi is the entanglement rate consumption of entanglement purification PRi (sum of incoming and outcoming entanglement rates in Ri associated with PRi), as

BFPRi=1SPRik=1SPRiBFEk, 119

where SPRiis the set of entangled connections of Ri associated with entanglement purification PRi, SPRi is the cardinality of set SPRi, while ψ is defined as

ψ=FPRiBFPRi, 120

where FPRi is a target average fidelity of Ri,

FPRi>FPRi, 121

while FPRi is a current average fidelity of Ri defined via (6), and BFPRi is a target value of BFPRi, as

BFPRi<BFPRi. 122

The quantity in (120) therefore identifies a statistical cost of reaching FPRi in terms of entanglement rate consumption BFPRi (Increasing BFPRi at a given FPRi means that a higher entanglement rate consumption is needed in Ri, and as a corollary, ψ is decreased.). The target values FPRi and BFPRi are considered as global quantities, i.e., (120) is considered to be the same for all quantum repeaters of the network.

Then, let ω be the ratio of the target average fidelity FFN of the entanglement flow FN of N and FPRi,

ω=FFNFPRi, 123

which quantity identifies and preserves the value of the local FPRi with respect to a given global FFN in the statistical model.

Using (123), FFN can be expressed as

FFN=ωFPRi. 124

From (118) and (123), the CRi capability of a given quantum repeater Ri to improve the FFN average fidelity of FN to a target FFN via an entanglement purification PRi is defined as

CRi=δRiω. 125

Using (125), the CN capability of the entangled network N to improve the FFN average fidelity of FN to a target FFN via PRi in the V nodes, i=1,,V, of N is as

CN=i=1VCRi=ψωBFPN, 126

where BFPN is the total entanglement rate consumption of entanglement purification PN in N,

BFPN=i=1VBFPRi, 127

from which the B~FPRi average entanglement rate consumption at PN for a given node is

B~FPRi=1VBFPN. 128

Note that ψ and ω in (126) are global quantities (same for all quantum nodes of the quantum network).

Then, at a given FPRi, let PRi be an entanglement purification in a local Ri with an increased target entanglement rate consumption BFPRi, such that

BFPRi>BFPRi<BFPRi, 129

where BFPRi is given in (119).

Using PRi, allows us to rewrite (120) as ψ

ψ=FPRiBFPRi<ψ, 130

that can be rewritten as

ψ=ψC1-C2BFPN, 131

where C1,C20,1 are constants, BFPN is the total entanglement rate consumption of entanglement purification PN, as

BFPN=i=1VBFPRi=i=1V1SPRik=1SPRiBFEk, 132

thus for a given quantum node the B~FPRi average entanglement rate consumption at PN is

B~FPRi=1VBFPN. 133

As a corollary, using (131), the state of Ri from (118) can be rewritten at PRi as

δRi=ψBFPRi=ψC1-C2BFPNBFPRi, 134

while the CRi capability of a given Ri from (125) can be rewritten as

CRi=ωψC1-C2BFPNBFPRi, 135

while from (126), the CN capability of the entangled network N to improve the FFN average fidelity of FN to a target FFN via PRi in the V nodes, i=1,,V, of N is as

CN=i=1VCRi=ψωBFPN=ωψC1-C2BFPNBFPN=ωψC1BFPN-C2BF2PN. 136

After some calculations, CN in (136) is maximized if CRi is

CRi=14C2VωψC12. 137

Putting (137) into (136) yields

CN=i=1V14C2VωψC12=14C2ωψC12, 138

from which BFPN can be found via the solution of

C2BF2PN-C1BFPN-14C2C12=0, 139

which yields

BFPN=C12C2. 140

As it can be concluded from the comparison of (135) and (137), CRi at a node-level maximization in (135), and CRi in a network-level maximization in (137), in fact, are different.

Let assume that in the quantum network, a set Γ of

Γ=V 141

quantum nodes use purification PRi,

V=XV, 142

where X0,1, such that

BFPN=1+μBFPN, 143

where μ0,1 is a constant, while the remaining set Γ of

Γ=V-V 144

quantum nodes use purification PRi, with BFPN.

For a given Ri from set Γ, CRi is as

CRi=1-Xμ14C2VωψC12, 145

while for the total Γ nodes of Γ,

CΓ=Γ1-Xμ14C2VωψC12=V-XV1-Xμ14C2VωψC12. 146

Similarly, for a given Ri from set Γ, CRi is as

CRi=1-Xμ1+μ14C2VωψC12, 147

while for the total Γ nodes of Γ,

CΓ=Γ1-Xμ1+μ14C2VωψC12=XV1-Xμ1+μ14C2VωψC12. 148

For the total network N=ΓΓ, from (146) and (148), CN is evaluated as

CN=CΓ+CΓ=V-XV1-Xμ+XV1-Xμ1+μ14C2VωψC12=V1-X2μ214C2VωψC12=1-X2μ214C2ωψC12. 149

From (147) follows, that the improvement of the local capability requires the parameterization μ>0 and 0<X<1/1+μ. On the other hand, from (149) follows that for any X>0 and μ>0, the CN capability of the entangled network N from (138) is decreased by a ratio to

CN=CN, 150

where

=CNCN=1-X2μ2, 151

that immediately proves that statistically, the capability of the entangled network N to improve the FFN average fidelity of FN to a target FFN is decreased if an improved entanglement purification PRi with BFPN>1+μBFPN is applied only to a local subset Γ of quantum nodes in the quantum network, while the remaining set Γ quantum nodes use purification PRi, with BFPN.

The proof is concluded here.

Entanglement flow dynamics

This section derives the dynamics of optimal entanglement flow in the entangled structures of the quantum Internet at fluctuating entangled connections and quantum nodes. The derivations utilize the fundamentals of spectral graph theory141143.

Theorem 3

(Maximally allowed fluctuations in entangled structures for seamless entanglement flow) For the total Q paths of N, the FN entanglement flow is seamless, FN=F~N, if φEsφEs for s=1,,j=1QSPj, where φEs is an upper bound on φEs in a SN stable equilibrium state, φEsφEs.

Proof

A main challenge here is the determination of the φEs fluctuation coefficients of the entangled connections E=Ess=1j=1QSPj. As we prove, the fluctuation coefficients of the entangled connections straightforwardly can be yielded from the structure of the entangled network N, in the following manner.

Let φEs be the fluctuation of an entangled connection Esx,y between nodes x and y, defined as

φEs=φx-φy, 152

where φx and φy are the fluctuations associated with x and y, defined as

φx=fBFx-fBFSN, 153

where fBFx is the normalized outcoming entanglement rate of x on connection Esx,y,

fBFx=BFx1BFFN, 154

thus φx from (153) is as

φx=BFx1BFFN-BFFN1BFFN=1BFFNBFx-BFFN, 155

while

φy=fBFy-fBFSN, 156

where fBFy is the normalized incoming entanglement rate of y on connection Esx,y, as

fBFy=BFy1BFFN. 157

thus φy from (156) can be rewritten as

φy=BFy1BFFN-BFFN1BFFN=1BFFNBFy-BFFN. 158

Thus, φEs from (152) can be rewritten as

φEs=fBFx-fBFSN-fBFy-fBFSN=fBFx-fBFy=1BFFNBFx-BFy. 159

The φEs and the φEs critical coefficients are determined as follows.

For a given EsRi,Rk between Ri and Rk, let ωik>0 be defined as the sum of normalized entanglement throughput of all paths over EsRi,Rk, as

ωik=j=1QfBF,PjEsRi,Rk=j=1QBF,PjEs1BF,PjEs, 160

where BF,PjEs is as in (8), while BF,PjEs is a critical bound on BF,PjEs.

Then, let

W=Wij 161

be a V×V matrix, defined as

Wij=ziωik,ifEsE0,ifEsE, 162

where zi is a constraint for Ri, such that a symmetry condition

ziωik=zkωki 163

holds, where zk is a constraint for Rk. The scaling factors formulate Z as

Z=diagz1,,zV. 164

For a given Ri, let i be the set of all entangled connections of Ri, and let χi be defined as

χi=kiωik, 165

from which a matrix X is defined for the V quantum nodes of N, as

X=diagχ1,,χV. 166

From (161) and (166), the symmetric LN Laplacian141 of the undirected entangled quantum network N is defined as

LN=X-W. 167

Using the condition from (163), LN can be rewritten as an asymmetric and symmetrizable141143 Laplacian LN, as

LN=Z-1LN. 168

Note, that for a general Laplacian LN of a directed entangled quantum network N,

LN=X-W, 169

with

Wij=ziωik,ifEsikE0,ifEsE, 170

the relation in (163) is not a required condition. If (163) is not satisfied, then the general LN is unsymmetrizable141.

Then, let φN be the node fluctuations in N

φN=φ1,,φVT, 171

subject to be found.

Then,

LNφN=λφN, 172

where λ is an eigenvalue of LN. Thus, φN from (171) can be rewritten as an eigenvector that is associated with λ.

The λ eigenvalues of LN are evaluated from (167) and (164) via the relation

SLN=Z1/2LNZ-1/2=Z-1/2LNZ-1/2, 173

where SLN is the scaled Laplacian LN.

Then, (173) can be evaluated further as

Z1/2LNφN=SLNZ1/2φN=λZ1/2φN=λξN, 174

thus SLN has the same eigenvalues as LN, with eigenvector ξN,

ξN=Z1/2φN=ξ1,,ξVT. 175

The eigenvalues of SLN are nonnegative, since

ξNTSLNξN=Ei,kEziωikξizi-ξkzk20, 176

where zi is an ith element of Z (see (164)).

Then, let γi be an orthonormal eigenvector associated with an ith eigenvalue λi (eigenbasis of SLN), i=1,,V as

SLNγi=λiγi, 177

such that

γuγv=δuv, 178

where δuv is the Kronecker delta141.

Using (177), the eigenvalues can be determined via γi, from which φN is straightforwardly yielded by (172). Thus, the φEs fluctuation (152) of an entangled connection Es can be quantified in an exact form.

Then, let SN be a stable equilibrium state of N with an entanglement flow rate BFSN, and let fBFSN be the normalized entanglement rate BFFN of flow FN in SN, defined as

fBFSN=BFFN1BFFN>0, 179

where BFFN is a critical bound on BFFN in SN.

The problem then is the determination of the upper bound φEs on (152) for all entangled connections, such that for a given Es

φEsφEs. 180

We show that of φEs can be evaluated from the LN Laplacian of the entangled quantum network N, since for any seamless F~N entanglement flow FN, the LN general Laplacian of the entangled quantum network N is decomposable141 as

LN=LN+ζLN, 181

where LN is a symmetrizable Laplacian (168), while ζLN is a residual Laplacian, such that

ζLN=0, 182

where 0 is a null matrix.

Let Nt be the state of the entangled network at a particular t, t=1,,T . Then, from (181), the dynamics of the φNt fluctuation coefficients (171) of the entangled structure can be evaluated as

d2φNtdt2=-LNφNt=-LN+ζLNφNt=-LN+0φNt, 183

with

ξNt=Z1/2φNt, 184

and with a scaled Laplacian SLN as

SLN=Z1/2LNZ-1/2=Z1/2LNZ-1/2+Z1/20Z-1/2=Z1/2LNZ-1/2+0=SLN+SζLN, 185

such that SζLN=0, and

d2ξNtdt2=-SLNξNt=-SLNξNt, 186

and

d2ξNtdt2-CddξNtdt=-SLNξNt=SLNξNt, 187

where Cd0 is a constant ((187) is the typical diffusive wave equation on a graph, where the graph Laplacian plays the role of the 2 operator.).

Since (184) can be rewritten via the γi eigenbasis of SLN=SLN as

ξNt=i=1VAitγi, 188

where Ait is defined via the relation of

d2Aitdt2=-λiAit, 189

as

Ait=τiexp±iαit, 190

where

τi=Aiexpiθi, 191

where Ai is the fluctuation amplitude, and

-π<θiπ, 192

is the fluctuation phase, while

αi=λi. 193

As follows, φNt can be rewritten as

φNt=Z-1/2i=1VAitγi=Z-1/2i=1VAiexpiθiexp±iαitγi. 194

From (194) follows, that the determination of the upper bounds φNt on φNt is directly related with the values of Ait. After some calculations, Ait can be rewritten as

Ait=τiexp-Cd2±Υsinθ2t±iΥcosθ2t, 195

where Υ0.

Thus, the critical condition

φiNt<φiNt 196

is yielded via (195) if only

Υsinθ2Cd2. 197

It also can be verified that (197) holds for a general LN (see (181)), if only ζLN=0, which condition is given in (182).

We recall the definition of seamless entanglement flow from (15). It can be straightforwardly verified that relation φEsφEs is determined via (197) for all entangled connections of the quantum network. Therefore, if φiNt is selected for all the V quantum nodes of the quantum network such that (197) is satisfied for all Ait, i=1,,V, then φEsφEs holds for all entangled connections.

The proof is concluded here.

Additional results are included in Section A.3 of the Supplementary Information.

Conclusions

The quantum Internet is an adequate answer to the computational power that becomes available via quantum computers. Here, we evaluated and quantified the dynamics of the entangled network structures of the quantum Internet. We proved the equilibrium states of entangled network structures and derived the effects of noise on the equilibrium states of the entangled network to provide stable quantum communications. We identified the attributes of weakly and strongly entangled structures of the quantum Internet and derived the dynamic effects of local entanglement purification in the global entangled structure of the quantum Internet. The model is independent of the actual physical implementations and it can be applied within the heterogeneous experimental structures of a global-scale quantum Internet.

Ethics statement

This work did not involve any active collection of human data.

Supplementary Information

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 and in part by the BME Artificial Intelligence FIKP grant of EMMI (Budapest University of Technology, BME FIKP-MI/SC).

Author contributions

L.GY. designed the protocol, wrote the manuscript and analyzed the results.

Data availability

This work does not have any experimental data.

Competing interests

The author declares no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

is available for this paper at 10.1038/s41598-020-68498-x.

References

  • 1.Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature. 10.1038/s41586-019-1666-5 (2019). [DOI] [PubMed]
  • 2.Preskill J. Quantum computing in the NISQ era and beyond. Quantum. 2018;2:79. [Google Scholar]
  • 3.Harrow AW, Montanaro A. Quantum computational supremacy. Nature. 2017;549:203–209. doi: 10.1038/nature23458. [DOI] [PubMed] [Google Scholar]
  • 4.Aaronson, S. & Chen, L. Complexity-theoretic foundations of quantum supremacy experiments. In Proceedings of the 32nd Computational Complexity Conference, CCC’17, 22:1–22:67 (2017).
  • 5.Farhi, E., Goldstone, J., Gutmann, S. & Neven, H. Quantum algorithms for fixed qubit architectures. arXiv:1703.06199v1 (2017).
  • 6.Farhi, E., Goldstone, J., Gutmann, S. & Zhou, L. The quantum approximate optimization algorithm and the Sherrington–Kirkpatrick model at infinite size. arXiv:1910.08187 (2019).
  • 7.Farhi, E., Gamarnik, D. & Gutmann, S. The quantum approximate optimization algorithm needs to see the whole graph: a typical case. arXiv:2004.09002v1 (2020).
  • 8.Alexeev, Y. et al. Quantum computer systems for scientific discovery. arXiv:1912.07577 (2019).
  • 9.Loncar, M. et al. Development of quantum interconnects for next-generation information technologies. arXiv:1912.06642 (2019).
  • 10.Foxen, B. et al. Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms. arXiv:2001.08343 (2020). [DOI] [PubMed]
  • 11.Ajagekar A, Humble T, You F. Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems. Comput. Chem. Eng. 2020;132:106630. [Google Scholar]
  • 12.Ajagekar A, You F. Quantum computing for energy systems optimization: challenges and opportunities. Energy. 2019;179:76–89. [Google Scholar]
  • 13.Harrigan, M. et al. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. arXiv:2004.04197v1 (2020).
  • 14.Rubin, N. et al. Hartree–Fock on a superconducting qubit quantum computer. arXiv:2004.04174v1 (2020). [DOI] [PubMed]
  • 15.Lloyd, S. Quantum approximate optimization is computationally universal. arXiv:1812.11075 (2018).
  • 16.Sax, I. et al. Approximate approximation on a quantum annealer. arXiv:2004.09267 (2020).
  • 17.Brown KA, Roser T. Towards storage rings as quantum computers. Phys. Rev. Accel. Beams. 2020;23:054701. [Google Scholar]
  • 18.Farhi, E. & Neven, H. Classification with quantum neural networks on near term processors. arXiv:1802.06002v1 (2018).
  • 19.Pirandola S, Braunstein SL. Unite to build a quantum Internet. Nature. 2016;532:169–171. doi: 10.1038/532169a. [DOI] [PubMed] [Google Scholar]
  • 20.Pirandola S. End-to-end capacities of a quantum communication network. Commun. Phys. 2019;2:51. [Google Scholar]
  • 21.Wehner S, Elkouss D, Hanson R. Quantum internet: a vision for the road ahead. Science. 2018;362:6412. doi: 10.1126/science.aam9288. [DOI] [PubMed] [Google Scholar]
  • 22.Pirandola S, Laurenza R, Ottaviani C, Banchi L. Fundamental limits of repeaterless quantum communications. Nat. Commun. 2017;8:15043. doi: 10.1038/ncomms15043. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 23.Pirandola S, Braunstein SL, Laurenza R, Ottaviani C, Cope TPW, Spedalieri G, Banchi L. Theory of channel simulation and bounds for private communication. Quantum Sci. Technol. 2018;3:035009. [Google Scholar]
  • 24.Pirandola S. Bounds for multi-end communication over quantum networks. Quantum Sci. Technol. 2019;4:045006. [Google Scholar]
  • 25.Pirandola, S. Capacities of repeater-assisted quantum communications. arXiv:1601.00966 (2016).
  • 26.Pirandola, S. et al. Advances in quantum cryptography. arXiv:1906.01645 (2019).
  • 27.Laurenza R, Pirandola S. General bounds for sender–receiver capacities in multipoint quantum communications. Phys. Rev. A. 2017;96:032318. [Google Scholar]
  • 28.Van Meter R. Quantum Networking. New York: Wiley; 2014. [Google Scholar]
  • 29.Kimble HJ. The quantum internet. Nature. 2008;453:1023–1030. doi: 10.1038/nature07127. [DOI] [PubMed] [Google Scholar]
  • 30.Lloyd S, Shapiro JH, Wong FNC, Kumar P, Shahriar SM, Yuen HP. Infrastructure for the quantum internet. ACM SIGCOMM Comput. Commun. Rev. 2004;34:9–20. [Google Scholar]
  • 31.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. 10.1117/12.2288707 (2018).
  • 32.Gyongyosi, L. & Imre,. Topology adaption for the quantum Internet. Quantum Inf. Process.. 10.1007/s11128-018-2064-x (2018).
  • 33.Gyongyosi, L. & Imre, S. Entanglement access control for the quantum Internet. Quantum Inf. Process.. 10.1007/s11128-019-2226-5 (2019).
  • 34.Gyongyosi, L. & Imre, S. Opportunistic entanglement distribution for the quantum Internet. Sci. Rep.. 10.1038/s41598-019-38495-w (2019). [DOI] [PMC free article] [PubMed]
  • 35.Gyongyosi, L. & Imre, S. Adaptive routing for quantum memory failures in the quantum Internet. Quantum Inf. Process.. 10.1007/s11128-018-2153-x (2018).
  • 36.Gyongyosi, L. & Imre, S. Entanglement-gradient routing for quantum networks. Sci. Rep.. 10.1038/s41598-017-14394-w (2017). [DOI] [PMC free article] [PubMed]
  • 37.Gyongyosi L, Bacsardi L, Imre S. A survey on quantum key distribution. Infocom. J. 2019;XI(2):14–21. [Google Scholar]
  • 38.Liao S-K, et al. Satellite-to-ground quantum key distribution. Nature. 2017;549:43–47. doi: 10.1038/nature23655. [DOI] [PubMed] [Google Scholar]
  • 39.Ren J-G, et al. Ground-to-satellite quantum teleportation. Nature. 2017;549:70–73. doi: 10.1038/nature23675. [DOI] [PubMed] [Google Scholar]
  • 40.Hensen, B. et al. Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres. Nature526, 682–686 (2015). [DOI] [PubMed]
  • 41.Hucul, D. et al. Modular entanglement of atomic qubits using photons and phonons. Nat. Phys.11(1), 37–42 (2015).
  • 42.Noelleke C, et al. Efficient teleportation between remote single-atom quantum memories. Phys. Rev. Lett. 2013;110:140403. doi: 10.1103/PhysRevLett.110.140403. [DOI] [PubMed] [Google Scholar]
  • 43.Imre S, Gyongyosi L. Advanced Quantum Communications—An Engineering Approach. New Jersey: Wiley-IEEE Press; 2013. [Google Scholar]
  • 44.Gyongyosi, L. & Imre, S. Optimizing high-efficiency quantum memory with quantum machine learning for near-term quantum devices. Sci. Rep.. 10.1038/s41598-019-56689-0 (2019). [DOI] [PMC free article] [PubMed]
  • 45.Gyongyosi, L. & Imre, S. Theory of noise-scaled stability bounds and entanglement rate maximization in the quantum Internet. Sci. Rep.. 10.1038/s41598-020-58200-6 (2020). [DOI] [PMC free article] [PubMed]
  • 46.Gyongyosi L, Imre S. Entanglement accessibility measures for the quantum Internet. Quantum Inf. Process. 2020;19:115. doi: 10.1007/s11128-020-2605-y. [DOI] [Google Scholar]
  • 47.Gyongyosi L, Imre S. Entanglement concentration service for the quantum Internet. Quantum Inf. Process. 2020;19:221. doi: 10.1007/s11128-020-02716-3. [DOI] [Google Scholar]
  • 48.Van Meter R, Ladd TD, Munro WJ, Nemoto K. System design for a long-line quantum repeater. IEEE/ACM Trans. Netw. 2009;17(3):1002–1013. [Google Scholar]
  • 49.Van Meter R, Satoh T, Ladd TD, Munro WJ, Nemoto K. Path selection for quantum repeater networks. Netw. Sci. 2013;3(1–4):82–95. [Google Scholar]
  • 50.Van Meter R, Devitt SJ. Local and distributed quantum computation. IEEE Comput. 2016;49(9):31–42. [Google Scholar]
  • 51.Gyongyosi, L. & Imre, S. Decentralized base-graph routing for the quantum Internet. Phys. Rev. A. 10.1103/PhysRevA.98.022310 (2018).
  • 52.Quantum Internet Research Group (QIRG). https://datatracker.ietf.org/rg/qirg/about/ (2018).
  • 53.Gyongyosi, L. & Imre, S. Multilayer optimization for the quantum Internet. Sci. Rep.. 10.1038/s41598-018-30957-x (2018). [DOI] [PMC free article] [PubMed]
  • 54.Gyongyosi, L. & Imre, S. Entanglement Availability differentiation service for the quantum Internet. Sci. Rep.. 10.1038/s41598-018-28801-3 (2018). [DOI] [PMC free article] [PubMed]
  • 55.Gyongyosi, L. & Imre, S. A survey on quantum computing technology. Comput. Sci. Rev. 10.1016/j.Cosrev.2018.11.002 (2018).
  • 56.Rozpedek F, Schiet T, Thinh L, Elkouss D, Doherty A, Wehner S. Optimizing practical entanglement distillation. Phys. Rev. A. 2018;97:062333. [Google Scholar]
  • 57.Humphreys, P. et al. Deterministic delivery of remote entanglement on a quantum network. Nature558, 268–273 (2018). [DOI] [PubMed]
  • 58.Sangouard N, et al. Quantum repeaters based on atomic ensembles and linear optics. Rev. Mod. Phys. 2011;83:33. [Google Scholar]
  • 59.Cuomo, D., Caleffi, M. & Cacciapuoti, A. S. Towards a distributed quantum computing ecosystem. arXiv:2002.11808v1 (2020).
  • 60.Kok P, Munro WJ, Nemoto K, Ralph TC, Dowling JP, Milburn GJ. Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 2007;79:135–174. [Google Scholar]
  • 61.Petz D. Quantum Information Theory and Quantum Statistics. Heidelberg: Springer; 2008. [Google Scholar]
  • 62.Bacsardi L. On the way to quantum-based satellite communication. IEEE Commun. Mag. 2013;51(08):50–55. [Google Scholar]
  • 63.Biamonte J, et al. Quantum machine learning. Nature. 2017;549:195–202. doi: 10.1038/nature23474. [DOI] [PubMed] [Google Scholar]
  • 64.Lloyd, S., Mohseni, M. & Rebentrost, P. Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411 (2013).
  • 65.Lloyd S, Mohseni M, Rebentrost P. Quantum principal component analysis. Nat. Phys. 2014;10:631. [Google Scholar]
  • 66.Lloyd, S. The universe as quantum computer. In A Computable Universe: Understanding and exploring Nature as computation (ed. Zenil, H.) (World Scientific, Singapore, 2013). arXiv:1312.4455v1.
  • 67.Shor PW. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A. 1995;52:R2493–R2496. doi: 10.1103/physreva.52.r2493. [DOI] [PubMed] [Google Scholar]
  • 68.Chou C, Laurat J, Deng H, Choi KS, de Riedmatten H, Felinto D, Kimble HJ. Functional quantum nodes for entanglement distribution over scalable quantum networks. Science. 2007;316(5829):1316–1320. doi: 10.1126/science.1140300. [DOI] [PubMed] [Google Scholar]
  • 69.Muralidharan S, Kim J, Lutkenhaus N, Lukin MD, Jiang L. Ultrafast and fault-tolerant quantum communication across long distances. Phys. Rev. Lett. 2014;112:250501. doi: 10.1103/PhysRevLett.112.250501. [DOI] [PubMed] [Google Scholar]
  • 70.Yuan Z, Chen Y, Zhao B, Chen S, Schmiedmayer J, Pan JW. Experimental demonstration of a BDCZ quantum repeater node. Nature. 2008;454:1098–1101. doi: 10.1038/nature07241. [DOI] [PubMed] [Google Scholar]
  • 71.Kobayashi, H., Le Gall, F., Nishimura, H. & Rotteler, M. General scheme for perfect quantum network coding with free classical communication. In Lecture Notes in Computer Science. Automata, Languages and Programming SE-52, Vol. 5555, 622–633 (Springer, 2009).
  • 72.Hayashi M. Prior entanglement between senders enables perfect quantum network coding with modification. Phys. Rev. A. 2007;76:040301(R). [Google Scholar]
  • 73.Hayashi, M., Iwama, K., Nishimura, H., Raymond, R. & Yamashita, S, Quantum network coding. In Lecture Notes in Computer Science. STACS 2007 SE52, Vol. 4393 (eds. Thomas, W. et al.) (Springer, Berlin, 2007).
  • 74.Chen L, Hayashi M. Multicopy and stochastic transformation of multipartite pure states. Phys. Rev. A. 2011;83(2):022331. [Google Scholar]
  • 75.Schoute, E., Mancinska, L., Islam, T., Kerenidis, I. & Wehner, S. Shortcuts to quantum network routing. arXiv:1610.05238 (2016).
  • 76.Ahmadzadegan, A. Learning to utilize correlated auxiliary classical or quantum noise. arXiv:2006.04863v1 (2020).
  • 77.Briegel HJ, Dur W, Cirac JI, Zoller P. Quantum repeaters: the role of imperfect local operations in quantum communication. Phys. Rev. Lett. 1998;81:5932–5935. [Google Scholar]
  • 78.Dur W, Briegel HJ, Cirac JI, Zoller P. Quantum repeaters based on entanglement purification. Phys. Rev. A. 1999;59:169–181. [Google Scholar]
  • 79.Van Loock P, Ladd TD, Sanaka K, Yamaguchi F, Nemoto K, Munro WJ, Yamamoto Y. Hybrid quantum repeater using bright coherent light. Phys. Rev. Lett. 2006;96:240501. doi: 10.1103/PhysRevLett.96.240501. [DOI] [PubMed] [Google Scholar]
  • 80.Simon C, de Riedmatten H, Afzelius M, Sangouard N, Zbinden H, Gisin N. Quantum repeaters with photon pair sources and multimode memories. Phys. Rev. Lett. 2007;98:190503. doi: 10.1103/PhysRevLett.98.190503. [DOI] [PubMed] [Google Scholar]
  • 81.Sangouard N, Dubessy R, Simon C. Quantum repeaters based on single trapped ions. Phys. Rev. A. 2009;79:042340. [Google Scholar]
  • 82.Azuma K, Tamaki K, Lo H-K. All-photonic quantum repeaters. Nat. Commun. 2015;6:6787. doi: 10.1038/ncomms7787. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 83.Gyongyosi, L. & Imre, S. Training optimization for gate-model quantum neural networks. Sci. Rep.. 10.1038/s41598-019-48892-w (2019). [DOI] [PMC free article] [PubMed]
  • 84.Gyongyosi, L. & Imre, S. Dense quantum measurement theory. Sci. Rep.. 10.1038/s41598-019-43250-2 (2019). [DOI] [PMC free article] [PubMed]
  • 85.Gyongyosi, L. & Imre, S. State stabilization for gate-model quantum computers. Quantum Inf. Process.. 10.1007/s11128-019-2397-0 (2019).
  • 86.Gyongyosi, L. & Imre, S. Quantum circuit design for objective function maximization in gate-model quantum computers. Quantum Inf. Process.. 10.1007/s11128-019-2326-2 (2019).
  • 87.Caleffi, M. End-to-end entanglement rate: toward a quantum route metric, 2017 IEEE Globecom. 10.1109/GLOCOMW.2017.8269080 (2018).
  • 88.Caleffi, M. Optimal routing for quantum networks. IEEE Access. 10.1109/ACCESS.2017.2763325 (2017).
  • 89.Caleffi, M., Cacciapuoti, A. S. & Bianchi, G. Quantum Internet: from communication to distributed computing. arXiv:1805.04360 (2018).
  • 90.Castelvecchi, D. The quantum Internet has arrived. Nature. News and Comment. https://www.nature.com/articles/d41586-018-01835-3 (2018). [DOI] [PubMed]
  • 91.Cacciapuoti, A. S. et al. Quantum Internet: networking challenges in distributed quantum computing. arXiv:1810.08421 (2018).
  • 92.Chakraborty, K., Rozpedeky, F., Dahlbergz, A. & Wehner, S. Distributed routing in a quantum Internet. arXiv:1907.11630v1 (2019).
  • 93.Khatri S, Matyas CT, Siddiqui AU, Dowling JP. Practical figures of merit and thresholds for entanglement distribution in quantum networks. Phys. Rev. Res. 2019;1:023032. [Google Scholar]
  • 94.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).
  • 95.Pathumsoot P, Matsuo T, Satoh T, Hajdusek M, Suwanna S, Van Meter R. Modeling of measurement-based quantum network coding on IBMQ devices. Phys. Rev. A. 2020;101:052301. [Google Scholar]
  • 96.Pal, S., Batra, P., Paterek, T. & Mahesh, T. S. Experimental localisation of quantum entanglement through monitored classical mediator. arXiv:1909.11030v1 (2019).
  • 97.Miguel-Ramiro, J. & Dur, W. Delocalized information in quantum networks. New J. Phys. 10.1088/1367-2630/ab784d (2020).
  • 98.Miguel-Ramiro, J., Pirker, A. & Dur, W. Genuine quantum networks: superposed tasks and addressing. arXiv:2005.00020v1 (2020).
  • 99.Pirker, A. & Dur, W. A quantum network stack and protocols for reliable entanglement-based networks. arXiv:1810.03556v1 (2018).
  • 100.Shannon, K., Towe, E. & Tonguz, O. On the use of quantum entanglement in secure communications: a survey. arXiv:2003.07907 (2020).
  • 101.Amoretti, M. & Carretta, S. Entanglement verification in quantum networks with tampered nodes. IEEE J. Sel. Areas Commun.. 10.1109/JSAC.2020.2967955 (2020).
  • 102.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.. 10.1109/TNSM.2020.2964003 (2020).
  • 103.Cao, Y. et al. Key as a service (KaaS) over quantum key distribution (QKD)-integrated optical networks. IEEE Commun. Mag.. 10.1109/MCOM.2019.1701375 (2019).
  • 104.Liu, Y. Preliminary study of connectivity for quantum key distribution network. arXiv:2004.11374v1 (2020).
  • 105.Amer, O., Krawec, W. O. & Wang, B. Efficient routing for quantum key distribution networks. arXiv:2005.12404 (2020).
  • 106.Chai, G. et al. Blind channel estimation for continuous-variable quantum key distribution, Quantum Eng.10.1002/que2.37 (2020).
  • 107.Sun, F. Performance analysis of quantum channels, Quantum Eng.10.1002/que2.35 (2020).
  • 108.Krisnanda T, et al. Probing quantum features of photosynthetic organisms. NPJ Quantum Inf. 2018;4:60. [Google Scholar]
  • 109.Krisnanda T, et al. Revealing nonclassicality of inaccessible objects. Phys. Rev. Lett. 2017;119:120402. doi: 10.1103/PhysRevLett.119.120402. [DOI] [PubMed] [Google Scholar]
  • 110.Greenberger, D. M., Horne, M. A. & Zeilinger, A. Going beyond Bell’s theorem. arXiv:0712.0921 (2007).
  • 111.Gyongyosi L, Imre S. Routing space exploration for scalable routing in the quantum internet. Sci. Rep. 2020 doi: 10.1038/s41598-020-68354-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 112.Lloyd, S. & Weedbrook, C. Quantum generative adversarial learning. Phys. Rev. Lett.121. arXiv:1804.09139 (2018). [DOI] [PubMed]
  • 113.Gisin N, Thew R. Quantum communication. Nat. Photon. 2007;1:165–171. [Google Scholar]
  • 114.Xiao YF, Gong Q. Optical microcavity: from fundamental physics to functional photonics devices. Sci. Bull. 2016;61:185–186. [Google Scholar]
  • 115.Zhang W, et al. Quantum secure direct communication with quantum memory. Phys. Rev. Lett. 2017;118:220501. doi: 10.1103/PhysRevLett.118.220501. [DOI] [PubMed] [Google Scholar]
  • 116.Enk SJ, Cirac JI, Zoller P. Photonic channels for quantum communication. Science. 1998;279:205–208. doi: 10.1126/science.279.5348.205. [DOI] [PubMed] [Google Scholar]
  • 117.Duan LM, Lukin MD, Cirac JI, Zoller P. Long-distance quantum communication with atomic ensembles and linear optics. Nature. 2001;414:413–418. doi: 10.1038/35106500. [DOI] [PubMed] [Google Scholar]
  • 118.Zhao B, Chen ZB, Chen YA, Schmiedmayer J, Pan JW. Robust creation of entanglement between remote memory qubits. Phys. Rev. Lett. 2007;98:240502. doi: 10.1103/PhysRevLett.98.240502. [DOI] [PubMed] [Google Scholar]
  • 119.Goebel AM, Wagenknecht G, Zhang Q, Chen Y, Chen K, Schmiedmayer J, Pan JW. Multistage entanglement swapping. Phys. Rev. Lett. 2008;101:080403. doi: 10.1103/PhysRevLett.101.080403. [DOI] [PubMed] [Google Scholar]
  • 120.Tittel W, Afzelius M, Chaneliere T, Cone RL, Kroll S, Moiseev SA, Sellars M. Photon-echo quantum memory in solid state systems. Laser Photon. Rev. 2009;4:244–267. [Google Scholar]
  • 121.Dur W, Briegel HJ. Entanglement purification and quantum error correction. Rep. Prog. Phys. 2007;70:1381–1424. [Google Scholar]
  • 122.Sheng YB, Zhou L. Distributed secure quantum machine learning. Sci. Bull. 2017;62:1025–1019. doi: 10.1016/j.scib.2017.06.007. [DOI] [PubMed] [Google Scholar]
  • 123.Leung D, Oppenheim J, Winter A. Quantum network communication: the butterfly and beyond. IEEE Trans. Inf. Theory. 2010;56:3478–3490. [Google Scholar]
  • 124.Kobayashi, H., Le Gall, F., Nishimura, H. & Rotteler, M. Perfect quantum network communication protocol based on classical network coding. In Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT), 2686–2690 (2010).
  • 125.Nagy, P. Thermodynamics of society. In Proceedings of GAMF, Vol. 12 (1995).
  • 126.Katz A. Principles of Statistical Mechanics (The Information Theory Approach) London: Freeman; 1967. [Google Scholar]
  • 127.Mouritsen OG. Computer Studies of Phase Transitions and Critical Phenomena. Heidelberg: Springer; 1984. [Google Scholar]
  • 128.Gyongyosi, L., Imre, S. & Nguyen, H. V. A survey on quantum channel capacities. IEEE Commun. Surv. Tutorials. 10.1109/COMST.2017.2786748 (2018).
  • 129.Moran MJ, Shapiro HN. Fundamentals of Engineering Thermodynamics. 3rd ed. New York: Wiley; 1996. [Google Scholar]
  • 130.Callen HB. Thermodynamics and an Introduction to Thermostatistics. 2nd ed. New York: Wiley; 1985. [Google Scholar]
  • 131.Alberty RA. Use of Legendre transforms in chemical thermodynamics. Pure Appl. Chem. 2001;73(8):1349–1380. doi: 10.1351/pac200173081349. [DOI] [Google Scholar]
  • 132.Shavit, A. & Gutfinger, C. Thermodynamics, From Concepts to Applications 2nd ed. (CRC Press, Boca Raton, 2009) (ISBN 978-1-420-07368-3).
  • 133.Nash, L. K. Elements of Statistical Thermodynamics. Principles of Chemistry 2nd ed. (Addison-Wesley, Boston, 1974) (ISBN 0-201-05229-6).
  • 134.Mandl, F. Statistical Physics. Manchester Physics 2nd ed. (Wiley, New York, 2008) (ISBN 978-0-471-56658-8).
  • 135.Ives, D. J. G. Chemical Thermodynamics. University Chemistry (Macdonald Technical and Scientific, 1971) (ISBN 0-356-03736-3).
  • 136.Evans, D. J., Searles, D. J. & Mittag, E. Fluctuation theorem for Hamiltonian systems–Le Chatelier’s principle. Phys. Rev. E63, 051105(4) (2001). [DOI] [PubMed]
  • 137.Tatsuo, H. Le Chatelier principle. In The New Palgrave: A Dictionary of Economics, Vol. 3, 155–57 (1987).
  • 138.Deutsch D, et al. Quantum privacy amplification and the security of quantum cryptography over noisy channels. Phys. Rev. Lett. 1996;77:2818. doi: 10.1103/PhysRevLett.77.2818. [DOI] [PubMed] [Google Scholar]
  • 139.Bennett CH, et al. Purification of noisy entanglement and faithful teleportation via noisy channels. Phys. Rev. Lett. 1996;76:722. doi: 10.1103/PhysRevLett.76.722. [DOI] [PubMed] [Google Scholar]
  • 140.Bennett CH, et al. Mixed-state entanglement and quantum error correction. Phys. Rev. A. 1996;54:3824. doi: 10.1103/physreva.54.3824. [DOI] [PubMed] [Google Scholar]
  • 141.Aida M, Takano C, Murata M. Oscillation model for describing network dynamics caused by asymmetric node interaction. IEICE Trans. Commun. 2018;E101.B(1):123–136. [Google Scholar]
  • 142.Chung, F. R. K. Lectures on spectral graph theory. In CBMS Lecture Notes (AMS Publications, Providence, 1995).
  • 143.Spielman, D. Spectral graph theory. In Combinatorial Scientific Computing (eds. Naumann, U. et al.) 495–524 (CRC, Boca Raton, 2012).
  • 144.Newman, M. E. J. The graph Laplacian. In Networks: An Introduction, Section 6.13, 152–157 (Oxford University Press, 2010).
  • 145.Gyongyosi, L. Services for the Quantum Internet. DSc Dissertation, Hungarian Academy of Sciences (MTA) (2020).
  • 146.Lloyd S. Capacity of the noisy quantum channel. Phys. Rev. A. 1997;55:1613–1622. [Google Scholar]
  • 147.Toda M, Kubo R, Saito N. Statistical Physics I: Equilibrium Statistical Mechanics. Berlin: Springer; 1992. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Data Availability Statement

This work does not have any experimental data.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES