Scalable Structure For Chiral Quantum Routing

TL;DR

This paper introduces a scalable quantum routing structure using quantum walks on a complete graph, enabling near-perfect, selective delivery of quantum and classical information to multiple receivers with robustness and minimal routing time.

Contribution

It presents a novel, scalable quantum routing architecture based on quantum walks that achieves high fidelity and robustness, adaptable to many receivers and resilient to noise.

Findings

Achieves near-unitary routing fidelity with a single parameter tuning.

Supports an arbitrary number of receivers in a scalable network.

Routing performance remains robust under static and dynamic noise.

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 dimension and input state, and the routing performance is robust under static and dynamic noise, at least for short time.