Continuous-time quantum walk-based ansätze on neutral atom hardware
Edric Matwiejew, Jonathan Wurtz, Jing Chen, Pascal Jahan Elahi, Tommaso Macri, Ugo Varetto
TL;DR
The paper addresses the gap between abstract CTQW-based quantum algorithms and near-term hardware by implementing CTQW-based variational ansätze on a neutral-atom platform, Aquila, using constrained independent-set subspaces enforced by Rydberg blockade.It introduces phase-walk ansätze that interleave CTQW-based mixing with phase encoding, analyzes both product and bracelet target states, and develops analytic and spectral-gap-based optimization strategies to achieve high-fidelity state preparation.Experimentally, it demonstrates substantial amplification and near-optimal preparation of product states and entangled bracelet states, with scaling trends consistent with non-adiabatic CTQW predictions, while revealing hardware-imposed limits such as finite coherence time and blockade-induced phase errors.The results establish a practical pathway for translating CTQW advantages into current analog quantum devices, highlight the role of spectral gaps in enabling non-adiabatic shortcuts, and point to future improvements in hardware and graph-engineered CTQWs.Overall, this work provides a concrete demonstration of CTQW dynamics as a resource for state preparation on neutral-atom hardware and offers a framework for leveraging constrained subspaces to realize super-quadratic convergence within NISQ-era devices.
Abstract
Continuous-time quantum walks offer provable speedups for certain computational problems, yet translating these advantages to near-term hardware remains challenging. We present the first experimental demonstration of variational ansätze based on continuous-time quantum walks on an analog neutral-atom processor. For unentangled targets, we derive closed-form expressions for near-optimal control parameters that transfer directly to hardware with minimal calibration. Experiments on QuEra's Aquila processor provide the first observation of the super-quadratic convergence characteristic of efficient quantum walk algorithms, visible at low circuit depth, with theory predicting stronger speedups as hardware improves. For entangled targets, specifically symmetric superpositions in the Rydberg-blockaded subspace, we introduce an optimization protocol exploiting spectral properties of the walk dynamics. The required evolution time scales inversely with the spectral gap, offering an advantage over adiabatic protocols that scale to the square of the spectral gap. We demonstrate this scaling behavior on Aquila and verify that the prepared states are coherent superpositions via quench dynamics. This constitutes the first preparation of such symmetric entangled states on neutral-atom hardware. Our results establish a practical pathway from abstract quantum walk algorithms to analog quantum processors, demonstrating that the dynamics underlying their potential for super-quadratic quantum speedup are accessible on current devices.
