Perfect chiral quantum routing

TL;DR

This paper introduces the Lily Graph, a novel structure enabling perfect, scalable, and robust quantum routing of information with fidelity one, independent of input size or number of outputs.

Contribution

The paper presents the Lily Graph, a new topology that achieves perfect quantum routing using chirality and edge weighting, advancing quantum network design.

Findings

Achieves perfect quantum routing with fidelity one

Routing time is independent of input and output number

Provides a scalable and robust routing scheme for quantum networks

Abstract

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 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.