1 Introduction
In the quantum Internet, the quantum nodes share quantum entanglement among one other, which provides an entangled groundbase network structure for the various quantum networking protocols [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]. In a quantum Internet scenario, the aim of the quantum repeater elements is to extend the range of entanglement through several steps [20, 21, 22, 23, 24, 28, 27, 30, 31, 32, 33, 34, 35, 36]. The available entanglement at the end points has several critical parameters, most importantly the fidelity of the established entanglement (fidelity of entanglement [25, 26]) and the probability of the existence of a given entangled connection [1, 8]. In an experimental setting, these critical parameters are timevarying since the noise of local quantum memories that store the shared entanglement in the quantum nodes evolves over time, and the probability of entangled connections (shared entanglement between a node pair) also changes dynamically [1, 5, 6, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 37].
In the quantum Internet, several entangled paths (paths formulated by several entangled connections) could exist between a given sourcetarget quantum node pair [1, 5, 6, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64]. This fact allows us to introduce a method that utilizes this multipath property to change these critical parameters via the number of entangled paths associated with a given endtoend node pair: the available fidelity of entanglement and the probability of an entangled connection. The model utilizes the reliability (probability) of the entangled connections and the entanglement fidelity coefficient as primary metrics. The decomposition is motivated by the fact that a maximization of the entanglement throughput (number of transmitted Bell states per a given time unit at a particular fidelity) parameter requires also the maximization of the connection probability, and the entanglement fidelity.
In this work, we define a method for entanglement access control in entangled quantum networks. The entanglement differentiation is achieved via a controlled variability of entanglement fidelity and entangled connection probability between source and target quantum nodes in a quantum repeater network. The proposed approach allows us to define different priority levels of entanglement access for the legal users of the quantum network with respect to the number of available paths. The number of available paths injects an additional degree of freedom to the quantum network, allowing for the selection of the entanglement fidelity and connection reliability for the end nodes. In a straightforward application of our method, the highpriority demands are associated with high fidelity and high connection probability in the end nodes of the user, while the lowerpriority users get lower fidelity and lower connection probability in their end nodes. To achieve the differentiation, we define the appropriate cost and path cost functions and the criteria regarding the entanglement fidelity and connection probability for the quantum nodes and entangled connections of the entangled path. The entanglement differentiation utilizes a different number of paths between the source and target nodes allowing a distinction to be made between singlepath and multipath scenarios. In a singlepath setting, only one entangled path exists between source and target nodes, and therefore the fidelity of entanglement and the probability of existence of the entangled connections between the end nodes are determined only by the nodes of the given entangled path. In a multipath scenario, more than one path exists from a source to a target.
In our model, a given criterion regarding the entanglement fidelity of the local nodes has to be satisfied for all node pairs on the path referred to as integrated connection probability and fidelity criterion for all entangled connections of the entangled path. The integrated criterion allows us to reach a given entanglement fidelity and a given connection probability between the end nodes of the quantum network.
Our solution utilizes timevarying parameters since the cost functions deal with the evolution of the entanglement fidelity parameter and the connection probabilities, which evolve over time. We define the entanglement access control algorithm for an arbitrary topology quantum repeater network. We also reveal the computational complexity of the method.
The novel contributions of our manuscript are as follows:

We define a method to achieve controlled entanglement accessibility in the quantum Internet.

The algorithm defines entangled paths between the source and target nodes in function of a particular path cost function.

The path cost is determined by an integrated criterion on the entanglement fidelity and the probability of entangled connection.

The proposed scheme has moderate complexity, providing an efficient entanglement accessibility differentiation, allowing for the construction of different priority levels of entanglement accessibility for users.

