Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in electrical engineering

Application of Quantum Algorithms for Network Protocols

Kolachana Vinutna, Dolly Upmandewan, Arpit Giri, N. Pavan, Anees Ahmed, M. N. Thippeswamy, T. R. Vinay

Published Jan 1, 2022• 4 citations
Publisher
DOI
10.1007/978-981-16-8862-1_29

Related papers

Quantum Algorithms and Protocols

David Peter Divincenzo

APS•Jun 1, 2001•0 citations

Exploration of Quantum Algorithms for Future Communication Networks in Electronics and Communication Engineering

Dong Chen, Jiemin Zhang

With the continuous progress of quantum computing and quantum communication technology, the application of quantum algorithms in future communication networks is increasingly promising. Quantum algorithms have computing power beyond traditional algorithms and can effectively improve the performance and security of communication networks, especially in the field of electronics and communication engineering, showing great potential. In this paper, the application of quantum algorithms in future communication networks is discussed in depth, focusing on the analysis of quantum communication protocols, the application of quantum computing in network optimization, and the innovative methods of quantum algorithms in enhancing network security. By systematically analyzing the basic principles, application examples and development trends of quantum algorithms, this paper aims to provide theoretical support and technical reference for the design and realization of future communication networks. Finally, this paper summarizes the current challenges in the application of quantum algorithms and looks forward to the future development direction of its wide application in electronics and communication engineering.

International Conference on Telecommunications and Power Electronics (TELEPE)•May 29, 2025•0 citations

Quantum network protocols

Deborah J. Jackson, D. P. Gilliam, Jonathan P. Dowling

•Mar 28, 2001•3 citations

PhD Forum: Evaluating and Designing Routing Protocols for Reliable Distributed Quantum Systems

Huzaifah Nadeem

As quantum computers and quantum networks become more capable, it allows for the possibility to use multiple quantum computers as part of a distributed system. Such a distributed system will have applications such as running quantum algorithms in a distributed fashion [7], leadership elections without communication [7], clock synchronisation [10], and a cryptographic protocol called quantum key distribution [1], etc. However, to create a reliable system, it is important that the underlying quantum network can reliably support the necessary communication protocols between quantum nodes. To support reliable communication in a quantum network, quantum routing algorithms - which are algorithms that plan out how to send qubits and over which subset of nodes in the network - is an active area of research. However, various design choices and algorithms exist that are developed without a realistic simulated environment that can provide rich data that can further help develop, improve, and test these algorithms. Such an environment is important because general-purpose algorithms need to take into account detailed information about how the qubit changes over the communication process - as that requirement can vary for different applications - rather than simpler probability based loss models existing algorithms were developed with. Using existing lower-level tools, we are creating a tool will help evaluate and design routing protocol by providing a variety of models - from simple to complex - to support various stages of development, as well as the ability to generate useful data to evaluate how the protocols perform in a realistic quantum network.

IEEE Symposium on Reliable Distributed Systems (SRDS)•Sep 30, 2024•0 citations

Multi-protocol updating for seamless key negotiation in quantum metropolitan networks

Jiali Zhu, Yuan Cao, Mingxuan Guo +7 more

Quantum key distribution (QKD) can provide long-term security for numerous users. Currently, quantum networks are still in the early stages of small-scale deployment, most of which can only support a single QKD protocol (QKDP). However, with the advancement of various QKDPs, a single-protocol quantum network is no longer sufficient to meet the demands of multiple users, prompting the emergence of multi-protocol quantum networks. Nevertheless, the transition from a single-protocol to a multi-protocol quantum network still faces many challenging issues, such as key negotiation interruptions due to device initialization and channel calibration during protocol updating. To address the quantum key negotiation interruption problem, we propose a seamless key negotiation oriented multi-protocol updating algorithm in this work, which can fulfill the protocol updating requests of different users in quantum metropolitan networks. Furthermore, to better improve network performance while meeting diverse user demands, we propose four heuristic algorithms for optimal QKDP recommendation, focusing on their applications for multi-protocol updating in different types of typical networks. We perform the simulations with different QKDP recommendation algorithms to analyze the impact of the cache time of the key cache area on the key negotiation interruption probability and the time resource utilization. Simulation results demonstrate that the proposed algorithm can reduce the key negotiation interruption probability by 77.7% while increasing the time resource utilization by 15.3% compared to no key cache area.

Journal of Optical Communications and Networking•May 28, 2024•5 citations

Quantum algorithms and communication protocols

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations
With the continuous progress of quantum computing and quantum communication technology, the application of quantum algorithms in future communication networks is increasingly promising. Quantum algorithms have computing power beyond traditional algorithms and can effectively improve the performance and security of communication networks, especially in the field of electronics and communication engineering, showing great potential. In this paper, the application of quantum algorithms in future communication networks is discussed in depth, focusing on the analysis of quantum communication protocols, the application of quantum computing in network optimization, and the innovative methods of quantum algorithms in enhancing network security. By systematically analyzing the basic principles, application examples and development trends of quantum algorithms, this paper aims to provide theoretical support and technical reference for the design and realization of future communication networks. Finally, this paper summarizes the current challenges in the application of quantum algorithms and looks forward to the future development direction of its wide application in electronics and communication engineering.
As quantum computers and quantum networks become more capable, it allows for the possibility to use multiple quantum computers as part of a distributed system. Such a distributed system will have applications such as running quantum algorithms in a distributed fashion [7], leadership elections without communication [7], clock synchronisation [10], and a cryptographic protocol called quantum key distribution [1], etc. However, to create a reliable system, it is important that the underlying quantum network can reliably support the necessary communication protocols between quantum nodes. To support reliable communication in a quantum network, quantum routing algorithms - which are algorithms that plan out how to send qubits and over which subset of nodes in the network - is an active area of research. However, various design choices and algorithms exist that are developed without a realistic simulated environment that can provide rich data that can further help develop, improve, and test these algorithms. Such an environment is important because general-purpose algorithms need to take into account detailed information about how the qubit changes over the communication process - as that requirement can vary for different applications - rather than simpler probability based loss models existing algorithms were developed with. Using existing lower-level tools, we are creating a tool will help evaluate and design routing protocol by providing a variety of models - from simple to complex - to support various stages of development, as well as the ability to generate useful data to evaluate how the protocols perform in a realistic quantum network.
Quantum key distribution (QKD) can provide long-term security for numerous users. Currently, quantum networks are still in the early stages of small-scale deployment, most of which can only support a single QKD protocol (QKDP). However, with the advancement of various QKDPs, a single-protocol quantum network is no longer sufficient to meet the demands of multiple users, prompting the emergence of multi-protocol quantum networks. Nevertheless, the transition from a single-protocol to a multi-protocol quantum network still faces many challenging issues, such as key negotiation interruptions due to device initialization and channel calibration during protocol updating. To address the quantum key negotiation interruption problem, we propose a seamless key negotiation oriented multi-protocol updating algorithm in this work, which can fulfill the protocol updating requests of different users in quantum metropolitan networks. Furthermore, to better improve network performance while meeting diverse user demands, we propose four heuristic algorithms for optimal QKDP recommendation, focusing on their applications for multi-protocol updating in different types of typical networks. We perform the simulations with different QKDP recommendation algorithms to analyze the impact of the cache time of the key cache area on the key negotiation interruption probability and the time resource utilization. Simulation results demonstrate that the proposed algorithm can reduce the key negotiation interruption probability by 77.7% while increasing the time resource utilization by 15.3% compared to no key cache area.