Quantum Programming of the Satisfiability Problem with Rydberg Atom Graphs
Quantum Physics
2024-07-03 v1 Atomic Physics
Abstract
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here an experiment is presented to demonstrate the use of Rydberg atoms to solve (i.e., to program and obtain the solution of) the satisfiability (3-SAT) problem, which is the prototypical NP-complete problem allowing general programming of all NP problems. Boolean expressions of the 3-SAT problem are programmed with the blockade interactions of Rydberg atom graphs and their many-body ground states are experimentally obtained, to determine the satisfiabilities of the given 3-SAT problem instances quantum mechanically.
Keywords
Cite
@article{arxiv.2302.14369,
title = {Quantum Programming of the Satisfiability Problem with Rydberg Atom Graphs},
author = {Seokho Jeong and Minhyuk Kim and Minki Hhan and Jaewook Ahn},
journal= {arXiv preprint arXiv:2302.14369},
year = {2024}
}
Comments
6 pages, 4 figures