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

arXiv:2601.14824

Routing Qubits on Noisy Networks

Claudia Benedetti, Giovanni Ragazzi, Simone Cavazzoni, Paolo Bordone, Matteo G. A. Paris

quant-phSubmitted Jan 21, 2026• Announced Jan 22, 2026• 0 citations
arXivHTMLPDF

Abstract

Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum information under ideal conditions. We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple (orthogonal) outputs. We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.

Related papers

Routing qubits on noisy networks

Claudia Benedetti, Giovanni Ragazzi, Simone Cavazzoni +2 more

Abstract Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum information under ideal conditions. We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple (orthogonal) outputs. We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.

Journal of Physics Complexity•Mar 18, 2026•0 citations

Scalable Structure for Chiral Quantum Routing

Giovanni Ragazzi, Simone Cavazzoni, Claudia Benedetti +2 more

We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete graph, where the sites naturally provide a basis for encoding the quantum state to be transmitted. Upon tuning a single phase or weight in the Hamiltonian, we achieve near-unitary routing fidelity, enabling the selective delivery of information to designated receivers for both classical and quantum data. The structure is inherently scalable, accommodating an arbitrary number of receivers. The routing time is largely independent of the network's dimension and input state, and the routing performance is robust under static and dynamic noise, at least for a short time.

arXiv:2502.12739•Entropy•May 5, 2025•3 citations

Quantum routing of information using chiral quantum walks

Alberto Bottarelli, Massimo Frigerio, Matteo G. A. Paris

We address routing of classical and quantum information over quantum network and show how to exploit chirality (directionality) to achieve nearly optimal and robust transport. In particular, we prove how continuous-time chiral quantum walks over a minimal graph are able to model directional transfer of information over a network. At first, we show how classical information, encoded onto an excitation localized at one vertex of a simple graph, may be sent to any other chosen location with nearly unit fidelity by tuning a single phase. Then, we prove that high-fidelity transport is also possible for coherent superpositions of states, i.e., for routing of quantum information. Furthermore, we show that by tuning the phase parameter, one obtains universal quantum routing, i.e., independent on the input state. In our scheme, chirality is governed by a single phase, and the routing probability is robust against fluctuations of this parameter. Finally, we address characterization of quantum routers and show how to exploit the self-energies of the graph to achieve high precision in estimating the phase parameter.

arXiv:2302.08472•AVS Quantum Science•Apr 27, 2023•18 citations

Dynamic Topology Quantum Network Routing Protocol

Jincheng Zhang

This paper proposes a dynamic routing protocol for quantum networks based on the fluctuating entanglement states between quantum nodes. The core of the protocol lies in real-time monitoring of entanglement strength and dynamically adjusting routing paths based on these changes. This approach aims to mitigate the risk of information loss due to entanglement decay, ultimately achieving high reliability in quantum routing. Unlike traditional protocols relying on fixed topologies, this protocol adapts to the dynamic nature of entanglement, enhancing routing efficiency and resilience. The protocol utilizes a graph-based representation of the quantum network and employs algorithms for entanglement assessment and path optimization. Mathematical models are presented to formalize the routing process, including the calculation of entanglement fidelity and path cost. The proposed system demonstrates improved routing performance and fault tolerance compared to static routing schemes. The key contribution is a dynamic, adaptive routing strategy that leverages the inherent properties of quantum networks for reliable quantum information transmission.

•Aug 31, 2026•0 citations

Perfect chiral quantum routing

Simone Cavazzoni, Giovanni Ragazzi, Paolo Bordone +1 more

Routing classical and quantum information is a fundamental task for quantum information technologies and processes. Here, we consider information encoded in the position of a quantum walker on a graph, and we design an optimal structure to achieve perfect quantum routing, exploiting chirality and weighting of the edges. The topology, termed the lily graph, enables perfect (i.e., with fidelity one) and robust routing of classical (localized) or quantum (superposition) states of the walker to $n$ different, orthogonal, spatial regions of the graph, corresponding to the $n$ possible outputs of the device. The routing time is independent of the input signal and the number of outputs, making our scheme a robust and scalable solution for all quantum networks.

arXiv:2406.11834•Physical Review A•Mar 31, 2025•6 citations

Quantum Entanglement-Based Information Encoding and Topological Network Routing

