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

Optical Engineering

Accelerating commutation circuits in quantum computer networks

Min Jiang, Xu Huang, Xiaoping Chen, Zengke Zhang

Published Dec 3, 2012• 0 citations
Publisher

Abstract

In a high speed and packet-switched quantum computer network, a packet routing delay often leads to traffic jams, becoming a severe bottleneck for speeding up the transmission rate. Based on the delayed commutation circuit proposed in Phys. Rev. Lett. 97, 110502 (2006), we present an improved scheme for accelerating network transmission. For two more realistic scenarios, we utilize the characteristic of a quantum state to simultaneously implement a data switch and transmission that makes it possible to reduce the packet delay and route a qubit packet even before its address is determined. This circuit is further extended to the quantum network for the transmission of the unknown quantum information. The analysis demonstrates that quantum communication technology can considerably reduce the processing delay time and build faster and more efficient packet-switched networks.

DOI
10.1117/1.oe.51.12.125201

Related papers

Delayed Commutation in Quantum Computer Networks

Juan Carlos García-Escartín, Pedro Chamorro‐Posada

In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communication. We propose a nonclassical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes, we can route a qubit packet after part of it has left the network node.

arXiv:quant-ph/0511031•Physical Review Letters•Sep 13, 2006•12 citations

Packet-switching in quantum communication: opportunities and challenges

Stephen DiAdamo, Reem Mandil, Bing Qi +3 more

Packet-switching has been widely used in classical fiber networks for better network scalability and efficiency. Recently, we introduced packet-switching as a new paradigm in quantum networking, where quantum payloads are packetized with classical headers to construct hybrid classical-quantum data frames, and the routing decisions are made in a decentralized fashion at individual routers dynamically. While there are tremendous challenges in building a generic packet-switched quantum network, our study shows that it is possible to develop metropolitan size packet-switched quantum key distribution (QKD) networks with today’s technology. This may greatly facilitate the integration of QKD with classical communication networks and accelerate its adoption.

Quantum Computing, Communication, and Simulation•Mar 8, 2023•0 citations

Based on Delay Quantum Network Routing Protocol

Jincheng Zhang

This paper presents a novel quantum network routing protocol leveraging the inherent delay characteristics of quantum entanglement. Traditional quantum network routing protocols often rely on metrics like channel capacity and latency, which can be complex to determine and optimize. This proposed protocol, termed "Based on Delay Quantum Network Routing Protocol," directly utilizes the measured delay of quantum entanglement to guide data transmission, offering a potentially more efficient and adaptable routing strategy. The core mechanism involves quantifying and interpreting the delay associated with entangled states, effectively mapping these delays to optimal routing paths. This approach provides a fundamentally different perspective on routing, moving beyond conventional capacity-based analysis. We explore the theoretical foundations, outline the protocol's architecture, and discuss potential challenges and future research directions. The efficacy of this protocol is demonstrated through a theoretical framework, highlighting the potential for improved data transmission rates and resilience within quantum networks.

•Sep 7, 2026•0 citations

Quantum Communication Network Routing With Circuit and Packet Switching Strategies

Ze-Zhou Sun, Yuan-Bin Cheng, Dong Ruan +3 more

Quantum network extends the ability to transmit information securely from two-party communication to multi-party communication with arbitrarily long distances. The efficiency of secure communication in a quantum network depends on both the topology of the network and the strategy of communication relays. In this paper, we propose a strategy to build a quantum network integrating various types of quantum secure direct communication (QSDC) schemes. A cost optimization model is presented to measure the cost of transmitting secure messages in a quantum network. Within the model, two types of quantum network strategies, the quantum circuit switching strategy and the quantum packet switching strategy, are proposed and compared. Numerical simulations in a specific network show that the quantum packet switching strategy is more favorable in future quantum networks taking into account robustness and cost required when using different types of QSDC schemes.

IEEE Journal on Selected Areas in Communications•Feb 19, 2025•15 citations

Quantum key distribution in a packet-switched network

Reem Mandil, Stephen DiAdamo, Bing Qi +1 more

Abstract Packet switching revolutionized the Internet by allowing the efficient use of network resources for data transmission. In a previous work, we introduced packet switching in quantum networks as a path to the Quantum Internet and presented a proof-of-concept for its application to quantum key distribution (QKD). In this paper, we outline a three-step approach for key rate optimization in a packet-switched network. Our simulated results show that practical key rates may be achieved in a sixteen-user network with no optical storage capacity. Under certain network conditions, we may improve the key rate by using an ultra-low-loss fiber delay line to store packets during network delays. We also find that implementing cut-off storage times in a strategy analogous to real-time selection in free-space QKD can significantly enhance performance. Our work demonstrates that packet switching is imminently suitable as a platform for QKD, an important step towards developing large-scale and integrated quantum networks.

