Have a personal or library account? Click to login
Entanglement Percolation in Two Types of Irregular Quantum Networks Cover

Entanglement Percolation in Two Types of Irregular Quantum Networks

By: Liuxia Han,  Yaqi Zhao and  Kan He  
Open Access
|Jan 2025

Figures & Tables

Figure 1.

Four examples of regular networks. (a) Bethe lattice. (b) Square lattice. (c) Honeycomb lattice. (d) Triangular lattice.
Four examples of regular networks. (a) Bethe lattice. (b) Square lattice. (c) Honeycomb lattice. (d) Triangular lattice.

Figure 2.

Different QN topologies between A and B. (a) Simple series QN. (b) Simple parallel QN. (c) Parallel-then-series QN. (d) Series-then-parallel QN. (e) Series-parallel QN. (f) General QN.
Different QN topologies between A and B. (a) Simple series QN. (b) Simple parallel QN. (c) Parallel-then-series QN. (d) Series-then-parallel QN. (e) Series-parallel QN. (f) General QN.

Figure 3.

SM transform. The left network becomes the right one after removing node R through the SM transform.
SM transform. The left network becomes the right one after removing node R through the SM transform.

Figure 4.

Process of the entanglement transmission on a butterfly network. (a) The initial butterfly network. (b) The butterfly network after removing node 1 through SM transform. (c) The butterfly network after removing nodes 2 and 3 in Fig. (b). (d) The butterfly network after removing node 4 in Fig. (c) through SM transform. (e) The butterfly network after removing node 5 in Fig. (d) by performing series-parallel operations. Here, links with varying line colors denote the weights of the connections, which correspond to the degree of concurrence between the two nodes.
Process of the entanglement transmission on a butterfly network. (a) The initial butterfly network. (b) The butterfly network after removing node 1 through SM transform. (c) The butterfly network after removing nodes 2 and 3 in Fig. (b). (d) The butterfly network after removing node 4 in Fig. (c) through SM transform. (e) The butterfly network after removing node 5 in Fig. (d) by performing series-parallel operations. Here, links with varying line colors denote the weights of the connections, which correspond to the degree of concurrence between the two nodes.

Figure 5.

The scatter plot of c and CSC in the butterfly network under the ConPT. The black scatter plot represents the relationship graph between c and CSC, the red dashed line is the entanglement percolation threshold cth and the blue dashed line is the saturation point csat under the concurrence percolation.
The scatter plot of c and CSC in the butterfly network under the ConPT. The black scatter plot represents the relationship graph between c and CSC, the red dashed line is the entanglement percolation threshold cth and the blue dashed line is the saturation point csat under the concurrence percolation.

Figure 6.

Comparison of 



PSCConPT
P_{SC}^{{\rm{ConPT}}}


 and PSC in the butterfly network. The orange scatter plot represents the relationship graph between c and PSC, the purple scatter plot also represents the relationship graph between c and 



PSCConPT
P_{SC}^{\rm{ConPT}}


.
Comparison of PSCConPT P_{SC}^{{\rm{ConPT}}} and PSC in the butterfly network. The orange scatter plot represents the relationship graph between c and PSC, the purple scatter plot also represents the relationship graph between c and PSCConPT P_{SC}^{\rm{ConPT}} .

Figure 7.

Parallel-then-series QN network.
Parallel-then-series QN network.

Figure 8.

The scatter plot of c and CSC in the parallel-then-series network under conditions ki = 3 and i = 5. The black scatter plot represents the relationship graph between c and CSC, the red dashed line is the entanglement percolation threshold cth and the blue dashed line is the saturation point csat under the concurrence percolation.
The scatter plot of c and CSC in the parallel-then-series network under conditions ki = 3 and i = 5. The black scatter plot represents the relationship graph between c and CSC, the red dashed line is the entanglement percolation threshold cth and the blue dashed line is the saturation point csat under the concurrence percolation.

Figure 9.

Comparison of 



PSCConPT
P_{SC}^{\rm{ConPT}}


 and PSC in the parallel-then-series network under conditions ki = 3 and i = 5. The orange scatter plot represents the relationship graph between c and PSC, the purple scatter plot also represents the relationship graph between c and 



PSCConPT
P_{SC}^{\rm{ConPT}}


.
Comparison of PSCConPT P_{SC}^{\rm{ConPT}} and PSC in the parallel-then-series network under conditions ki = 3 and i = 5. The orange scatter plot represents the relationship graph between c and PSC, the purple scatter plot also represents the relationship graph between c and PSCConPT P_{SC}^{\rm{ConPT}} .

Connectivity rules of CEP_

CEP
Series rulep = p1p2
Parallel rule1 − p = (1 − p1)(1 − p2) ⋯

The data supporting the Figure 8 and the Figure 9 for the parallel-then-series network under conditions ki = 3 and i = 5_

cCSC 2CSCc2 {{{\partial^2}{C_{SC}}} \over {\partial {c^2}}} PSC 2PSCc2 {{{\partial^2}{P_{SC}}} \over {\partial {c^2}}} PSCConPT P_{SC}^{\rm{ConPT}}
0.600.55512.81570.02774.63010.168216
0.620.61420.43450.03695.64870.210849
0.640.6734−2.28990.04876.79740.260721
0.660.7317−5.34030.06348.06770.318373
0.680.7878−8.68930.08169.44160.384068
0.700.8405−12.29920.103910.890.458188
0.720.8882−16.12060.130812.36980.540542
0.740.9294−20.09260.16313.8210.630925
0.760.9627−24.14250.20115.16450.729428
0.780.9863−28.18610.245216.2980.835038
0.800.9986−32.12890.296217.09340.947103
0.821−36.15670.354117.39191
0.841−40.12380.418916.99941
0.921−55.78570.73312.7451
0.941−59.72850.8166−6.41831
0.961−63.67130.895−20.0641

The data supporting the Figure 5 and the Figure 6 in the butterfly network_

cCSC 2CSCc2 {{{\partial^2}{C_{SC}}} \over {\partial {c^2}}} PSC 2PSCc2 {{{\partial^2}{P_{SC}}} \over {\partial {c^2}}} PSCConPT P_{SC}^{\rm{ConPT}}
0.660.5436782140.00130.05982517.19320.160706
0.680.5843457880.00060.07332719.17720.188495
0.700.6263473480.00040.089587910.33250.220455
0.720.668926005−0.00050.10872611.71000.256671
0.740.711917832−0.000386940.13153513.67250.297737
0.760.754400424−0.00140.15847715.36250.343585
0.780.796496077−0.00210.19010317.70750.395356
0.920.99929325−0.00690.60555520.23000.962410
0.941−0.00940.6998149.12001
0.961−0.00940.802165−35.40751

Connectivity rules of ConPT_

ConPT
Series ruleC = c1 c2
Parallel rule 1+1C22=max12,1+1c1221+1c222 {{1 + \sqrt {1 - {C^2}}} \over 2} = \max \left\{{{1 \over 2},{{1 + \sqrt {1 - c_1^2}} \over 2}{{1 + \sqrt {1 - c_2^2}} \over 2} \ldots} \right\}
DOI: https://doi.org/10.2478/qic-2024-0004 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
Language: English
Page range: 58 - 68
Submitted on: Sep 13, 2024
Accepted on: Dec 8, 2024
Published on: Jan 9, 2025
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2025 Liuxia Han, Yaqi Zhao, Kan He, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.