Scalable Structure for Chiral Quantum Routing

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.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2025-05-05
DOI
https://doi.org/10.3390/e27050498
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Structure for Chiral Quantum Routing

Matteo G. A. Paris, Claudia Benedetti, Simone Cavazzoni, Paolo Bordone et al.
2 citations
Entropy
Quantum Computing Algorithms and Architecture
4.96
article

Scalable Structure for Chiral Quantum Routing

Matteo G. A. Paris, Claudia Benedetti, Simone Cavazzoni, Paolo Bordone, Giovanni Ragazzi
article en
2 citations

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.

EntropyVol. 27(5)
University of Modena and Reggio Emilia (IT), University of Milan (IT), Istituto Nanoscienze (IT)
Openalex Percentile: Top 5%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Scalable Structure for Chiral Quantum Routing — Matteo G. A. Paris, Claudia Benedetti, et al. · Entropy (2025) | TGRS Research Map | TGRS