The results can be straightforwardly applied in the entangled quantum networks of the quantum Internet.
This paper is organized as follows. In Section 2, the basic components of the model are summarized. In Section 3, the entanglement accessibility methods are discussed. Section 4 proposes the integrated criterion related to entanglement fidelity. Section 5 defines the entanglement access control algorithm. Finally, Section 6 concludes the results.
2 System Model
2.1 Entangled Network
The quantum Internet setting is modeled as follows [8]. Let refer to the nodes of an entangled quantum network , with a transmitter quantum node , a receiver quantum node , and quantum repeater nodes , . Let , , refer to a set of edges between the nodes of , where each identifies an level entangled connection, , between quantum nodes and of edge , respectively. The entanglement levels of the entangled connections in the entangled quantum network structure are defined as follows.
2.1.1 Entanglement Levels in the Quantum Internet
In a quantum Internet setting, an entangled quantum network consists of singlehop and multihop entangled connections, such that the singlehop entangled nodes^{1}^{1}1The level entangled nodes refer to quantum nodes and connected by an entangled connection . are directly connected through an level entanglement, while the multihop entangled nodes communicate through level entanglement. Focusing on the doubling architecture [1, 5, 6] in the entanglement distribution procedure, the number of spanned nodes is doubled in each level of entanglement swapping (entanglement swapping is applied in an intermediate node to create a longer distance entanglement [1]). Therefore, the hop distance in for the level entangled connection between is denoted by [8]
(1) 
with intermediate quantum nodes between and . Therefore, refers to a direct entangled connection between two quantum nodes and without intermediate quantum repeaters, while identifies a multilevel entanglement.
2.1.2 Entanglement Fidelity
Let
(2) 
be the target Bell state subject to be created at the end of the entanglement distribution procedure between a particular source node and receiver node . The entanglement fidelity at an actually created noisy quantum system between and is
(3) 
where is a value between and , for a perfect Bell state and for an imperfect state. The entanglement fidelity represents the accuracy of our information about a quantum state [1, 5, 6]. The fidelity in (3) measures the amount of overlap between the target state (2) and the density matrix that represents our system. In the entanglement distribution procedure, the usage of the entanglement fidelity metric rather than other correlation measure functions (concurrence, negativity, quantum discord, quantum coherent information, etc.) [4] is motivated by the fact that the fidelity of entanglement is an improvable parameter in a practical setting. The improvement of the fidelity is realizable by the socalled entanglement purification process [1]. The entanglement purification takes imperfect entangled states and outputs a higherfidelity entangled system. Without loss of generality, in an experimental quantum Internet setting, an aim is to reach over long distances [1, 5, 6].
2.1.3 Practical Implementation
An experimental quantum network refers to a set of source users (quantum nodes), destination users (quantum nodes), several intermediate quantum repeaters between them, and to a set of physical nodetonode connections between the physical nodes (the physical attributes of the level connections identify the physical attributes of the physical links between the neighboring nodes). A quantum node is a quantum device with internal quantum memory , and with the capability of performing local operations (such as the internal processes connected to entanglement purification, entanglement swapping, error correction, etc.)[28, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64]. In a practical setting, the nodetonode entanglement distribution can be implemented by an optical fiber network or via a wireless optical system (freespace channel [29] or a quantumbased satellite communication channel [30]). A physical link is characterized by a particular link loss . For a standardquality optical fiber , the average link loss is , while the maximum of the tolerable link loss for an optical fiber system is [1, 6].
In an practical entangled quantum network, the level entangled connections refers to the case when the source and target quantum nodes are not directly connected by a physical link, but by an entangled connection that spans several quantum repeaters. An level entangled connection is formulated by several nodetonode interactions through the physical links in the physical layer.
3 Entanglement Access
3.1 Entanglement Fidelity Criterion
First, we characterize the entanglement fidelity criterion for a given node pair. Using the criterion, we then derive the probability of the existence of singlepath and multipath sets with endtoend connectiondisjoint entangled paths [65, 66] between source and target nodes. The endtoend connectiondisjoint entangled paths share no any common entangled connection between a source node and a receiver node .
A given entangled connection is characterized by a particular fidelity
, whose quantity classifies the entangled connection, such that
, where is a critical lower bound on the fidelity of entanglement.Let refer to the entangled connection between a node pair , and let be the difference of the fidelity of entanglement in quantum nodes and , as
(4) 
where is a maximal allowed fidelity distance, , and . Since the entangled connections are assumed to be timevarying in the network [65, 66], the probability that holds at a given time for an entangled connection is as
(5) 
where
is the probability density function of entanglement fidelity distance.
3.1.1 SinglePath Entanglement Accessibility
Let refer to a single path between and , , where is a demand, and are the sender and destination nodes associated with the demand of user , is the number of users. The single entangled path setting means that entanglement can be distributed from to through only one given path in the network . Let it be assumed that consists of entangled connections; then the probability that a given single path exists between and with the fidelity criterion is expressed as
(6) 
3.1.2 Multipath Entanglement Accessibility
Let , , refer to the th multipath between and , which means that entanglement can be distributed from to through a set of endtoend connectiondisjoint entangled paths as in the network . The probability [65] that and share a common entanglement with the fidelity criterion is as
(7) 
where is a path index, and is the number of entangled connections associated with .
Based on the distribution of fidelity distances between the node pairs of the network, the formulas of (6) and (7) can be derived in a more exact form^{2}^{2}2
Assuming an exponential distribution of
, , where is a distribution coefficient, while ..4 Integrated Criterion on Connection Probability and Fidelity
The integrated criterion extends the results of Section 3 to include the criterion on the probability of the existence of a given entangled connection between a node pair of a path. Using the integrated criterion on the connection probability and entanglement fidelity, we derive the probability of existence of singlepath and multipath sets with endtoend connectiondisjoint entangled paths [65] between source and target nodes.
In our model, the fidelity of shared entanglement evolves in time for a given node pair . For each quantum node at a time , let be defined as
(8) 
where is the probability of an level entangled connection with a node determined in node at a time , while is the fidelity of entanglement determined in node at a time .
For a node pair , according to local quantities, the following distance can be defined:
(9) 
where , and are the connection probability quantities determined in nodes and , and the fidelity distance is described by
(10) 
where , and are the fidelity quantities determined in nodes and .
A distance of and for a node pair at a particular time is expressed via , as
(11) 
Since the connection probability and the entanglement fidelity parameters evolve over time, after from an initial time , the quantity of a given node evolves as
(12) 
where is expressed as
(13) 
where is the probability density function of distance function , and and are expressed as the connection probability and entanglement fidelity evolution functions of node .
For a given node pair , the particular upper bound on the maximal allowable distance between and at time leads to a limit while can be referred to as entangled:
(14) 
If exceeds , then the difference of the local entangled connection probabilities and entanglement fidelities are above a critical limit; therefore, the node pair is referred to as unentangled.
Using (11) and (13), (14) can be rewritten as
(15) 
which leads to
(16) 
A representation of and for a node pair is depicted in Fig. 1. The connection probability is assumed to be different in the nodes at a particular time.
4.1 SinglePath Entanglement Accessibility
After these derivations, the probability of a single path in function of the connection probability and entanglement fidelity in the nodes of the path (e.g., connection probability criterion and fidelity criterion for all entangled connections of the path) is as follows.
4.2 Multipath Entanglement Accessibility
For the multipath scenario, (7) can be written via (16) as follows. For a given set of endtoend connectiondisjoint entangled paths expressed as between and , the probability that and share a common entanglement with a connection probability criterion and fidelity criterion at time is expressed as
(19) 
5 Control of Entanglement Access
The entanglement access control algorithm establishes a number of connectiondisjoint entangled paths between a source node and a target node. Changing the number of connectiondisjoint entangled paths allows us to modify both the probability of entanglement between the source and target nodes and the fidelity of available entanglement in the end nodes.
For the algorithm, a cost function [65] of a given entangled connection is defined as
(20) 
where
(21) 
(22) 
and
(23) 
(24) 
Let be the actual quantum repeater network with quantum nodes. A given level entangled connection between a node pair is expressed as .
Let and be the source and target quantum nodes of a demand associated with user . Using (20) and a given entangled path with a set of quantum repeaters , , and a set entangled connections, as
(25) 
the cost of path is defined as
(26) 
The entanglement access control algorithm outputs a set of , which contains the connectiondisjoint entangled paths between and .
In function of , priority classes can be defined for the users of the quantum Internet. A high priority user gets a high value of , while lower priority users get lower values of . The actual value of for a particular user class can be determined in function of the current network conditions.
The steps are given in Algorithm 1.
5.1 Description
A brief description of the entanglement access control algorithm is as follows.
Step 1 sets for a user by the priority class of the user. The determines the available value(s) of for .
In Step 2, entanglement is established between the source node of the given demand of the user and the neighboring quantum repeaters. The relevant metrics quantities are also calculated in this step.
Using the derived quantities of Step 2, in Step 3, the cost paths are derived via (26) using the entangled connection cost formula of (20).
Steps 45 deal with the intermediate quantum repeater nodes associated with the given demand. These steps also ensure that entanglement is distributed through the cheapest path from a source node towards , via a given intermediate repeater node . It is ensured in our model that if the intermediate repeater node also shares entanglement with a quantum repeater , then node will not establish entanglement with , since can be reached via , which is on the cheapest path .
Step 6 outputs the set of endtoend connectiondisjoint entangled paths between and and the path costs for all paths.
Step 7 determines the probability for user via (19), and updates the actual value of if needed.
Finally, Step 8 extends the steps for all users.
In Fig. 2 a multipath entanglement accessibility is depicted in a quantum Internet setting with heterogeneous entanglement levels. The network situation depicts connectiondisjoint entangled paths that share no common entangled connection between a source node and a receiver node . The entangled paths are characterized by the derived formulas.
5.2 Computational Complexity
For a given quantum network with quantum nodes, the computational complexity of the entanglement access control algorithm for a given demand is at most , since the problem is analogous to the establishment of a path by message broadcasting [65].
5.3 Numerical Evidence
We provide a numerical evidence on the distribution of the and path probabilities.
Let us set for the lower bound on the fidelity of entanglement between all node pairs and , , and . Then, the maximal allowed fidelity distance is set as .
Then, let us assume that a single path between and consist of entangled connections with different entanglement levels between the nodes of the path . For the multipath scenario, each entangled path consist of entangled connections with different entanglement levels between the nodes of each entangled path of .
For simplicity let us assume that the number of entangled connections is set as for all entangled paths, and the distribution of the probabilities for the entangled connections of a single path at is as depicted in Fig. 3(a). The distribution of the probabilities for the entangled connections of a multipath with at is distributed as depicted in Fig. 3(b). The resulting and probabilities are depicted in Fig. 3(c).
The numerical analysis revealed that for a single entangled path at the particular connectionlevel values of the path (given in Fig. 3(a)). The multipath setting at connectionlevel values of Fig. 3(b), at doubles the success probability of the single path setting with , while at , the resulting probability is .
6 Conclusions
In this work, we defined a method to achieve entanglement access control in the quantum Internet. The algorithm utilizes different paths between the source and target nodes in function of a particular path cost function. The path cost function uses the local entanglement fidelities of the nodes and the probability of the existence of the entangled connections. Increasing the number of available paths leads to a multipath setting, which allows the parties to establish high fidelity entanglement with reliable entangled connections between the end nodes. The proposed scheme has moderate complexity, and it is particularly convenient for the entangled quantum network structure of the quantum Internet.
Acknowledgements
This work was partially supported by the National Research Development and Innovation Office of Hungary (Project No. 20171.2.1NKP201700001), by the Hungarian Scientific Research Fund  OTKA K112125 and in part by the BME Artificial Intelligence FIKP grant of EMMI (BME FIKPMI/SC).
References
 [1] Van Meter, R. Quantum Networking. ISBN 1118648927, 9781118648926, John Wiley and Sons Ltd (2014).
 [2] Lloyd, S., Shapiro, J. H., Wong, F. N. C., Kumar, P., Shahriar, S. M. and Yuen, H. P. Infrastructure for the quantum Internet. ACM SIGCOMM Computer Communication Review, 34, 9–20 (2004).
 [3] Kimble, H. J. The quantum Internet. Nature, 453:1023–1030 (2008).
 [4] Gyongyosi, L., Imre, S. and Nguyen, H. V. A Survey on Quantum Channel Capacities, IEEE Communications Surveys and Tutorials, doi: 10.1109/COMST.2017.2786748 (2018).
 [5] Van Meter, R., Ladd, T. D., Munro, W. J. and Nemoto, K. System Design for a LongLine Quantum Repeater, IEEE/ACM Transactions on Networking 17(3), 10021013, (2009).
 [6] Van Meter, R., Satoh, T., Ladd, T. D., Munro, W. J. and Nemoto, K. Path selection for quantum repeater networks, Networking Science, Volume 3, Issue 1–4, pp 82–95, (2013).
 [7] Van Meter, R. and Devitt, S. J. Local and Distributed Quantum Computation, IEEE Computer 49(9), 3142 (2016).
 [8] Gyongyosi, L. and Imre, S. Decentralized BaseGraph Routing for the Quantum Internet, Physical Review A, American Physical Society, DOI: 10.1103/PhysRevA.98.022310, https://link. Aps. Org/doi/10.1103/PhysRevA.98.022310, (2018).
 [9] Gyongyosi, L. and Imre, S. Dynamic topology resilience for quantum networks, Proc. SPIE 10547, Advances in Photonics of Quantum Computing, Memory, and Communication XI, 105470Z; doi: 10.1117/12.2288707 (2018).
 [10] Gyongyosi, L. and Imre, S. Topology Adaption for the Quantum Internet, Quantum Information Processing, Springer Nature, DOI: 10.1007/s111280182064x, (2018).
 [11] Gyongyosi, L. and Imre, S. Adaptive Routing for Quantum Memory Failures in the Quantum Internet, Quantum Information Processing, Springer Nature, DOI: 10.1007/s111280182153x, (2018).
 [12] Pirandola, S., Laurenza, R., Ottaviani, C. and Banchi, L. Fundamental limits of repeaterless quantum communications, Nature Communications, 15043, doi:10.1038/ncomms15043 (2017).
 [13] Pirandola, S., Braunstein, S. L., Laurenza, R., Ottaviani, C., Cope, T. P. W., Spedalieri, G. and Banchi, L. Theory of channel simulation and bounds for private communication, Quantum Sci. Technol. 3, 035009 (2018).
 [14] Pirandola, S. Capacities of repeaterassisted quantum communications, arXiv:1601.00966 (2016).
 [15] Laurenza, R. and Pirandola, S. General bounds for senderreceiver capacities in multipoint quantum communications, Phys. Rev. A 96, 032318 (2017).
 [16] Gyongyosi, L. and Imre, S. Multilayer Optimization for the Quantum Internet, Scientific Reports, Nature, DOI:10.1038/s4159801830957x, (2018).
 [17] Gyongyosi, L. and Imre, S. Entanglement Availability Differentiation Service for the Quantum Internet, Scientific Reports, Nature, (DOI:10.1038/s41598018288013), https://www.nature.com/articles/s41598018288013, (2018).
 [18] Gyongyosi, L. and Imre, S. EntanglementGradient Routing for Quantum Networks, Scientific Reports, Nature, (DOI:10.1038/s4159801714394w), https://www.nature.com/articles/s4159801714394w, (2017).
 [19] Imre, S. and Gyongyosi, L. Advanced Quantum Communications  An Engineering Approach. New Jersey, WileyIEEE Press (2013).
 [20] Caleffi, M. EndtoEnd Entanglement Rate: Toward a Quantum Route Metric, 2017 IEEE Globecom, DOI: 10.1109/GLOCOMW.2017.8269080, (2018).
 [21] Caleffi, M. Optimal Routing for Quantum Networks, IEEE Access, Vol 5, DOI: 10.1109/ACCESS.2017.2763325 (2017).
 [22] Caleffi, M., Cacciapuoti, A. S. and Bianchi, G. Quantum Internet: from Communication to Distributed Computing, aXiv:1805.04360 (2018).
 [23] Castelvecchi, D. The quantum internet has arrived, Nature, News and Comment, https://www.nature.com/articles/d41586018018353, (2018).
 [24] Cacciapuoti, A. S., Caleffi, M., Tafuri, F., Cataliotti, F. S., Gherardini, S. and Bianchi, G. Quantum Internet: Networking Challenges in Distributed Quantum Computing, arXiv:1810.08421 (2018).
 [25] Nielsen, M. A. The entanglement fidelity and quantum error correction, arXiv:quantph/9606012 (1996).
 [26] Schumacher, B. Sending quantum entanglement through noisy channels, Phys Rev A. 54(4), 26142628 (1996).
 [27] Petz, D. Quantum Information Theory and Quantum Statistics, SpringerVerlag, Heidelberg, Hiv: 6. (2008).

