Entanglement topography of large-scale quantum networks
Abstract: Large-scale quantum networks, necessary for distributed quantum information processing, are posited to have quantum entangled systems between distant network nodes. The extent and quality of distributed entanglement in a quantum network, that is its functionality, depends on its topology, edge-parameter distributions and the distribution protocol. We uncover the parametric entanglement topography and introduce the notion of typical and maximal viable regions for entanglement-enabled tasks in a general model of large-scale quantum networks. We show that such a topographical analysis, in terms of viability regions, reveals important functional information about quantum networks, provides experimental targets for the edge parameters and can guide efficient quantum network design. Applied to a photonic quantum network, such a topographical analysis shows that in a network with radius $103$ kms and 1500 nodes, arbitrary pairs of nodes can establish quantum secure keys at a rate of $R_{sec}=1$ kHz using $1$ MHz entanglement generation sources on the edges and as few as 3 entanglement swappings at intermediate nodes along network paths.
- S. Pirandola and S. L. Braunstein, Nature 532, 169 (2016).
- C. Simon, Nature Photonics 11, 678 (2017).
- Q. Zhuang and B. Zhang, Phys. Rev. A 104, 022608 (2021).
- K. Azuma, S. E. Economou, D. Elkouss, P. Hilaire, L. Jiang, H.-K. Lo, and I. Tzitrin, “Quantum repeaters: From quantum networks to the quantum internet,” (2023), arXiv:2212.10820 [quant-ph] .
- P. Hansen, in Multiple Criteria Decision Making Theory and Application, edited by G. Fandel and T. Gal (Springer Berlin Heidelberg, Berlin, Heidelberg, 1980) pp. 109–127.
- E. Q. V. Martins, European Journal of Operational Research 16, 236 (1984).
- H. Leone, N. R. Miller, D. Singh, N. K. Langford, and P. P. Rohde, “Qunet: Cost vector analysis & multi-path entanglement routing in quantum networks,” (2021), arXiv:2105.00418 [quant-ph] .
- M. Caleffi, IEEE Access 5, 22299 (2017).
- R. Cohen and S. Havlin, Phys. Rev. Lett. 90, 058701 (2003).
- K. Azuma, “Networking quantum networks with minimum cost aggregation,” (2023), arXiv:2304.08921 [quant-ph] .
- L. de Mesnard, SSRN (2020), http://dx.doi.org/10.2139/ssrn.3523802.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.