Finding the Maximum Independent Sets of Platonic Graphs Using Rydberg Atoms

Byun, Andrew; Kim, Minhyuk; Ahn, Jaewook

doi:10.1103/prxquantum.3.030305

Cited by 26 publications

(2 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For Ω = 0, Δ < 0, the many-body ground state is the paramagnetic g ⊗ N . When Ω = 0, 0 < Δ < U diag , the many-body ground state is in the MIS phase 10 .…”

Section: Methodsmentioning

confidence: 99%

“…In that regards, Rydberg-atom systems could perform adiabatic quantum computation (AQC) for the MIS problem in such a way that a target many-body ground state is prepared adiabatically from an easily preparable initial ground state. There are several recent experiments computing the solution of the MIS problem on the Rydberg-atom system by AQC 8 – 10 .…”

Section: Background and Summarymentioning

confidence: 99%

See 1 more Smart Citation

Quantum computing dataset of maximum independent set problem on king lattice of over hundred Rydberg atoms

Kim,

Park

et al. 2024

Sci Data

Self Cite

View full text Add to dashboard Cite

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 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.

show abstract

“…For Ω = 0, Δ < 0, the many-body ground state is the paramagnetic g ⊗ N . When Ω = 0, 0 < Δ < U diag , the many-body ground state is in the MIS phase 10 .…”

Section: Methodsmentioning

confidence: 99%

Section: Background and Summarymentioning

confidence: 99%

Quantum computing dataset of maximum independent set problem on king lattice of over hundred Rydberg atoms

Kim,

Park

et al. 2024

Sci Data

Self Cite

View full text Add to dashboard Cite

show abstract

Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems

Byun,

Jung,

Kim

et al. 2024

Adv Quantum Tech

View full text Add to dashboard Cite

There is a growing interest in harnessing the potential of the Rydberg‐atom system to address complex combinatorial optimization challenges. Here an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg‐atom graphs is presented. The Rydberg‐atom graphs are configurations of neutral atoms organized into mathematical graphs, facilitated by programmable optical tweezers, and designed to exhibit many‐body ground states that correspond to the maximum independent set (MIS) of their respective graphs. Four elementary Rydberg‐atom subgraph components are developed, not only to eliminate the need of local control but also to be robust against interatomic distance errors, while serving as the building blocks sufficient for formulating generic QUBO graphs. To validate the feasibility of the approach, a series of Rydberg‐atom experiments selected to demonstrate proof‐of‐concept operations of these building blocks are conducted. These experiments illustrate how these components can be used to programmatically encode the QUBO problems to Rydberg‐atom graphs and, by measuring their many‐body ground states, how their QUBO solutions are determined subsequently.

show abstract

Atom cavity encoding for NP-complete problems

Ye,

2024

Quantum Front

View full text Add to dashboard Cite

We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous nondeterministic polynomial-time complete (NP-complete) problems, encompassing the majority of Karp’s 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented.

show abstract

Finding the Maximum Independent Sets of Platonic Graphs Using Rydberg Atoms

Cited by 26 publications

References 39 publications

Quantum computing dataset of maximum independent set problem on king lattice of over hundred Rydberg atoms

Quantum computing dataset of maximum independent set problem on king lattice of over hundred Rydberg atoms

Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems

Atom cavity encoding for NP-complete problems

Contact Info

Product

Resources

About