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:2502.12739 · Entropy

Scalable Structure for Chiral Quantum Routing

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

Published May 5, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.3390/e27050498

Related papers

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

Routing Qubits on Noisy Networks

Claudia Benedetti, Giovanni Ragazzi, Simone Cavazzoni +2 more

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.

quant-pharXiv:2601.14824•Jan 22, 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

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

Quantum Entanglement-Routed Algorithms

Jincheng Zhang

This paper proposes a novel approach to network routing leveraging the unique properties of quantum entanglement. The core claim is that quantum entanglement provides the potential for instantaneous information routing, surpassing the limitations imposed by classical communication channels. The proposed algorithm, a entanglement-based routing method, encodes data across multiple entangled quantum particles, exploiting the correlations inherent in entanglement to achieve instantaneous data transmission and routing within a network. This approach offers the possibility of drastically improved throughput and enhanced security compared to conventional routing protocols. The theoretical framework presented demonstrates the potential for a fundamentally new paradigm in network architecture and communication. Key parameters influencing performance are analyzed, including entanglement fidelity, number of entangled particles, and network topology. The ultimate goal is to establish a robust and scalable quantum routing system.

•Sep 2, 2026•0 citations

Quantum Routing in Quantum Networks Using Time-Encoded Signals

Jincheng Zhang

This paper proposes a novel routing protocol for quantum networks leveraging the principles of time-encoded quantum signals. The core idea is to utilize the inherent temporal correlations within quantum networks to enable efficient routing and forwarding of quantum information. This approach addresses the significant challenge of routing in quantum networks, where traditional routing protocols based on classical control signals are inapplicable due to the no-cloning theorem and the fragility of quantum states. The proposed protocol utilizes precisely timed pulses of quantum information to navigate the network, effectively creating a "temporal address" for each quantum state. We explore the mathematical framework underpinning this protocol, focusing on the key concepts of quantum state tomography, time-bin encoding, and the resulting network topology. The theoretical analysis demonstrates the potential for high-throughput quantum routing, offering a pathway to improve the overall performance and scalability of quantum networks. The protocol's efficiency hinges on precise timing synchronization and robust error correction strategies, which we briefly discuss.

•Sep 3, 2026•0 citations
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.
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.
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.
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.
This paper proposes a novel approach to network routing leveraging the unique properties of quantum entanglement. The core claim is that quantum entanglement provides the potential for instantaneous information routing, surpassing the limitations imposed by classical communication channels. The proposed algorithm, a entanglement-based routing method, encodes data across multiple entangled quantum particles, exploiting the correlations inherent in entanglement to achieve instantaneous data transmission and routing within a network. This approach offers the possibility of drastically improved throughput and enhanced security compared to conventional routing protocols. The theoretical framework presented demonstrates the potential for a fundamentally new paradigm in network architecture and communication. Key parameters influencing performance are analyzed, including entanglement fidelity, number of entangled particles, and network topology. The ultimate goal is to establish a robust and scalable quantum routing system.
This paper proposes a novel routing protocol for quantum networks leveraging the principles of time-encoded quantum signals. The core idea is to utilize the inherent temporal correlations within quantum networks to enable efficient routing and forwarding of quantum information. This approach addresses the significant challenge of routing in quantum networks, where traditional routing protocols based on classical control signals are inapplicable due to the no-cloning theorem and the fragility of quantum states. The proposed protocol utilizes precisely timed pulses of quantum information to navigate the network, effectively creating a "temporal address" for each quantum state. We explore the mathematical framework underpinning this protocol, focusing on the key concepts of quantum state tomography, time-bin encoding, and the resulting network topology. The theoretical analysis demonstrates the potential for high-throughput quantum routing, offering a pathway to improve the overall performance and scalability of quantum networks. The protocol's efficiency hinges on precise timing synchronization and robust error correction strategies, which we briefly discuss.