Abstract
A fundamental concept of the quantum Internet is quantum entanglement. In a quantum Internet scenario where the legal users of the network have different priority levels or where a differentiation of entanglement availability between the users is a necessity, an entanglement availability service is essential. Here we define the entanglement availability differentiation (EAD) service for the quantum Internet. In the proposed EAD framework, the differentiation is either made in the amount of entanglement with respect to the relative entropy of entanglement associated with the legal users, or in the time domain with respect to the amount of time that is required to establish a maximally entangled system between the legal parties. The framework provides an efficient and easily-implementable solution for the differentiation of entanglement availability in experimental quantum networking scenarios.
Introduction
In the quantum Internet1,2, one of the most important tasks is to establish entanglement1,3–11 between the legal parties12–16 so as to allow quantum communication beyond the fundamental limits of point-to-point connections17–19. For the problem of entanglement distribution in quantum repeater networks several methods8,11–16, and physical approaches have been introduced2,20–46. The current results are mainly focusing on the physical-layer of the quantum transmission6–10, implementations of entanglement swapping and purification, or on the optimization of quantum memories and quantum error correction in the repeater nodes2,20–43. However, if the legal users of the quantum network are associated with different priority levels, or if a differentiation of entanglement availability between the users is a necessity in a multiuser quantum network, then an efficient and easily implementable entanglement availability service is essential.
In this work, we define the entanglement availability differentiation (EAD) service for the quantum Internet. We introduce differentiation methods, Protocols 1 and 2, within the EAD framework. In Protocol 1, the differentiation is made in the amount of entanglement associated with the legal users. The metric used for the quantization of entanglement is the relative entropy of entanglement function47–49. In Protocol 2, the differentiation is made in the amount of time that is required to establish a maximally entangled system between the legal parties.
The EAD framework contains a classical phase (Phase 1) for the distribution of timing information between the users of the quantum network. Phase 2 consists of all quantum transmission and unitary operations. In Phase 2, the entanglement establishment is also performed between the parties according to the selected differentiation method.
The entanglement distribution phase of EAD utilizes Hamiltonian dynamics, which allows very efficient practical implementation for both the entanglement establishment and the differentiation of entanglement availability. Using the Hamiltonian dynamics approach as a core protocol of Step 2 of the EAD framework, the entanglement differentiation method requires only unitary operations at the transmitter and requires no entanglement transmission. The application time of the unitaries can be selected as arbitrarily small in the transmitter to achieve an efficient practical realization. The proposed EAD framework is particularly convenient for experimental quantum networking scenarios, quantum communication networks, and future quantum internet.
The novel contributions of our manuscript are as follows:
We define the entanglement availability differentiation (EAD) service for the quantum Internet.
The entanglement availability differentiation is achieved via Hamiltonian dynamics between the users of the quantum network.
The EAD framework can differentiate in the amount of entanglement with respect to the relative entropy of entanglement associated to the legal users (Protocol 1), and also in the time domain with respect to the amount of time that is required to establish a maximally entangled system (Protocol 2) between the legal parties.
The framework provides an efficient and easily-implementable solution for the differentiation of entanglement availability in experimental quantum networking scenarios.
This paper is organized as follows. Section 2 defines the framework for the proposed entanglement differentiation methods. Section 3 discusses the entanglement differentiation schemes. Finally, Section 4 concludes the results. Supplemental information is included in the Appendix.
System Model
The proposed EAD service allows differentiation in the amount of entanglement shared between the users or the amount of time required for the establishment of maximally entangled states between the users. The defined service requires no entanglement transmission to generate entanglement between the legal parties. The differentiation service consists of two phases: a classical transmission phase (Phase 1) to distribute side information for the entanglement differentiation and a quantum transmission phase (Phase 2), which covers the transmission of unentangled systems between the users and the application of local unitary operations to generate entanglement between the parties.
The proposed entanglement availability differentiation methods are detailed in Protocol 1 and Protocol 2. The protocols are based on a core protocol (Protocol 0) that utilizes Hamiltonian dynamics for entanglement distribution in quantum communication networks (see Section A.1 in the Supplementary information). The aim of the proposed entanglement differentiation protocols (Protocol 1 and Protocol 2) is different from the aim of the core protocol, since Protocol 0 serves only the purpose of entanglement distribution, and allows no entanglement differentiation in a multiuser quantum network. Protocol 0 is used only in the quantum transmission phase and has no any relation with a classical communication phase.
Classical Transmission Phase
In the classical transmission phase (Phase 1), the timing information of the local Hamiltonian operators are distributed among the legal parties by an encoder unit. The content of the timing information depends on the type of entanglement differentiation method. The Hamiltonian operators will be applied in the quantum transmission phase (Phase 2) to generate entangled systems between the users. Since each types of entanglement differentiation requires the distribution of different timing information between the users, the distribution of classical timing information will be discussed in detail in Section 3.
Quantum Transmission Phase
The quantum transmission phase (Phase 2) utilizes a core protocol for the entanglement distribution protocol of the EAD framework. The core protocol requires no entanglement transmission for the entanglement generation, only the transmission of an unentangled quantum system (i.e., separable state11–16) and the application of a unitary operation for a well-defined time in the transmit user. The core protocol of the quantum transmission phase for a user-pair is summarized in Protocol 0. It assumes the use of redundant quantum parity code8 for the encoding (actual coding scheme can be different). For a detailed description of Protocol 0, see Section A.1 in the Supplementary information.
Framework
In our multiuser framework, the quantum transmission phase is realized by the core protocol of Phase 2; however, time t of the Hamiltonian operator is selected in a different way among the users, according to the selected type of differentiation. For an i-th user Ui, the application time of the local unitary is referred to as . Without loss of generality, the i-th transmit user is referred to as Ui, and the i-th receiver user is Bi.
In the system model, the user pairs can use the same physical quantum link, therefore in the physical layer the users can communicate over the same quantum channel. On the other hand, in a logical layer representation of the protocols, the communication between the user pairs formulate logically independent channels.
The method of entanglement differentiation service is summarized in Fig. 1. The basic model consists of two phases: distribution of timing information over classical links (Fig. 1(a)) and the transmission of quantum systems and the application of local unitary operations (Fig. 1(b)).
Protocol 0.
Core Protocol.
Figure 1.
Framework of the entanglement differentiation service in a multiuser quantum network. (a) Phase 1. Classical transmission. The encoder unit distributes the timing information for the legal transmit users U1, …, UK and receiver users B1, …, BK via a classical channel. (b) Phase 2. Quantum transmission. The users apply the core protocol for the entanglement establishment. Then, using the received timing information the transmit users U1, …, UK apply the local unitaries for time .
Methods of Entanglement Availability Differentiation
The EAD service defines different types of differentiation. The differentiation can be achieved in the amount of entanglement in terms of the relative entropy of entanglement between the users (Protocol 1: differentiation in the amount of entanglement). In this method, all users have knowledge of a global oscillation period11 of time for the application of their local unitaries, but the users will get different amounts of entanglement as a result.
The differentiation is also possible in the amount of time that is required to establish a maximally entangled system between the users (Protocol 2: differentiation in the time domain). In this method, all users get a maximally entangled system as a result; however, the time that is required for the entanglement establishment is variable for the users, and there is also no global oscillation period of time.
Differentiation in the Amount of Entanglement
The differentiation of the entanglement amount between the users allows us to weight the entanglement amount between the users in terms of relative entropy of entanglement. Using the timing information distributed in Phase 1 between the K transmit users U1, …, UK
| 8 |
where
| 9 |
for an i-th transmit user Ui, the protocol generates an initial system ABC, transmits separable B to receiver Bi, and applies the local unitary UAC on subsystem AC for time (using the core protocol of Phase 2). Depending on the selected , the resulting AB subsystem between users Ui and Bi contains the selected amount of entanglement,
| 10 |
Relative Entropy of Entanglement
In the proposed service framework, the amount of entanglement is quantified by the E(⋅) relative entropy of entanglement function. By definition, the E(ρ) relative entropy of entanglement function of a joint state ρ of subsystems A and B is defined by the quantum relative entropy function, without loss of generality as
| 11 |
where ρAB is the set of separable states
Differentiation Service
The Phases 1 and 2 of the method of entanglement amount differentiation (Protocol 1) are as included in Protocol 1.
Protocol 1.
Differentiation in the Amount of Entanglement.
Description
In the quantum transmission phase, the entanglement oscillation in AB is generated by the energy E of the Hamiltonian H11. This oscillation has a period of time Tπ, which exactly equals to 4t,
| 12 |
where t is determined by Alice and Bob. In other words, time t identifies π/4, where π is the oscillation period. Therefore, in Protocol 1, the density σABC of the final ABC state is as
| 13 |
where at time t is evaluated as
| 14 |
which at (see (8)) of user Ui, for a given is evaluated as
| 15 |
where the sign change on is due to the eigenstate on C, and where
| 16 |
Thus, up to the global phase, both states are the same.
Therefore, the system state of ABC at is yielded as
| 17 |
therefore, the resulting time AB state at and , is a non-maximally entangled system
| 18 |
with entanglement between user Ui and Bi as
| 19 |
Differentiation in the Time Domain
In the time domain differentiation service, a transmit user Ui generates the initial system ABC, transmits separable B to receiver Bi, and applies the local unitary UAC on subsystem AC for time (using the core protocol of Phase 2). Using the oscillation period Tπ(Ui:Bi) distributed in Phase 1, the resulting AB subsystem after total time
| 20 |
between users Ui and Bi, i = 1, …, K is a maximally entangled system, , for all i.
Differentiation Service
The Phases 1 and of the time domain differentiation method (Protocol 2) are as included in Protocol 2.
Protocol 2.
Differentiation in Time Domain.
Description
Let us focus on a particular ABC of users Ui and Bi. The same results apply for all users of the network.
After the steps of Protocol 2, the density σABC of the final ABC state is as
| 22 |
where at t is evaluated as
| 23 |
where the sign change on is due to the eigenstate on C.
Thus, at , the system state is
| 24 |
where
| 25 |
Thus, up to the global phase both states are the same yielding relative entropy of entanglement between users Ui and Bi as
| 26 |
with unit probability.
Comparative Analysis
The results of the proposed differentiation methods, Protocols 1 and 2, are compared in Fig. 2. Figure 2(a) illustrates the results of a differentiation in the entanglement quantity, while Fig. 2(b) depicts the results of the time-domain differentiation method.
Figure 2.
Entanglement differentiation service via Hamiltonian dynamics in a multiuser environment. (a) Protocol 1. Each user gives a different amount of entanglement E(Ui: Bi) ≤ 1 at a global period of time Tπ. The differentiation is made in the amount of entanglement (relative entropy of entanglement) by applying the local unitaries for time for Ui, i = 1, …, K. User U5 has the highest priority thus the user gets a maximally entangled system, user U3 is the lowest priority user with and associated with a low amount of entanglement. (b) Protocol 2. All users are assigned with a maximally entangled system, E(Ui: Bi) = 1, and the differentiation is made in the time domain. For users Ui, Bi, i = 1, …, K a particular period of time Tπ(Ui: Bi) is assigned, and each local unitary is applied for time t o achieve maximally entangled states between the parties. User U5 has the highest priority thus the user associated with the shortest time period, user U3 is the lowest priority user with a long time period for the generation of a maximally entangled system.
Conclusions
Entanglement differentiation is an important problem in quantum networks where the legal users have different priorities or where differentiation is a necessity for an arbitrary reason. In this work, we defined the EAD service for the availability of entanglement in quantum Internet. In EAD, the differentiation is either made in the amount of entanglement associated with a legal user or in the amount of time that is required to establish a maximally entangled system. The EAD method requires a classical phase for the distribution of timing information between the users. The entanglement establishment is based on Hamiltonian dynamics, which allows the efficient implementation of the entanglement differentiation methods via local unitary operations. The method requires no entanglement transmission between the parties, and the application time of the unitaries can be selected as arbitrarily small via the determination of the oscillation periods to achieve an efficient practical realization. The EAD method is particularly convenient for practical quantum networking scenarios, quantum communication networks, and future quantum Internet.
Ethics statement
This work did not involve any active collection of human data.
Data accessibility statement
This work does not have any experimental data.
Electronic supplementary material
Acknowledgements
L.GY. would like to thank Tomasz Paterek for useful discussions. This work was partially supported 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 (BME FIKP-MI/SC).
Author Contributions
L.GY. designed the protocol and wrote the manuscript. L.GY. and S.I. analyzed the results. All authors reviewed the manuscript.
Competing Interests
The authors declare no competing interests.
Footnotes
Electronic supplementary material
Supplementary information accompanies this paper at 10.1038/s41598-018-28801-3.
Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Lloyd S, et al. Infrastructure for the quantum Internet. ACM SIGCOMM Computer Communication Review. 2004;34(5):9–20. doi: 10.1145/1039111.1039118. [DOI] [Google Scholar]
- 2.Kimble HJ. The quantum Internet. Nature. 2008;453:1023–1030. doi: 10.1038/nature07127. [DOI] [PubMed] [Google Scholar]
- 3.Van Meter, R. Quantum Networking, John Wiley and Sons Ltd, ISBN 1118648927, 9781118648926 (2014).
- 4.Gyongyosi L, Imre S, Nguyen HV. A Survey on Quantum Channel Capacities. IEEE Communications Surveys and Tutorials. 2018;99:1. [Google Scholar]
- 5.Pirandola, S. Capacities of repeater-assisted quantum communications, arXiv:1601.00966 (2016).
- 6.Imre, S., Gyongyosi, L. Advanced QuantumCommunications - An Engineering Approach. Wiley-IEEE Press (New Jersey, USA), (2013).
- 7. Gyongyosi, L., Imre, S. Entanglement-Gradient Routing for Quantum Networks, Sci. Rep., Nature (2017). [DOI] [PMC free article] [PubMed]
- 8.Munro WJ, Stephens AM, Devitt SJ, Harrison KA, Nemoto K. Quantum communication without the necessity of quantum memories. Nature Photonics. 2012;6:777–781. doi: 10.1038/nphoton.2012.243. [DOI] [Google Scholar]
- 9.Van Meter R, Ladd TD, Munro WJ, Nemoto K. System Design for a Long-Line Quantum Repeater. IEEE/ACM Transactions on Networking. 2009;17(3):1002–1013. doi: 10.1109/TNET.2008.927260. [DOI] [Google Scholar]
- 10.Van Meter R, Satoh T, Ladd TD, Munro WJ, Nemoto K. Path Selection for Quantum Repeater Networks. Networking Science. 2013;3(Issue 1-4):82–95. doi: 10.1007/s13119-013-0026-2. [DOI] [Google Scholar]
- 11.Krisnanda T, Zuppardo M, Paternostro M, Paterek T. Revealing non-classicality of unmeasured objects. Phys. Rev. Lett. 2017;119:120402. doi: 10.1103/PhysRevLett.119.120402. [DOI] [PubMed] [Google Scholar]
- 12.Cubitt TS, Verstraete F, Dur W, Cirac JI. Separable States Can Be Used To Distribute Entanglement. Phys. Rev. Lett. 2003;91:037902. doi: 10.1103/PhysRevLett.91.037902. [DOI] [PubMed] [Google Scholar]
- 13.Kay A. Resources for Entanglement Distribution via the Transmission of Separable States, arXiv:1204.0366v4. Phys. Rev. Lett. 2012;109:080503. doi: 10.1103/PhysRevLett.109.080503. [DOI] [PubMed] [Google Scholar]
- 14.Chuan TK, et al. Quantum discord bounds the amount of distributed entanglement, arXiv:1203.1268v3. Phys. Rev. Lett. 2012;109:070501. doi: 10.1103/PhysRevLett.109.070501. [DOI] [PubMed] [Google Scholar]
- 15.Streltsov A, Kampermann H, Bruss D. Quantum cost for sending entanglement. Phys. Rev. Lett. 2012;108:250501. doi: 10.1103/PhysRevLett.108.250501. [DOI] [PubMed] [Google Scholar]
- 16.Park J, Lee S. Separable states to distribute entanglement, arXiv:1012.5162v2. Int. J. Theor. Phys. 2010;51(2012):1100–1110. [Google Scholar]
- 17. Pirandola, S., Laurenza, R., Ottaviani, C. and Banchi, L. Fundamental limits of repeaterless quantum communications, Nature Communications, 15043, 10.1038/ncomms15043 (2017). [DOI] [PMC free article] [PubMed]
- 18.Pirandola S, et al. Theory of channel simulation and bounds for private communication. Quantum Sci. Technol. 2018;3:035009. doi: 10.1088/2058-9565/aac394. [DOI] [Google Scholar]
- 19.Laurenza R, Pirandola S. General bounds for sender-receiver capacities in multipoint quantum communications. Phys. Rev. A. 2017;96:032318. doi: 10.1103/PhysRevA.96.032318. [DOI] [Google Scholar]
- 20.Jiang L, Taylor JM, Nemoto K, Munro WJ. Van Meter, R. and Lukin, M.D. Quantum repeater with encoding. Phys. Rev. A. 2009;79:032325. doi: 10.1103/PhysRevA.79.032325. [DOI] [Google Scholar]
- 21.Xiao YF, Gong Q. Optical microcavity: from fundamental physics to functional photonics devices. Science Bulletin. 2016;61:185–186. doi: 10.1007/s11434-016-0996-z. [DOI] [Google Scholar]
- 22.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]
- 23.Biamonte J, et al. Quantum Machine Learning. Nature. 2017;549:195–202. doi: 10.1038/nature23474. [DOI] [PubMed] [Google Scholar]
- 24.Lloyd, S. Mohseni, M. and Rebentrost, P. Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411 (2013).
- 25.Lloyd S, Mohseni M, Rebentrost P. Quantum principal component analysis. Nature Physics. 2014;10:631. doi: 10.1038/nphys3029. [DOI] [Google Scholar]
- 26.Lloyd, S. The Universe as Quantum Computer, A Computable Universe: Understanding and exploring Nature as computation, H. Zenil ed., World Scientific, Singapore, arXiv:1312.4455v1 (2013).
- 27.Kok P, et al. Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 2007;79:135–174. doi: 10.1103/RevModPhys.79.135. [DOI] [Google Scholar]
- 28.Gisin N, Thew R. Quantum Communication. Nature Photon. 2007;1:165–171. doi: 10.1038/nphoton.2007.22. [DOI] [Google Scholar]
- 29.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]
- 30.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. doi: 10.1103/PhysRevLett.81.5932. [DOI] [Google Scholar]
- 31.Dur W, Briegel HJ, Cirac JI, Zoller P. Quantum repeaters based on entanglement purification. Phys. Rev. A. 1999;59:169–181. doi: 10.1103/PhysRevA.59.169. [DOI] [Google Scholar]
- 32.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]
- 33.Van Loock P, et al. Hybrid quantum repeater using bright coherent light. Phys. Rev. Lett. 2006;96:240501. doi: 10.1103/PhysRevLett.96.240501. [DOI] [PubMed] [Google Scholar]
- 34.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]
- 35.Goebel AM, et al. Multistage Entanglement Swapping. Phys. Rev. Lett. 2008;101:080403. doi: 10.1103/PhysRevLett.101.080403. [DOI] [PubMed] [Google Scholar]
- 36.Simon C, et al. 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]
- 37.Tittel W, et al. Photon-echo quantum memory in solid state systems. Laser Photon. Rev. 2009;4:244–267. doi: 10.1002/lpor.200810056. [DOI] [Google Scholar]
- 38.Sangouard N, Dubessy R, Simon C. Quantum repeaters based on single trapped ions. Phys. Rev. A. 2009;79:042340. doi: 10.1103/PhysRevA.79.042340. [DOI] [Google Scholar]
- 39.Dur W, Briegel HJ. Entanglement purification and quantum error correction. Rep. Prog. Phys. 2007;70:1381–1424. doi: 10.1088/0034-4885/70/8/R03. [DOI] [Google Scholar]
- 40.Petz, D. Quantum Information Theory and Quantum Statistics, Springer-Verlag, Heidelberg, Hiv: 6. (2008).
- 41.Lloyd S. Capacity of the noisy quantum channel. Physical Rev. A. 1997;55:1613–1622. doi: 10.1103/PhysRevA.55.1613. [DOI] [Google Scholar]
- 42.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]
- 43.Sheng YB, Zhou L. Distributed secure quantum machine learning. Science Bulletin. 2017;62:1025–2019. doi: 10.1016/j.scib.2017.06.007. [DOI] [PubMed] [Google Scholar]
- 44.Bisztray, T. and Bacsardi, L. The Evolution of Free-Space Quantum Key Distribution, InfoComm. Journal X:(1) pp. 22–30. (2018).
- 45.Bacsardi L. On the Way to Quantum-Based Satellite Communication. IEEE Comm. Mag. 2013;51(08):50–55. doi: 10.1109/MCOM.2013.6576338. [DOI] [Google Scholar]
- 46.Lang MD, Caves CM. Quantum Discord and the Geometry of Bell-Diagonal States. Phys. Rev. Lett. 2010;105:150501. doi: 10.1103/PhysRevLett.105.150501. [DOI] [PubMed] [Google Scholar]
- 47.Vedral V, Plenio MB, Rippin MA, Knight PL. Quantifying Entanglement. Phys. Rev. Lett. 1997;78:2275–2279. doi: 10.1103/PhysRevLett.78.2275. [DOI] [Google Scholar]
- 48.Vedral V, Plenio MB. Entanglement measures and purification procedures. Phys. Rev. A. 1998;57:1619–1633. doi: 10.1103/PhysRevA.57.1619. [DOI] [Google Scholar]
- 49.Vedral V. The role of relative entropy in quantum information theory. Rev. Mod. Phys. 2002;74:197–234. doi: 10.1103/RevModPhys.74.197. [DOI] [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.





