research-article

Greedy Algorithms for Finding Entanglement Swap Paths in Quantum Networks

Authors:

Anoop Kumar Pandey,

Anubhav Srivastava,

Bheemarjuna Reddy Tamma,

M.V. Panduranga RaoAuthors Info & Claims

ICDCN '23: Proceedings of the 24th International Conference on Distributed Computing and Networking

Pages 237 - 244

https://doi.org/10.1145/3571306.3571408

Published: 04 January 2023 Publication History

ICDCN '23: Proceedings of the 24th International Conference on Distributed Computing and Networking

Greedy Algorithms for Finding Entanglement Swap Paths in Quantum Networks

Pages 237 - 244

Abstract
References

Abstract

The entanglement swap primitive facilitates the establishment of shared entanglement between non-adjacent nodes in a quantum network. This shared entanglement can subsequently be used for executing quantum communication protocols. The fundamental problem in quantum networks is to determine a path for entanglement swapping in response to demands for entanglement sharing between pairs of nodes. We investigate variants of this problem in this work.

We propose a framework of Greedy algorithms that can be tweaked towards optimizing on various objective functions. In conjunction with a novel Spatial and Temporal (split across multiple paths) splitting approach to entanglement routing, we use this framework, which we call GST, to investigate the scenario when the demands are specified in terms of a starting time and a deadline. Considering the fragile nature of quantum memory, “bursty" demands are natural, and therefore the setting is important.

We study the algorithm for maximizing the number of satisfied demands and the number of entangled pairs shared. We report empirical results on the performance against these objective functions, and compare with a naive algorithm that involves neither temporal and spatial splitting of the demands, nor the greedy approach to scheduling the demands.

References

[1]

[1] Jessica Illiano, Marcello Caleffi, Antonio Manzalini, and Angela Sara Cacciapuoti. Quantum internet protocol stack: A comprehensive survey. Computer Networks, 213:109092, 2022.

Digital Library

[2]

[2] Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Phys. Rev. Lett., 70:1895–1899, Mar 1993.

[3]

[3] Alexander M. Goebel, Claudia Wagenknecht, Qiang Zhang, Yu-Ao Chen, Kai Chen, Jörg Schmiedmayer, and Jian-Wei Pan. Multistage entanglement swapping. Phys. Rev. Lett., 101:080403, Aug 2008.

[4]

[4] Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.

[5]

[5] Rodney Van Meter, Takahiko Satoh, Thaddeus D. Ladd, William J. Munro, and Kae Nemoto. Path selection for quantum repeater networks. Networking Science, 3(1):82–95, Dec 2013.

[6]

[6] Jian Li, Mingjun Wang, Qidong Jia, Kaiping Xue, Nenghai Yu, Qibin Sun, and Jun Lu. Fidelity-Guarantee Entanglement Routing in Quantum Networks. arXiv e-prints, page arXiv:2111.07764, November 2021.

[7]

[7] Kaushik Chakraborty, David Elkouss, Bruno Rijsman, and Stephanie Wehner. Entanglement distribution in a quantum network: A multicommodity flow-based approach. IEEE Transactions on Quantum Engineering, 1:1–21, 2020.

[8]

[8] Claudio Cicconetti, Marco Conti, and Andrea Passarella. Request scheduling in quantum networks. IEEE Transactions on Quantum Engineering, 2:2–17, 2021.

[9]

[9] Mihir Pant, Hari Krovi, Don Towsley, Leandros Tassiulas, Liang Jiang, Prithwish Basu, Dirk Englund, and Saikat Guha. Routing entanglement in the quantum internet. npj Quantum Information, 5(1):25, Mar 2019.

[10]

[10] Laszlo Gyongyosi and Sandor Imre. Opportunistic entanglement distribution for the quantum internet. Scientific Reports, 9(1):2219, Feb 2019.

[11]

[11] Claudio Cicconetti, Marco Conti, and Andrea Passarella. Resource allocation in quantum networks for distributed quantum computing. In 2022 IEEE International Conference on Smart Computing (SMARTCOMP), pages 124–132, 2022.

[12]

