Peak state transfer in continuous quantum walks

TL;DR

This paper introduces peak state transfer in continuous quantum walks, providing spectral characterization, explicit transfer timing, and examples of long-distance transfer with high probability, improving quantum wire efficiency.

Contribution

It defines and analyzes peak state transfer, offering spectral criteria and constructing weighted path graphs with high-probability transfer over long distances.

Findings

Peak state transfer does not require near-perfect fidelity.

Constructed weighted path graphs with transfer probability approaching 0.78.

Graphs enable long-distance transfer with exponentially improved sensitivity.

Abstract

We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily close to 1, but crucially allows for an explicit determination of the time at which transfer occurs. We provide a spectral characterization of peak state transfer, which allows us to find many examples of peak state transfer, and we also establish tight lower bounds on fidelity and success probability. As a central example, we construct a family of weighted path graphs that admit peak state transfer over arbitrarily long distances with transfer probability approaching $\pi/4 \approx 0.78$. These graphs offer exponentially improved sensitivity over known perfect state transfer examples such as the weighted paths related to hypercubes, making them practical candidates for efficient quantum wires.