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

Advances in engineering research/Advances in Engineering Research

Quantum Route Selection based on Graph State

Lei Yan, Peng Luo, Hanyu Cui, Ronghua Shi, Ying Guo

Published Jan 1, 2016• 0 citations
Publisher

Abstract

Many quantum communication protocols involve multiple participants.With participants increasing, selecting designated legal participants in a nice way becomes more and more significant.In this paper, we develop a quantum route selection approach to the design of participant selection.Graph state is a special type of multi-particle entangled quantum state that can be represented by mathematical graph, where each vertex denotes a qubit and each edge denotes an Ising interaction.Motivated by the characteristics of graph state, we propose that each participant holds a vertex of graph state so that all legal participants are selected through a series of operations on specific vertices of graph state.

DOI
10.2991/icmmct-16.2016.224

Related papers

Graph-Based Quantum Parallel Teleportation in Quantum Wireless Multi-Hop Networks

Huamei Qi, Tailong Xiao, Ying Guo

Motivated by multi-particle entanglement, we propose a multi-party quantum parallel teleportation scheme in quantum wireless multi-hop networks (QWMNs) investigated with four-vertex graph-based entanglement. We show an ar- bitrary single-qubit quantum teleportation with graph state between directly connected two-party and an arbitrary two- qubit quantum teleportation based on four-vertex graph state followed by the multi-parity quantum teleportation based on four-vertex graph state where source node do not need share any entangled pairs with destination node but via intermediate nodes’ quantum swapping to finish the teleportation. Source node and intermediate nodes conduct von Neumann measurement and transmit their classical outcomes to the destination node independently in a parallel manner. Then destination node applies appropriate unitary operation to recover the source quantum state according to the received outcomes. This graph- based scheme extends the entanglement pattern in quantum teleportation, provides a perfect multi-party teleportation model. The proposed scheme improves the constructing flexibility of the network and reduces the communication delay, which has a wide application in quantum route selection.

IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA)•Dec 1, 2017•2 citations

Improved Routing of Multiparty Entanglement over Quantum Networks

Nirupam Basak, Goutam Paul

The effective routing of entanglement over a quantum network is a fundamental problem in quantum communication. The distribution and reshaping of multipartite entanglement over a quantum network requires scalable protocols that adapt to the underlying topology. Graph states provide a convenient framework for this challenging task, as they encode global entanglement in a structured way that can be locally manipulated to produce a variety of target states, without requiring additional long-distance quantum operations. In this article, we propose graph-state-based routing protocols for sharing GHZ states, achieving larger sizes than those achieved in the existing works for given network topologies. For this improvement, we consider tree structures connecting the users participating in the final GHZ states, as opposed to the linear configurations used in the earlier works. In particular, for grid networks, we show special constructions of such trees that achieve larger GHZ states than the prior works. Moreover, if the user nodes along which the entanglement is to be routed are pre-specified, a strategy is proposed to accomplish this routing.

arXiv:2409.14694•ACM Transactions on Quantum Computing•Apr 22, 2026•3 citations

Entanglement Classification in the Graph States: The generalization to $n$-Qubits States using the Entanglement Matrix

S. Sharma

Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the Entanglement Matrix for quantifying and classifying entanglement in n-qubit graph states. Leveraging concepts from graph theory and quantum information, we develop a systematic approach to analyze entanglement by identifying primary and secondary midpoints in graph representations, where midpoints correspond to controlled-Z gate operations between qubits. Using Von Neumann entropy as our measure, we derive precise mathematical relationships for maximum entanglement in graph states as a function of qubit number. Our analysis reveals that entanglement follows a quadratic relationship with the number of qubits, but with distinct behaviors for odd versus even qubit systems. For odd n-qubit graph states, maximum entanglement follows $E_{\max} = n^2 - n$, while even n-qubit states exhibit higher entanglement with varying formulae depending on specific configurations. Notably, systems with qubit counts that are multiples of 12 demonstrate enhanced entanglement properties. This comprehensive classification framework provides valuable insights into the structure of multi-qubit entanglement, establishing an analytical foundation for understanding entanglement distribution in complex quantum systems that may inform future quantum technologies.

arXiv:2507.11458•Jul 15, 2025•1 citation

An enhanced graph state distribution method for quantum networks

Jason Lin, Li-Yu Hsieh, Chia‐Wei Tsai

Abstract Multi-particle entanglement state distribution is a crucial component for executing the quantum communication or computation protocols over quantum networks, and the graph state is an important class of multi-particle entanglement states. If the graph states can be efficiently distributed over quantum networks, the execution costs of the quantum communication or computation protocols will be greatly improved. Therefore, this study proposes an enhanced graph state transfer algorithm, which is used to distribute the graph state across a quantum network to reduce the required number of qubit measurements, quantum operation implementation, and qubit consumption without adding any additional quantum device.

Physica Scripta•Mar 7, 2025•3 citations

Quantum Entanglement Topological Network Routing

Jincheng Zhang

This paper proposes a novel distributed routing protocol for quantum networks leveraging the topological properties of quantum entanglement. The core idea is to construct a network topology based on entangled states between nodes, enabling communication through the instantaneous correlation inherent in entanglement. This approach aims to overcome the limitations of traditional routing protocols, particularly in terms of speed and security. We define a routing algorithm that dynamically adjusts the entanglement states to facilitate data transmission, effectively creating a network with inherently high bandwidth and resilience to eavesdropping. The algorithm is based on a graph theory framework where nodes represent quantum devices and edges represent entangled pairs. The routing process involves identifying the shortest path through the entanglement network, leveraging the correlated states for rapid information transfer. We explore the mathematical underpinnings of this protocol, outlining key formulas for calculating entanglement metrics, path distances, and routing decisions. The theoretical framework presented here provides a foundation for future research and development in quantum network architecture and routing strategies.

