Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 43 min ago
Peer-reviewedCC BY 4.0Quantum

Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms

  • Gabriel Almeida1,2
  • Raul Santos3
  • Lara Janiurek2,4
  • Yasser Omar1,2,5
5 affiliations
  1. 1Instituto Superior Técnico, Universidade de Lisboa, Portugal
  2. 2PQI – Portuguese Quantum Institute, Portugal
  3. 3Eindhoven University of Technology, Netherlands
  4. 4University of Strathclyde, Scotland, United Kingdom
  5. 5Physics of Information and Quantum Technologies Group, Centro de Física e Engenharia de Materiais Avançados (CeFEMA), Portugal
Open at sourceDOICite

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.

Related

  1. p-Adic Dirac Equations, Continuous-Time Quantum Walks, and Quantum Networks
    W. A. Zúñiga-Galindo
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Spatial correlations of photons interacting via transverse Rydberg blockade
    Bankim Chandra Das, Daniil Svirskiy, Matthias Metternich +3
    arXivPreprintCC BY 4.0Full textAtomic, molecular & optical physicsQuantum physics & quantum informationarXiv
  3. Recovery Random Walks for Extreme Events on Complex Networks
    Karan Singh, Narendran R. V., V. K. Chandrasekar +1
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  4. Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
    Zachary Goisman, Matthew L. Stevens, Maxwell Goisman +7
    Optics ExpressPeer-reviewedPublisher termsFull textOptics & photonicsCrossref
  5. Representation of arbitrary rational functions and polynomials by non-Foster resistor-capacitor-inductor networks
    Andrew Mackay
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptics & photonicsarXiv

Cite

BibTeXRIS
BibTeX
@article{almeida2026quantum,
  title = {{Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms}},
  author = {Gabriel Almeida and Raul Santos and Lara Janiurek and Yasser Omar},
  journal = {Quantum},
  year = {2026},
  month = oct,
  doi = {10.22331/q-2026-10-13-2235},
  url = {https://quantum-journal.org/papers/q-2026-10-13-2235/},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms
AU  - Gabriel Almeida
AU  - Raul Santos
AU  - Lara Janiurek
AU  - Yasser Omar
PY  - 2026
DA  - 2026/10/13
JO  - Quantum
DO  - 10.22331/q-2026-10-13-2235
UR  - https://quantum-journal.org/papers/q-2026-10-13-2235/
AB  - 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.
SN  - 2521-327X
ER  -