Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms

• URL: http://arxiv.org/abs/2507.21011v1
• Date: Mon, 28 Jul 2025 17:22:53 GMT
• Title: Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms
• Authors: Gabriel Almeida, Raul Santos, Lara Janiurek, Yasser Omar,
• Abstract summary: We propose a general implementation of staggered quantum walks with Rydberg atoms, with a particular focus on spatial networks.<n>We also present an efficient algorithm for constructing the tessellations required for the staggered quantum walk.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 quadratic speedup in spatial search algorithms.

Related papers

• Hardware-Efficient Rydberg Atomic Quantum Solvers for NP Problems [3.842223753702757]
  We construct a generic quantum solver for NP problems based on Grover's search algorithm, specifically tailored for Rydberg-atom quantum computing platforms.<n>We design the quantum oracles in the search algorithm using parallelizable single-qubit and multi-qubit entangling gates in the Rydberg atom system.<n>Our construction indicates that atomic qubits offer favorable circuit depth scaling compared to quantum processors with fixed local connectivity.
  arXiv  Detail & Related papers  (2025-07-30T13:48:57Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Chiral quantum router with Rydberg atoms [0.0]
  We exploit controlled breaking of time-reversal symmetry to realize coherent routing of quantum information in spin networks. Our results can facilitate scalable quantum information processing and communication in large arrays of Rydberg atoms.
  arXiv  Detail & Related papers  (2023-10-16T13:32:16Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Quantum control of Rydberg atoms for mesoscopic-scale quantum state and circuit preparation [0.0]
  Individually trapped Rydberg atoms show significant promise as a platform for scalable quantum simulation. We show that quantum control can be used to reliably generate fully connected cluster states and to simulate the error-correction encoding circuit.
  arXiv  Detail & Related papers  (2023-02-15T19:00:01Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Rydberg wire gates for universal quantum computation [3.785859802736061]
  Rydberg atom arrays offer flexible geometries of strongly-interacting neutral atoms. We consider a gate-based quantum computing scheme for a Rydberg-atom array.
  arXiv  Detail & Related papers  (2022-03-03T07:19:29Z)
• Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer [0.0]
  Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays. We demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits.
  arXiv  Detail & Related papers  (2021-12-29T15:02:43Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Universal quantum computation and quantum error correction with ultracold atomic mixtures [47.187609203210705]
  We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates. One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information. We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
  arXiv  Detail & Related papers  (2020-10-29T20:17:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.