[12] Yuan Lee, Eric Bersin, Axel Dahlberg, Stephanie Wehner, and Dirk Englund. A quantum router architecture for high-fidelity entanglement flows in quantum networks. npj Quantum Information, 8(1):75, Jun 2022.

[13]

[13] Ali Farahbakhsh and Chen Feng. Opportunistic routing in quantum networks. In IEEE INFOCOM 2022 - IEEE Conference on Computer Communications, page 490–499. IEEE Press, 2022.

[14]

[14] Julian Rabbie, Kaushik Chakraborty, Guus Avis, and Stephanie Wehner. Designing quantum networks using preexisting infrastructure. npj Quantum Information, 8(1):5, Jan 2022.

[15]

[15] Marcello Caleffi. Optimal routing for quantum networks. IEEE Access, 5:22299–22312, 2017.

[16]

[16] Kaushik Chakraborty, Filip Rozpedek, Axel Dahlberg, and Stephanie Wehner. Distributed routing in a quantum internet. arXiv preprint arXiv:1907.11630, 2019.

[17]

[17] Siddhartha Das, Sumeet Khatri, and Jonathan P. Dowling. Robust quantum network architectures and topologies for entanglement distribution. Phys. Rev. A, 97:012335, Jan 2018.

[18]

[18] Jessica Illiano, Marcello Caleffi, Antonio Manzalini, and Angela Sara Cacciapuoti. Quantum internet protocol stack: A comprehensive survey. Computer Networks, 213:109092, 2022.

Digital Library

Cited By

Pandey ATamma BRao M(2025)Mixing Entanglement Swapping and Hop-by-Hop Transmission On Heterogeneous Quantum NetworksProceedings of the 26th International Conference on Distributed Computing and Networking10.1145/3700838.3700855(84-93)Online publication date: 4-Jan-2025
https://dl.acm.org/doi/10.1145/3700838.3700855
Pandey ATamma BRao M(2025)Quantum Network Routing with Heterogeneous Nodes2025 17th International Conference on COMmunication Systems and NETworks (COMSNETS)10.1109/COMSNETS63942.2025.10885596(1056-1061)Online publication date: 6-Jan-2025
https://doi.org/10.1109/COMSNETS63942.2025.10885596

Index Terms

Greedy Algorithms for Finding Entanglement Swap Paths in Quantum Networks

Index terms have been assigned to the content through auto-classification.

Recommendations

Entanglement and swap of quantum states in two qubits

Suppose that two distant parties Alice and Bob share an entangled state ρAB, and they want to exchange the subsystems of ρAB by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of ρAB → V ρABV ...
Topological aspects of quantum entanglement

Kauffman and Lomonaco (New J Phys 4:73.1---73.18, 2002. arXiv:quant-ph/0401090, New J Phys 6:134.1---134.40, 2004) explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by ...
Quantum Fisher information, quantum entanglement and correlation close to quantum critical phenomena

In this paper, we investigate the quantum Fisher information (QFI), quantum entanglement, quantum correlation and quantum phase transition (QPT) within the one-dimensional transverse Ising model by exploiting quantum renormalization-group method. The ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDCN '23: Proceedings of the 24th International Conference on Distributed Computing and Networking

January 2023

461 pages

ISBN:9781450397964

DOI:10.1145/3571306

Copyright © 2023 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 January 2023

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed limited

Conference

ICDCN 2023

ICDCN 2023: 24th International Conference on Distributed Computing and Networking

January 4 - 7, 2023

Kharagpur, India

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
121
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Pandey ATamma BRao M(2025)Mixing Entanglement Swapping and Hop-by-Hop Transmission On Heterogeneous Quantum NetworksProceedings of the 26th International Conference on Distributed Computing and Networking10.1145/3700838.3700855(84-93)Online publication date: 4-Jan-2025
https://dl.acm.org/doi/10.1145/3700838.3700855
Pandey ATamma BRao M(2025)Quantum Network Routing with Heterogeneous Nodes2025 17th International Conference on COMmunication Systems and NETworks (COMSNETS)10.1109/COMSNETS63942.2025.10885596(1056-1061)Online publication date: 6-Jan-2025
https://doi.org/10.1109/COMSNETS63942.2025.10885596

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Table of Conten