Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms

Abstract:Rydberg atoms provide a highly promising platform for quantum computation, leveraging their strong tunable interactions to encode and manipulate information in the electronic states of individual atoms. Key advantages of Rydberg atoms include scalability, reconfigurable connectivity, and native multi-qubit gates, making them particularly well-suited for addressing complex network problems. These problems can often be framed as graph-based tasks, which can be efficiently addressed using quantum walks. In this work, we propose a general implementation of staggered quantum walks with Rydberg atoms, with a particular focus on spatial networks. We also present an efficient algorithm for constructing the tessellations required for the staggered quantum walk. Finally, we demonstrate that our proposal achieves performance consistent with a quadratic speedup in spatial search algorithms.

13 pages, 6 figures. Accepted in Quantum

Quantum Physics (quant-ph); Quantum Gases (cond-mat.quant-gas); Applied Physics (physics.app-ph); Atomic Physics (physics.atom-ph)

arXiv:2507.21011 [quant-ph]

(or arXiv:2507.21011v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2507.21011 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.