Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Quantum optimization of maximum independent set using Rydberg atom arrays

Journal Article · · Science
 [1];  [2];  [1];  [1];  [1];  [1];  [1];  [2];  [2];  [1];  [3];  [4];  [1];  [4];  [5];  [6];  [7];  [8];  [9];  [10] more »;  [7];  [1];  [11];  [1] « less
  1. Department of Physics, Harvard University, Cambridge, MA 02138, USA.
  2. Department of Physics, Harvard University, Cambridge, MA 02138, USA.; QuEra Computing Inc., Boston, MA 02135, USA.
  3. QuEra Computing Inc., Boston, MA 02135, USA.; Department of Physics and Astronomy, University of Waterloo, Waterloo N2L 3G1, Canada.; Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada.
  4. School of Engineering and Applied Science, Harvard University, Cambridge, MA 02138, USA.
  5. Google Quantum AI, Venice, CA 90291, USA.; Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA.
  6. Department of Physics, Harvard University, Cambridge, MA 02138, USA.; School of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, USA.
  7. QuEra Computing Inc., Boston, MA 02135, USA.
  8. Department of Physics, Harvard University, Cambridge, MA 02138, USA.; Walter Burke Institute for Theoretical Physics, California Institute of Technology, Pasadena, CA 91125, USA.
  9. Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA.
  10. Institute for Theoretical Physics, University of Innsbruck, A-6020 Innsbruck, Austria.; Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, A-6020 Innsbruck, Austria.
  11. Department of Physics and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA.

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Research Organization:
Harvard Univ., Cambridge, MA (United States); Krell Institute, Ames, IA (United States)
Sponsoring Organization:
USDOE Office of Science (SC)
DOE Contract Number:
SC0019030; SC0020347; SC0021013; SC0022199
OSTI ID:
1980748
Journal Information:
Science, Vol. 376, Issue 6598; ISSN 0036-8075
Publisher:
AAAS
Country of Publication:
United States
Language:
English

References (56)

Adiabatic quantum computation journal January 2018
Ising formulations of many NP problems journal January 2014
Training a quantum optimizer journal August 2016
Self-verifying variational quantum simulation of lattice models journal May 2019
On the computational complexity of Ising spin glass models journal October 1982
The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective journal February 2013
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem journal April 2001
Zero-temperature quantum annealing bottlenecks in the spin-glass phase journal August 2016
First-Order Phase Transition in the Quantum Adiabatic Algorithm journal January 2010
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor journal February 2021
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator journal October 2020
Defining and detecting quantum speedup journal June 2014
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly journal September 2015
Unit disk graphs journal December 1990
Quantum phases of matter on a 256-atom programmable quantum simulator journal July 2021
Dipole Blockade and Quantum Information Processing in Mesoscopic Atomic Ensembles journal June 2001
Efficient Z gates for quantum computing journal August 2017
Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm journal June 2022
Probing topological spin liquids on a programmable quantum simulator journal December 2021
Quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms journal July 2021
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices journal June 2020
Dynamics of a Quantum Phase Transition journal September 2005
The finite group velocity of quantum spin systems journal September 1972
Optimization by Simulated Annealing journal May 1983
Finding near-optimal independent sets at scale journal May 2017
Equation of State Calculations by Fast Computing Machines journal June 1953
Quantum search by local adiabatic evolution journal March 2002
A fast quantum mechanical algorithm for database search conference January 1996
Quantum Simulations of Classical Annealing Processes journal September 2008
Electromagnetically induced transparency: Optics in coherent media journal July 2005
The overlap gap property: A topological barrier to optimizing over random structures journal October 2021
A quantum processor based on coherent transport of entangled atom arrays journal April 2022
Automated Accelerator Optimization Aided by Graph Neural Networks conference February 2022
Quantum Sampling Algorithms for Near-Term Devices journal September 2021
The Rectilinear Steiner Tree Problem is $NP$-Complete journal June 1977
Universality considerations in VLSI circuits journal February 1981
The CMA Evolution Strategy: A Comparing Review book January 2007
A Simplex Method for Function Minimization journal January 1965
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation journal March 1992
Simulating Quantum Computation by Contracting Tensor Networks journal January 2008
Tropical Tensor Network for Ground States of Spin Glasses journal March 2021
Universal adiabatic dynamics in the vicinity of a quantum critical point journal October 2005
Defect Formation beyond Kibble-Zurek Mechanism and Holography journal May 2015
Kibble-Zurek mechanism and infinitely slow annealing through critical points journal May 2010
Kibble–Zurek scaling and string-net coarsening in topologically ordered systems journal September 2013
Distribution of kinks in an Ising ferromagnet after annealing and the generalized Kibble-Zurek mechanism journal August 2021
Monte Carlo simulations of two-dimensional hard core lattice gases journal March 2007
Markov Chains and Mixing Times journal January 2017
Monte Carlo sampling methods using Markov chains and their applications journal April 1970
Geometric Bounds for Eigenvalues of Markov Chains journal February 1991
Density matrix formulation for quantum renormalization groups journal November 1992
Density-matrix algorithms for quantum renormalization groups journal October 1993
From density-matrix renormalization group to matrix product states journal October 2007
Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems journal March 2008
The density-matrix renormalization group in the age of matrix product states journal January 2011
Bulk and boundary quantum phase transitions in a square Rydberg atom array journal May 2022