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
- Matteo G. A. Paris (ORCID: https://orcid.org/0000-0001-7523-7289)
- Claudia Benedetti (ORCID: https://orcid.org/0000-0002-8112-4907)
- Simone Cavazzoni (ORCID: https://orcid.org/0000-0001-7975-5059)
- Paolo Bordone (ORCID: https://orcid.org/0000-0002-4313-0732)
- Giovanni Ragazzi (ORCID: https://orcid.org/0009-0007-0980-4741)
Institutions
- University of Modena and Reggio Emilia (IT)
- University of Milan (IT)
- Istituto Nanoscienze (IT)
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