•Sep 6, 2026•0 citations

An Ultimate Benchmark for the Optimal Performance of Quantum Communication Network Using Multi Path Routing Protocol

Jatin Khurana

In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.

World Conference on Communication & Computing (WCONF)•Jul 14, 2023•0 citations
Many quantum communication protocols involve multiple participants.With participants increasing, selecting designated legal participants in a nice way becomes more and more significant.In this paper, we develop a quantum route selection approach to the design of participant selection.Graph state is a special type of multi-particle entangled quantum state that can be represented by mathematical graph, where each vertex denotes a qubit and each edge denotes an Ising interaction.Motivated by the characteristics of graph state, we propose that each participant holds a vertex of graph state so that all legal participants are selected through a series of operations on specific vertices of graph state.
Motivated by multi-particle entanglement, we propose a multi-party quantum parallel teleportation scheme in quantum wireless multi-hop networks (QWMNs) investigated with four-vertex graph-based entanglement. We show an ar- bitrary single-qubit quantum teleportation with graph state between directly connected two-party and an arbitrary two- qubit quantum teleportation based on four-vertex graph state followed by the multi-parity quantum teleportation based on four-vertex graph state where source node do not need share any entangled pairs with destination node but via intermediate nodes’ quantum swapping to finish the teleportation. Source node and intermediate nodes conduct von Neumann measurement and transmit their classical outcomes to the destination node independently in a parallel manner. Then destination node applies appropriate unitary operation to recover the source quantum state according to the received outcomes. This graph- based scheme extends the entanglement pattern in quantum teleportation, provides a perfect multi-party teleportation model. The proposed scheme improves the constructing flexibility of the network and reduces the communication delay, which has a wide application in quantum route selection.
The effective routing of entanglement over a quantum network is a fundamental problem in quantum communication. The distribution and reshaping of multipartite entanglement over a quantum network requires scalable protocols that adapt to the underlying topology. Graph states provide a convenient framework for this challenging task, as they encode global entanglement in a structured way that can be locally manipulated to produce a variety of target states, without requiring additional long-distance quantum operations. In this article, we propose graph-state-based routing protocols for sharing GHZ states, achieving larger sizes than those achieved in the existing works for given network topologies. For this improvement, we consider tree structures connecting the users participating in the final GHZ states, as opposed to the linear configurations used in the earlier works. In particular, for grid networks, we show special constructions of such trees that achieve larger GHZ states than the prior works. Moreover, if the user nodes along which the entanglement is to be routed are pre-specified, a strategy is proposed to accomplish this routing.
Entanglement Classification in the Graph States: The generalization to nnn-Qubits States using the Entanglement Matrix
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the Entanglement Matrix for quantifying and classifying entanglement in n-qubit graph states. Leveraging concepts from graph theory and quantum information, we develop a systematic approach to analyze entanglement by identifying primary and secondary midpoints in graph representations, where midpoints correspond to controlled-Z gate operations between qubits. Using Von Neumann entropy as our measure, we derive precise mathematical relationships for maximum entanglement in graph states as a function of qubit number. Our analysis reveals that entanglement follows a quadratic relationship with the number of qubits, but with distinct behaviors for odd versus even qubit systems. For odd n-qubit graph states, maximum entanglement follows Emax⁡=n2−nE_{\max} = n^2 - nEmax​=n2−n, while even n-qubit states exhibit higher entanglement with varying formulae depending on specific configurations. Notably, systems with qubit counts that are multiples of 12 demonstrate enhanced entanglement properties. This comprehensive classification framework provides valuable insights into the structure of multi-qubit entanglement, establishing an analytical foundation for understanding entanglement distribution in complex quantum systems that may inform future quantum technologies.
Abstract Multi-particle entanglement state distribution is a crucial component for executing the quantum communication or computation protocols over quantum networks, and the graph state is an important class of multi-particle entanglement states. If the graph states can be efficiently distributed over quantum networks, the execution costs of the quantum communication or computation protocols will be greatly improved. Therefore, this study proposes an enhanced graph state transfer algorithm, which is used to distribute the graph state across a quantum network to reduce the required number of qubit measurements, quantum operation implementation, and qubit consumption without adding any additional quantum device.
This paper proposes a novel distributed routing protocol for quantum networks leveraging the topological properties of quantum entanglement. The core idea is to construct a network topology based on entangled states between nodes, enabling communication through the instantaneous correlation inherent in entanglement. This approach aims to overcome the limitations of traditional routing protocols, particularly in terms of speed and security. We define a routing algorithm that dynamically adjusts the entanglement states to facilitate data transmission, effectively creating a network with inherently high bandwidth and resilience to eavesdropping. The algorithm is based on a graph theory framework where nodes represent quantum devices and edges represent entangled pairs. The routing process involves identifying the shortest path through the entanglement network, leveraging the correlated states for rapid information transfer. We explore the mathematical underpinnings of this protocol, outlining key formulas for calculating entanglement metrics, path distances, and routing decisions. The theoretical framework presented here provides a foundation for future research and development in quantum network architecture and routing strategies.
In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.