Routing Qubits on Noisy Networks
Claudia Benedetti, Giovanni Ragazzi, Simone Cavazzoni, Paolo Bordone, Matteo G. A. Paris
TL;DR
This work tackles the problem of robust quantum routing in networks engineered for ideal transfer by analyzing a Lily Graph CTQW router. It models qubit routing as a single-excitation dynamics problem with input qubits encoded on two nodes and multiple outputs, and examines resilience to static and dynamical phase and weight noise using von Mises, Gaussian and Ornstein-Uhlenbeck processes. The key finding is that high routing fidelity persists near a common routing time, with the first fidelity peak typically occurring around the routing moment, especially for moderate numbers of outputs; phase noise mainly alters peak heights while weight noise largely reduces peak magnitude, making weight fluctuations the dominant degradation mechanism for larger port counts. The results demonstrate practical guidance for designing scalable, noisy quantum routers and naturally extend to long-range routing and qudit routing, highlighting the universality of the routing time and the crucial role of chirality.
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.