arXiv:2302.14005•npj Quantum Information•Sep 9, 2023•17 citations

Design and Analysis of a Fully Non-blocking Quantum Switch

Chuan-Ching Sue, Wei-Ren Chen, Chin-Yu Huang

A switching device is required to build a realistic network which can handle the explosive growth of network traffic. However, the drawback of the switching device is mainly focused on the blocking problem. Previous studies have presented the solutions in the quantum context to avoid blocking at the expense of increasing packet loss and the exponential size of quantum gates. In this paper, we design a fully non-blocking quantum switch using the linear number O(N2) of quantum SWAP gates. Comparisons with a previously proposed quantum self-routing packet switch is also presented in terms of the hardware complexity, the propagation delay and packet loss probability

International Conference on Innovative Computing, Information and Control•Oct 24, 2006•3 citations
In a high speed and packet-switched quantum computer network, a packet routing delay often leads to traffic jams, becoming a severe bottleneck for speeding up the transmission rate. Based on the delayed commutation circuit proposed in Phys. Rev. Lett. 97, 110502 (2006), we present an improved scheme for accelerating network transmission. For two more realistic scenarios, we utilize the characteristic of a quantum state to simultaneously implement a data switch and transmission that makes it possible to reduce the packet delay and route a qubit packet even before its address is determined. This circuit is further extended to the quantum network for the transmission of the unknown quantum information. The analysis demonstrates that quantum communication technology can considerably reduce the processing delay time and build faster and more efficient packet-switched networks.
Packet-switching has been widely used in classical fiber networks for better network scalability and efficiency. Recently, we introduced packet-switching as a new paradigm in quantum networking, where quantum payloads are packetized with classical headers to construct hybrid classical-quantum data frames, and the routing decisions are made in a decentralized fashion at individual routers dynamically. While there are tremendous challenges in building a generic packet-switched quantum network, our study shows that it is possible to develop metropolitan size packet-switched quantum key distribution (QKD) networks with today’s technology. This may greatly facilitate the integration of QKD with classical communication networks and accelerate its adoption.
This paper presents a novel quantum network routing protocol leveraging the inherent delay characteristics of quantum entanglement. Traditional quantum network routing protocols often rely on metrics like channel capacity and latency, which can be complex to determine and optimize. This proposed protocol, termed "Based on Delay Quantum Network Routing Protocol," directly utilizes the measured delay of quantum entanglement to guide data transmission, offering a potentially more efficient and adaptable routing strategy. The core mechanism involves quantifying and interpreting the delay associated with entangled states, effectively mapping these delays to optimal routing paths. This approach provides a fundamentally different perspective on routing, moving beyond conventional capacity-based analysis. We explore the theoretical foundations, outline the protocol's architecture, and discuss potential challenges and future research directions. The efficacy of this protocol is demonstrated through a theoretical framework, highlighting the potential for improved data transmission rates and resilience within quantum networks.
Quantum network extends the ability to transmit information securely from two-party communication to multi-party communication with arbitrarily long distances. The efficiency of secure communication in a quantum network depends on both the topology of the network and the strategy of communication relays. In this paper, we propose a strategy to build a quantum network integrating various types of quantum secure direct communication (QSDC) schemes. A cost optimization model is presented to measure the cost of transmitting secure messages in a quantum network. Within the model, two types of quantum network strategies, the quantum circuit switching strategy and the quantum packet switching strategy, are proposed and compared. Numerical simulations in a specific network show that the quantum packet switching strategy is more favorable in future quantum networks taking into account robustness and cost required when using different types of QSDC schemes.
Abstract Packet switching revolutionized the Internet by allowing the efficient use of network resources for data transmission. In a previous work, we introduced packet switching in quantum networks as a path to the Quantum Internet and presented a proof-of-concept for its application to quantum key distribution (QKD). In this paper, we outline a three-step approach for key rate optimization in a packet-switched network. Our simulated results show that practical key rates may be achieved in a sixteen-user network with no optical storage capacity. Under certain network conditions, we may improve the key rate by using an ultra-low-loss fiber delay line to store packets during network delays. We also find that implementing cut-off storage times in a strategy analogous to real-time selection in free-space QKD can significantly enhance performance. Our work demonstrates that packet switching is imminently suitable as a platform for QKD, an important step towards developing large-scale and integrated quantum networks.
A switching device is required to build a realistic network which can handle the explosive growth of network traffic. However, the drawback of the switching device is mainly focused on the blocking problem. Previous studies have presented the solutions in the quantum context to avoid blocking at the expense of increasing packet loss and the exponential size of quantum gates. In this paper, we design a fully non-blocking quantum switch using the linear number O(N2) of quantum SWAP gates. Comparisons with a previously proposed quantum self-routing packet switch is also presented in terms of the hardware complexity, the propagation delay and packet loss probability