Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912505897418752 |
|---|---|
| author | Almeida, Gabriel Santos, Raul Janiurek, Lara Omar, Yasser |
| author_facet | Almeida, Gabriel Santos, Raul Janiurek, Lara Omar, Yasser |
| contents | 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 quadratic speedup in spatial search algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_21011 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms Almeida, Gabriel Santos, Raul Janiurek, Lara Omar, Yasser Quantum Physics Quantum Gases Applied Physics Atomic Physics 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 quadratic speedup in spatial search algorithms. |
| title | Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms |
| topic | Quantum Physics Quantum Gases Applied Physics Atomic Physics |
| url | https://arxiv.org/abs/2507.21011 |