[28]
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P. and Milburn, G. J., Linear optical quantum computing with photonic qubits,
Rev. Mod. Phys. 79, 135174 (2007).  [29] Fedrizzi, A., Ursin, R., Herbst, T., Nespoli, M., Prevedel, R., Scheidl, T., Tiefenbacher, F., Jennewein, T. and Zeilinger, A. Highfidelity transmission of entanglement over a highloss freespace channel, Nature Physics, 5(6):389–392, (2009).
 [30] Bacsardi, L. On the Way to QuantumBased Satellite Communication, IEEE Comm. Mag. 51:(08) pp. 5055. (2013).

[31]
Biamonte, J. et al. Quantum Machine Learning.
Nature, 549, 195202 (2017).  [32] Lloyd, S., Mohseni, M. and Rebentrost, P. Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411 (2013).

[33]
Lloyd, S., Mohseni, M. and Rebentrost, P. Quantum principal component analysis.
Nature Physics, 10, 631 (2014).  [34] Lloyd, S. Capacity of the noisy quantum channel. Physical Rev. A, 55:1613–1622 (1997).
 [35] Lloyd, S. The Universe as Quantum Computer, A Computable Universe: Understanding and exploring Nature as computation, Zenil, H. ed., World Scientific, Singapore, arXiv:1312.4455v1 (2013).
 [36] Shor, P. W. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A, 52, R2493R2496 (1995).
 [37] Shor, P. W. Faulttolerant quantum computation, 37th Symposium on Foundations of Computing, IEEE Computer Society Press, pp. 5665 (1996).
 [38] Chou, C., Laurat, J., Deng, H., Choi, K. S., de Riedmatten, H., Felinto, D. and Kimble, H. J. Functional quantum nodes for entanglement distribution over scalable quantum networks. Science, 316(5829):1316–1320 (2007).
 [39] Muralidharan, S., Kim, J., Lutkenhaus, N., Lukin, M. D. and Jiang. L. Ultrafast and FaultTolerant Quantum Communication across Long Distances, Phys. Rev. Lett. 112, 250501 (2014).
 [40] Yuan, Z., Chen, Y., Zhao, B., Chen, S., Schmiedmayer, J. and Pan, J. W. Experimental Demonstration of a BDCZ Quantum Repeater Node, Nature 454, 10981101 (2008).
 [41] Kobayashi, H., Le Gall, F., Nishimura, H. and Rotteler, M. General scheme for perfect quantum network coding with free classical communication, Lecture Notes in Computer Science (Automata, Languages and Programming SE52 vol. 5555), Springer) pp 622633 (2009).
 [42] Hayashi, M. Prior entanglement between senders enables perfect quantum network coding with modification, Physical Review A, Vol.76, 040301(R) (2007).
 [43] Hayashi, M., Iwama, K., Nishimura, H., Raymond, R. and Yamashita, S, Quantum network coding, Lecture Notes in Computer Science (STACS 2007 SE52 vol. 4393) ed Thomas, W. and Weil, P. (Berlin Heidelberg: Springer) (2007).
 [44] Chen, L. and Hayashi, M. Multicopy and stochastic transformation of multipartite pure states, Physical Review A, Vol.83, No.2, 022331, (2011).
 [45] Schoute, E., Mancinska, L., Islam, T., Kerenidis, I. and Wehner, S. Shortcuts to quantum network routing, arXiv:1610.05238 (2016).
 [46] Lloyd, S. and Weedbrook, C. Quantum generative adversarial learning. Phys. Rev. Lett., 121, arXiv:1804.09139 (2018).
 [47] Gisin, N. and Thew, R. Quantum Communication. Nature Photon. 1, 165171 (2007).
 [48] Xiao, Y. F., Gong, Q. Optical microcavity: from fundamental physics to functional photonics devices. Science Bulletin, 61, 185186 (2016).
 [49] Zhang, W. et al. Quantum Secure Direct Communication with Quantum Memory. Phys. Rev. Lett. 118, 220501 (2017).
 [50] Gyongyosi, L. and Imre, S. A Survey on Quantum Computing Technology, Computer Science Review, Elsevier, DOI: 10.1016/j.Cosrev.2018.11.002, ISSN: 15740137 (2018).
 [51] Enk, S. J., Cirac, J. I. and Zoller, P. Photonic channels for quantum communication. Science, 279, 205208 (1998).
 [52] Briegel, H. J., Dur, W., Cirac, J. I. and Zoller, P. Quantum repeaters: the role of imperfect local operations in quantum communication. Phys. Rev. Lett. 81, 59325935 (1998).
 [53] Dur, W., Briegel, H. J., Cirac, J. I. and Zoller, P. Quantum repeaters based on entanglement purification. Phys. Rev. A, 59, 169181 (1999).
 [54] Duan, L. M., Lukin, M. D., Cirac, J. I. and Zoller, P. Longdistance quantum communication with atomic ensembles and linear optics. Nature, 414, 413418 (2001).
 [55] Van Loock, P., Ladd, T. D., Sanaka, K., Yamaguchi, F., Nemoto, K., Munro, W. J. and Yamamoto, Y. Hybrid quantum repeater using bright coherent light. Phys. Rev. Lett., 96, 240501 (2006).
 [56] Zhao, B., Chen, Z. B., Chen, Y. A., Schmiedmayer, J. and Pan, J. W. Robust creation of entanglement between remote memory qubits. Phys. Rev. Lett. 98, 240502 (2007).
 [57] Goebel, A. M., Wagenknecht, G., Zhang, Q., Chen, Y., Chen, K., Schmiedmayer, J. and Pan, J. W. Multistage Entanglement Swapping. Phys. Rev. Lett. 101, 080403 (2008).
 [58] Simon, C., de Riedmatten, H., Afzelius, M., Sangouard, N., Zbinden, H. and Gisin N. Quantum Repeaters with Photon Pair Sources and Multimode Memories. Phys. Rev. Lett. 98, 190503 (2007).
 [59] Tittel, W., Afzelius, M., Chaneliere, T., Cone, R. L., Kroll, S., Moiseev, S. A. and Sellars, M. Photonecho quantum memory in solid state systems. Laser Photon. Rev. 4, 244267 (2009).
 [60] Sangouard, N., Dubessy, R. and Simon, C. Quantum repeaters based on single trapped ions. Phys. Rev. A, 79, 042340 (2009).
 [61] Dur, W. and Briegel, H. J. Entanglement purification and quantum error correction. Rep. Prog. Phys, 70, 13811424 (2007).
 [62] Sheng, Y. B., Zhou, L. Distributed secure quantum machine learning. Science Bulletin, 62, 10251019 (2017).
 [63] Leung, D., Oppenheim, J. and Winter, A. Quantum network communication; the butterfly and beyond, IEEE Trans. Inf. Theory 56, 347890. (2010).
 [64] Kobayashi, H., Le Gall, F., Nishimura, H. and Rotteler, M. Perfect quantum network communication protocol based on classical network coding, Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT) pp 268690. (2010).
 [65] Rak, J. Resilient Routing in Communication Networks, Springer (2015).
 [66] Rak, J. kpenalty: A Novel Approach to Find kdisjoint Paths with Differentiated Path Costs, IEEE Commun. Lett., vol. 14, no. 4, pp. 354356, (2010).
Comments
There are no comments yet.