Jincheng Zhang

This paper proposes a novel approach to information transmission leveraging the unique properties of quantum entanglement within a topological network architecture. The core idea is to construct a network of entangled nodes, enabling efficient and robust information routing. We introduce a framework for encoding information using entangled states and propose a routing protocol based on entanglement swapping and entanglement protection techniques to mitigate the effects of node failures, a significant limitation in conventional quantum communication. The resulting system offers the potential to surpass the fundamental limits imposed by classical physics in terms of information transfer rates and resilience. The system's performance is analyzed using key metrics, demonstrating its capability for high-capacity, fault-tolerant communication. This research contributes to the development of advanced quantum communication networks with enhanced security and scalability.

•Sep 5, 2026•0 citations
Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum information under ideal conditions. We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple (orthogonal) outputs. We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.
Abstract Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum information under ideal conditions. We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple (orthogonal) outputs. We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.
We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete graph, where the sites naturally provide a basis for encoding the quantum state to be transmitted. Upon tuning a single phase or weight in the Hamiltonian, we achieve near-unitary routing fidelity, enabling the selective delivery of information to designated receivers for both classical and quantum data. The structure is inherently scalable, accommodating an arbitrary number of receivers. The routing time is largely independent of the network's dimension and input state, and the routing performance is robust under static and dynamic noise, at least for a short time.
We address routing of classical and quantum information over quantum network and show how to exploit chirality (directionality) to achieve nearly optimal and robust transport. In particular, we prove how continuous-time chiral quantum walks over a minimal graph are able to model directional transfer of information over a network. At first, we show how classical information, encoded onto an excitation localized at one vertex of a simple graph, may be sent to any other chosen location with nearly unit fidelity by tuning a single phase. Then, we prove that high-fidelity transport is also possible for coherent superpositions of states, i.e., for routing of quantum information. Furthermore, we show that by tuning the phase parameter, one obtains universal quantum routing, i.e., independent on the input state. In our scheme, chirality is governed by a single phase, and the routing probability is robust against fluctuations of this parameter. Finally, we address characterization of quantum routers and show how to exploit the self-energies of the graph to achieve high precision in estimating the phase parameter.
This paper proposes a dynamic routing protocol for quantum networks based on the fluctuating entanglement states between quantum nodes. The core of the protocol lies in real-time monitoring of entanglement strength and dynamically adjusting routing paths based on these changes. This approach aims to mitigate the risk of information loss due to entanglement decay, ultimately achieving high reliability in quantum routing. Unlike traditional protocols relying on fixed topologies, this protocol adapts to the dynamic nature of entanglement, enhancing routing efficiency and resilience. The protocol utilizes a graph-based representation of the quantum network and employs algorithms for entanglement assessment and path optimization. Mathematical models are presented to formalize the routing process, including the calculation of entanglement fidelity and path cost. The proposed system demonstrates improved routing performance and fault tolerance compared to static routing schemes. The key contribution is a dynamic, adaptive routing strategy that leverages the inherent properties of quantum networks for reliable quantum information transmission.
Routing classical and quantum information is a fundamental task for quantum information technologies and processes. Here, we consider information encoded in the position of a quantum walker on a graph, and we design an optimal structure to achieve perfect quantum routing, exploiting chirality and weighting of the edges. The topology, termed the lily graph, enables perfect (i.e., with fidelity one) and robust routing of classical (localized) or quantum (superposition) states of the walker to nnn different, orthogonal, spatial regions of the graph, corresponding to the nnn possible outputs of the device. The routing time is independent of the input signal and the number of outputs, making our scheme a robust and scalable solution for all quantum networks.
This paper proposes a novel approach to information transmission leveraging the unique properties of quantum entanglement within a topological network architecture. The core idea is to construct a network of entangled nodes, enabling efficient and robust information routing. We introduce a framework for encoding information using entangled states and propose a routing protocol based on entanglement swapping and entanglement protection techniques to mitigate the effects of node failures, a significant limitation in conventional quantum communication. The resulting system offers the potential to surpass the fundamental limits imposed by classical physics in terms of information transfer rates and resilience. The system's performance is analyzed using key metrics, demonstrating its capability for high-capacity, fault-tolerant communication. This research contributes to the development of advanced quantum communication networks with enhanced security and scalability.