Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays

Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independent set problem on so-called unit-disk graphs, was s...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	PRX quantum Ročník 4; číslo 1; s. 010316
Hlavní autoři:	Nguyen, Minh-Thi, Liu, Jin-Guo, Wurtz, Jonathan, Lukin, Mikhail D., Wang, Sheng-Tao, Pichler, Hannes
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States American Physical Society (APS) 14.02.2023 American Physical Society
Témata:	Atoms Boolean satisfiability problem CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS NP-hard problems Quantum information architectures & platforms Quantum software Rydberg atoms & molecules
ISSN:	2691-3399, 2691-3399
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independent set problem on so-called unit-disk graphs, was shown to be efficiently encodable in such a quantum system. Here, we extend the classes of problems that can be efficiently encoded in Rydberg arrays by constructing explicit mappings from a wide class of problems to maximum-weighted independent set problems on unit-disk graphs, with at most a quadratic overhead in the number of qubits. We analyze several examples, including maximum-weighted independent set on graphs with arbitrary connectivity, quadratic unconstrained binary optimization problems with arbitrary or restricted connectivity, and integer factorization. Numerical simulations on small system sizes indicate that the adiabatic time scale for solving the mapped problems is strongly correlated with that of the original problems. Our work provides a blueprint for using Rydberg atom arrays to solve a wide range of combinatorial optimization problems with arbitrary connectivity, beyond the restrictions imposed by the hardware geometry.
Bibliografie:	USDOE SC0021013; 101041435 USDOE Office of Science (SC)
ISSN:	2691-3399 2691-3399
DOI:	10.1103/PRXQuantum.4.010316