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:2302.08472 · AVS Quantum Science

Quantum routing of information using chiral quantum walks

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

Published Apr 27, 2023• 18 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1116/5.0146805

Related papers

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

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

Controlled information transfer in continuous-time chiral quantum walks

Aeysha Khalique, A. Sett, Jingbo B. Wang +1 more

Abstract In this paper we investigate properties of continuous time chiral quantum walks, which possess complex valued edge weights in the underlying graph structure, together with an initial Gaussian wavefunction spread over a number of vertices. We demonstrate that, for certain graph topology and phase matching conditions, we are able to direct the flow of probability amplitudes in a specific direction inside the graph network. We design a quantum walk graph analogue of an optical circulator which is a combination of a cycle and semi-infinite chain graphs. Excitations input into the circulator from a semi-infinite chain are routed in a directionally biased fashion to output to a different semi-infinite chain. We examine in detail a two port circulator graph which spatially separates excitations flowing back in forth between the two semi-finite chains to directionally occupy the top or bottom half of the cycle portion of the circulator. This setup can be used, for example, to detect non-Markovian processes, which leads to information and energy back-flow from the bath back into the system.

New Journal of Physics•Jul 16, 2021•6 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

Enhanced quantum transport in chiral quantum walks

Emilio Annoni, Massimo Frigerio, Matteo G. A. Paris

Abstract Quantum transport across discrete structures is a relevant topic that can be suitably studied in the context of continuous-time quantum walks. The addition of phase degrees of freedom, leading to chiral quantum walks, can also account for directional transport on graphs with loops. We discuss criteria for quantum transport and study the enhancement that can be achieved with chiral quantum walks on chain-like graphs, exploring different topologies for the chain units and optimizing over the phases. We select three candidate structures with optimal performances and we investigate their transport behaviour with Krylov reduction. While one of them can be reduced to a weighted line with minor couplings modulation, the other two are truly chiral quantum walks, with enhanced transport probability over long chain structures.

arXiv:2308.14747•Quantum Information Processing•Mar 23, 2024•6 citations

Chiral quantum router with Rydberg atoms

Nikolaos E. Palaiodimopoulos, Simon Ohler, Michael Fleischhauer +1 more

We exploit controlled breaking of time-reversal symmetry to realize coherent routing of quantum information in spin networks. The key component of our scheme is a spin triangle whose chirality is determined by the quantum state of a control qubit which thus defines the propagation direction, or a superposition thereof, of the quantum information. We then consider a particular realization of a coherent router using Rydberg atoms. Our results can facilitate scalable quantum information processing and communication in large arrays of Rydberg atoms.

arXiv:2310.10390•Physical Review A•Mar 26, 2024•13 citations
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.
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.
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 In this paper we investigate properties of continuous time chiral quantum walks, which possess complex valued edge weights in the underlying graph structure, together with an initial Gaussian wavefunction spread over a number of vertices. We demonstrate that, for certain graph topology and phase matching conditions, we are able to direct the flow of probability amplitudes in a specific direction inside the graph network. We design a quantum walk graph analogue of an optical circulator which is a combination of a cycle and semi-infinite chain graphs. Excitations input into the circulator from a semi-infinite chain are routed in a directionally biased fashion to output to a different semi-infinite chain. We examine in detail a two port circulator graph which spatially separates excitations flowing back in forth between the two semi-finite chains to directionally occupy the top or bottom half of the cycle portion of the circulator. This setup can be used, for example, to detect non-Markovian processes, which leads to information and energy back-flow from the bath back into the system.
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 Quantum transport across discrete structures is a relevant topic that can be suitably studied in the context of continuous-time quantum walks. The addition of phase degrees of freedom, leading to chiral quantum walks, can also account for directional transport on graphs with loops. We discuss criteria for quantum transport and study the enhancement that can be achieved with chiral quantum walks on chain-like graphs, exploring different topologies for the chain units and optimizing over the phases. We select three candidate structures with optimal performances and we investigate their transport behaviour with Krylov reduction. While one of them can be reduced to a weighted line with minor couplings modulation, the other two are truly chiral quantum walks, with enhanced transport probability over long chain structures.
We exploit controlled breaking of time-reversal symmetry to realize coherent routing of quantum information in spin networks. The key component of our scheme is a spin triangle whose chirality is determined by the quantum state of a control qubit which thus defines the propagation direction, or a superposition thereof, of the quantum information. We then consider a particular realization of a coherent router using Rydberg atoms. Our results can facilitate scalable quantum information processing and communication in large arrays of Rydberg atoms.