A Rydberg-atom implementation of staggered quantum walks on spatial networks, with a new tessellation-cover algorithm, is proposed and numerically shown to achieve O(√N) spatial search time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms
A Rydberg-atom implementation of staggered quantum walks on spatial networks, with a new tessellation-cover algorithm, is proposed and numerically shown to achieve O(√N) spatial search time.