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• 13 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

Quantum Computing Dataset of Maximum Independent Set Problem on King's Lattice of over Hundred Rydberg Atoms

Kangheun Kim, Minhyuk Kim, Juyoung Park +2 more

Finding the maximum independent set (MIS) of a large-size graph is a nondeterministic polynomial-time (NP)-complete problem not efficiently solvable with classical computations. Here, we present a set of quantum adiabatic computing data of Rydberg-atom experiments performed to solve the MIS problem of up to 141 atoms randomly arranged on the King's lattice. A total of 582,916 events of Rydberg-atom measurements are collected for experimental MIS solutions of 733,853 different graphs. We provide the raw image data along with the entire binary determinations of the measured many-body ground states and the classified graph data, to offer bench-mark testing and advanced data-driven analyses for validation of the performance and system improvements of the Rydberg-atom approach.

arXiv:2311.13803•Nov 23, 2023•0 citations

Quantum computing with cold atoms and Rydberg blockade

Mark E. Saffman

Bulletin of the American Physical Society•Jun 11, 2015•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•0 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•14 citations
Finding the maximum independent set (MIS) of a large-size graph is a nondeterministic polynomial-time (NP)-complete problem not efficiently solvable with classical computations. Here, we present a set of quantum adiabatic computing data of Rydberg-atom experiments performed to solve the MIS problem of up to 141 atoms randomly arranged on the King's lattice. A total of 582,916 events of Rydberg-atom measurements are collected for experimental MIS solutions of 733,853 different graphs. We provide the raw image data along with the entire binary determinations of the measured many-body ground states and the classified graph data, to offer bench-mark testing and advanced data-driven analyses for validation of the performance and system improvements of the Rydberg-atom approach.
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.