Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of the Korean Physical Society

Quantum computing with Rydberg atom graphs

Minhyuk Kim, Jaewook Ahn, Yunheung Song, Jongchul Moon, Heejeong Jeong

Published Mar 13, 2023• 17 citations
Publisher
DOI
10.1007/s40042-023-00774-1

Related papers

Rydberg-Atom Quantum Computation

Jaewook Ahn

The International Commission for Optics•May 16, 2017•0 citations

Quantum Computation with Trapped Rydberg Atoms

Mark E. Saffman

Bulletin of the American Physical Society•Mar 19, 2013•0 citations

Scaling of computational order parameters in Rydberg-atom graph states

Zhangjie Qin, V. W. Scarola

Graph states are computationally powerful quantum states with many applications, including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analog simulator. We show how an always-on interaction can be used to simultaneously entangle all Rydberg atoms into a graph state. We construct and implement many-body computational order parameters for graph states using nonlocal measurement-based logic operations in the Clifford group. The order parameters measure the efficacy of entanglement to allow MBQC on graph states of any size. We parametrize finite-size scaling of these order parameters. Our results define a route to efficiently test computational power in quantum devices.

arXiv:2409.05941•Physical Review A•Apr 21, 2025•2 citations

Quantum programming of the satisfiability problem with Rydberg atom graphs

Seokho Jeong, Minhyuk Kim, Minki Hhan +2 more

Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the 3-SAT problem, the prototypical NP-complete problem which allows general programming of all NP problems. We use Rydberg atom graphs, each of which consists of Rydberg atom dimers and trimers coupled with quantum wires in the Rydberg blockade interaction regime, to formulate general Boolean expressions, and obtain their many-body ground states to determine the satisfiabilities of the given 3-SAT problem instances quantum mechanically.

arXiv:2302.14369•Physical Review Research•Oct 12, 2023•23 citations

Generation of quantum phases of matter and finding a maximum-weight independent set of unit-disk graphs using Rydberg atoms

Ahmed M. Farouk, Ilya I. Beterov, Peng Xu +1 more

Recent progress in quantum computing and quantum simulation of many-body systems with arrays of neutral atoms using Rydberg excitation has provided unforeseen opportunities towards computational advantage in solving various optimization problems. The problem of a maximum-weight independent set of unit-disk graphs is an example of an NP-hard optimization problem. It involves finding the largest set of vertices with the maximum sum of their weights for a graph which has edges connecting all pairs of vertices within a unit distance. This problem can be solved using quantum annealing with an array of interacting Rydberg atoms. For a particular graph, a spatial arrangement of atoms represents vertices of the graph, while the detuning from resonance at Rydberg excitation defines the weights of these vertices. The edges of the graph can be drawn according to the unit-disk criterion. Maximum-weight independent sets can be obtained by applying a variational quantum adiabatic algorithm. We consider driving the quantum system of interacting atoms to the many-body ground state using a nonlinear quasiadiabatic profile for sweeping the Rydberg detuning. We also propose using a quantum wire, which is a set of auxiliary atoms of a different chemical element, to mediate strong coupling between the remote vertices of the graph. We investigate this effect for different lengths of the quantum wire. We also investigate the quantum phases of matter realizing commensurate and incommensurate phases in one- and two-dimensional spatial arrangements of the atomic array.

arXiv:2405.09803•Physical Review A•Aug 27, 2024•3 citations

Quantum computing with cold atoms and Rydberg blockade

Mark E. Saffman

Bulletin of the American Physical Society•Jun 11, 2015•0 citations
Graph states are computationally powerful quantum states with many applications, including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analog simulator. We show how an always-on interaction can be used to simultaneously entangle all Rydberg atoms into a graph state. We construct and implement many-body computational order parameters for graph states using nonlocal measurement-based logic operations in the Clifford group. The order parameters measure the efficacy of entanglement to allow MBQC on graph states of any size. We parametrize finite-size scaling of these order parameters. Our results define a route to efficiently test computational power in quantum devices.
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the 3-SAT problem, the prototypical NP-complete problem which allows general programming of all NP problems. We use Rydberg atom graphs, each of which consists of Rydberg atom dimers and trimers coupled with quantum wires in the Rydberg blockade interaction regime, to formulate general Boolean expressions, and obtain their many-body ground states to determine the satisfiabilities of the given 3-SAT problem instances quantum mechanically.
Recent progress in quantum computing and quantum simulation of many-body systems with arrays of neutral atoms using Rydberg excitation has provided unforeseen opportunities towards computational advantage in solving various optimization problems. The problem of a maximum-weight independent set of unit-disk graphs is an example of an NP-hard optimization problem. It involves finding the largest set of vertices with the maximum sum of their weights for a graph which has edges connecting all pairs of vertices within a unit distance. This problem can be solved using quantum annealing with an array of interacting Rydberg atoms. For a particular graph, a spatial arrangement of atoms represents vertices of the graph, while the detuning from resonance at Rydberg excitation defines the weights of these vertices. The edges of the graph can be drawn according to the unit-disk criterion. Maximum-weight independent sets can be obtained by applying a variational quantum adiabatic algorithm. We consider driving the quantum system of interacting atoms to the many-body ground state using a nonlinear quasiadiabatic profile for sweeping the Rydberg detuning. We also propose using a quantum wire, which is a set of auxiliary atoms of a different chemical element, to mediate strong coupling between the remote vertices of the graph. We investigate this effect for different lengths of the quantum wire. We also investigate the quantum phases of matter realizing commensurate and incommensurate phases in one- and two-dimensional spatial arrangements of the atomic array.