- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Quantum compilation toolkit for Rydberg atom arrays with implications for problem hardness and quantum speedups

Martin J. A. Schuetz1,2,*, Ruben S. Andrist1,*, Grant Salton1,2, Romina Yalovetzky3, Rudy Raymond3, Yue Sun3, Atithi Acharya3, Shouvanik Chakrabarti3, Marco Pistoia3,† et al.

Helmut G. Katzgraber1,†

  • *These authors contributed equally to this work.
  • †These authors acted as Co-PIs.
PDF

Phys. Rev. Research 7, 033107 – Published 1 August, 2025

DOI: https://doi.org/10.1103/7dkh-crjj

Abstract

We propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end-to-end pipeline involves three core components to efficiently map generic MIS instances onto Rydberg arrays with unit-disk connectivity, with modules for graph reduction, hardware compatibility checks, and graph embedding. The first module (reducer) provides hardware-agnostic and deterministic reduction logic that iteratively reduces the problem size via lazy clique removals. We find that real-world networks can typically be reduced by orders of magnitude on subsecond timescales, thus significantly cutting down the eventual load for quantum devices. Moreover, we show that reduction techniques may be an important tool in the ongoing search for potential quantum speedups, given their ability to identify hard problem instances. In particular, for Rydberg-native MIS instances, we observe signatures of an easy-hard-easy transition and quantify a critical degree indicating the onset of a hard problem regime. The second module (compatibility checker) implements a hardware compatibility checker that quickly determines whether a given input graph may be compatible with the restrictions imposed by Rydberg quantum hardware. The third module (embedder) describes hardware-efficient graph embedding routines to generate (approximate) encodings with controllable overhead and optimized ancilla placements. We exemplify our pipeline with experiments run on the QuEra Aquila device available on Amazon Braket. In aggregate, our work provides a set of tools that extends the class of problems that can be tackled with near-term Rydberg atom arrays.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (85)

  1. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Courier Corporation, North Chelmsford, MA, 1998).
  2. B. Korte and J. Vygen, Combinatorial Optimization (Springer, New York, 2012), Vol. 2.
  3. J. Wurtz, P. L. S. Lopes, N. Gemelke, A. Keesling, and S. Wang, Industry applications of neutral-atom quantum computing solving Independent Set problems, arXiv:2205.08500.
  4. W. K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68, 1497 (1980).
  5. Y. Dong, A. V. Goldberg, A. Noe, N. Parotsidis, M. G. C. Resende, and Q. Spaen, A metaheuristic algorithm for large maximum weight independent set problems, Networks 85, 91 (2025).
  6. V. Boginski, S. Butenko, and P. M. Pardalos, Statistical analysis of financial networks, Comput. Stat. Data Anal. 48, 431 (2005).
  7. A. Kalra, F. Qureshi, and M. Tisi, Portfolio asset identification using graph algorithms on a quantum annealer, SSRN (2018).
  8. D. Herman, C. Googin, X. Liu, Y. Sun, A. Galda, I. Safro, M. Pistoia, and Y. Alexeev, Quantum computing for finance, Nat. Rev. Phys. 5, 450 (2023).
  9. A. Abbas, A. Ambainis, B. Augustino, A. Bärtschi, H. Buhrman, C. Coffrin, G. Cortiana, V. Dunjko, D. J. Egger, B. G. Elmegreen et al., Challenges and opportunities in quantum optimization, Nat. Rev. Phys. 6, 718 (2024).
  10. T. Kadowaki and H. Nishimori, Quantum annealing in the transverse ising model, Phys. Rev. E 58, 5355 (1998).
  11. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, arXiv:quant-ph/0001106.
  12. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science 292, 472 (2001).
  13. A. Das and B. K. Chakrabarti, Colloquium: Quantum annealing and analog quantum computation, Rev. Mod. Phys. 80, 1061 (2008).
  14. P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. Oliver, Perspectives of quantum annealing: Methods and implementations, Rep. Prog. Phys. 83, 054401 (2020).
  15. E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028.
  16. L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Phys. Rev. X 10, 021067 (2020).
  17. A. Lucas, Ising formulations of many NP problems, Front. Phys. 2, 5 (2014).
  18. F. Glover, G. Kochenberger, and Y. Du, Quantum bridge analytics I: A tutorial on formulating and using QUBO models, 4OR 17, 335 (2019).
  19. H. Pichler, S.-T. Wang, L. Zhou, S. Choi, and M. D. Lukin, Quantum optimization for maximum independent set using Rydberg atom arrays, arXiv:1808.10816.
  20. H. Pichler, S.-T. Wang, L. Zhou, S. Choi, and M. D. Lukin, Computational complexity of the Rydberg Blockade in two dimensions, arXiv:1809.04954.
  21. M. F. Serret, B. Marchand, and T. Ayral, Solving optimization problems with Rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks, Phys. Rev. A 102, 052617 (2020).
  22. S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Bluvstein, G. Semeghini, A. Omran, J.-G. Liu, R. Samajdar et al., Quantum optimization of maximum independent set using Rydberg atom arrays, Science 376, 1209 (2022).
  23. M. Cain, S. Chattopadhyay, J.-G. Liu, R. Samajdar, H. Pichler, and M. D. Lukin, Quantum speedup for combinatorial optimization with flat energy landscapes, arXiv:2306.13123.
  24. B. F. Schiffer, D. S. Wild, N. Maskara, M. Cain, M. D. Lukin, and R. Samajdar, Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization, Phys. Rev. Res. 6, 013271 (2024).
  25. J. R. Finžgar, M. J. A. Schuetz, J. K. Brubaker, H. Nishimori, and H. G. Katzgraber, Designing quantum annealing schedules using bayesian optimization, Phys. Rev. Res. 6, 023063 (2024).
  26. J. R. Finžgar, A. Kerschbaumer, M. J. Schuetz, C. B. Mendl, and H. G. Katzgraber, Quantum-informed recursive optimization algorithms, PRX Quantum 5, 020327 (2024).
  27. K. Kim, M. Kim, J. Park, A. Byun, and J. Ahn, Quantum computing dataset of maximum independent set problem on king lattice of over hundred Rydberg atoms, Sci. Data 11, 111 (2024).
  28. R. S. Andrist, M. J. A. Schuetz, P. Minssen, R. Yalovetzky, S. Chakrabarti, D. Herman, N. Kumar, G. Salton, R. Shaydulin, Y. Sun et al., Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups, Phys. Rev. Res. 5, 043277 (2023).
  29. M. D. Lukin, M. Fleischhauer, R. Cote, L. M. Duan, D. Jaksch, J. I. Cirac, and P. Zoller, Dipole Blockade and quantum information processing in mesoscopic atomic ensembles, Phys. Rev. Lett. 87, 037901 (2001).
  30. H. Levine, A. Keesling, G. Semeghini, A. Omran, T. T. Wang, S. Ebadi, H. Bernien, M. Greiner, V. Vuletić, H. Pichler et al., Parallel implementation of high-fidelity multiqubit gates with neutral atoms, Phys. Rev. Lett. 123, 170503 (2019).
  31. M. Saffman, T. G. Walker, and K. Mølmer, Quantum information with Rydberg atoms, Rev. Mod. Phys. 82, 2313 (2010).
  32. B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discr. Math. 86, 165 (1990).
  33. M. S. Könz, W. Lechner, H. G. Katzgraber, and M. Troyer, Embedding overhead scaling of optimization problems in quantum annealing, PRX Quantum 2, 040322 (2021).
  34. P. I. Bunyk, E. M. Hoskinson, M. W. Johnson, E. Tolkacheva, F. Altomare, A. J. Berkley, R. Harris, J. P. Hilton, T. Lanting, A. J. Przybysz et al., Architectural considerations in the design of a superconducting quantum annealing processor, IEEE Trans. Appl. Supercond. 24, 1 (2014).
  35. W. Vinci, T. Albash, G. Paz-Silva, I. Hen, and D. A. Lidar, Quantum annealing correction with minor embedding, Phys. Rev. A 92, 042310 (2015).
  36. Y. Sugie, Y. Yoshida, N. Mertig, T. Takemoto, H. Teramoto, A. Nakamura, I. Takigawa, S.-I. Minato, M. Yamaoka, and T. Komatsuzaki, Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes, Soft Comput. 25, 1731 (2021).
  37. A. Byun, M. Kim, and J. Ahn, Finding the maximum independent sets of platonic graphs using Rydberg atoms, PRX Quantum 3, 030305 (2022).
  38. A. Byun, J. Jung, K. Kim, M. Kim, S. Jeong, H. Jeong, and J. Ahn, Rydberg-atom graphs for quadratic unconstrained binary optimization problems, Adv. Quantum Technol. 7, 2300398 (2024).
  39. M. Kim, K. Kim, J. Hwang, E.-G. Moon, and J. Ahn, Rydberg quantum wires for maximum independent set problems, Nat. Phys. 18, 755 (2022).
  40. C. Dlaska, K. Ender, G. B. Mbeng, A. Kruckenhauser, W. Lechner, and R. van Bijnen, Quantum optimization via four-body Rydberg gates, Phys. Rev. Lett. 128, 120503 (2022).
  41. M.-T. Nguyen, J.-G. Liu, J. Wurtz, M. D. Lukin, S.-T. Wang, and H. Pichler, Quantum optimization with arbitrary connectivity using Rydberg atom arrays, PRX Quantum 4, 010316 (2023).
  42. A. G. de Oliveira, E. Diamond-Hitchcock, D. M. Walker, M. T. Wells-Pestell, G. Pelegrí, C. J. Picken, G. P. A. Malcolm, A. J. Daley, J. Bass, and J. D. Pritchard, Demonstration of weighted graph optimization on a Rydberg-atom array using local light shifts, PRX Quantum 6, 010301 (2025).
  43. D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner et al., A quantum processor based on coherent transport of entangled atom arrays, Nature (London) 604, 451 (2022).
  44. D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter et al., Logical quantum processor based on reconfigurable atom arrays, Nature (London) 626, 58 (2024).
  45. S. Butenko, P. Pardalos, I. Sergienko, V. Shylo, and P. Stetsyuk, Finding maximum independent sets in graphs arising from coding theory, in Proceedings of the ACM Symposium on Applied Computing (SAC'02) (ACM Press, New York, 2002), pp. 542–546.
  46. S. Butenko and S. Trukhanov, Using critical sets to solve the maximum independent set problem, Oper. Res. Lett. 35, 519 (2007).
  47. D. Strash, in Computing and Combinatorics, edited by T. N. Dinh and M. T. Thai (Springer International, Cham, 2016), pp. 345–356.
  48. D. Hespe, C. Schulz, and D. Strash, Scalable kernelization for maximum independent sets, ACM J. Exp. Algor. 24, 1 (2019).
  49. S. Lamm, C. Schulz, D. Strash, R. Williger, and H. Zhang, Exactly solving the maximum weight independent set problem on large real-world graphs, in 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX) (Society for Industrial and Applied Mathematics, 2019), pp. 144–158.
  50. A. K. McCallum, K. Nigam, J. Rennie, and K. Seymore, Automating the construction of internet portals with machine learning, Inf. Retriev. 3, 127 (2000).
  51. G. Namata, B. London, L. Getoor, and B. Huang, in Proceedings of the 2012 International Workshop on Mining and Learning with Graphs (Edinburgh, UK, 2012), p. 8.
  52. J. Wurtz, A. Bylinskii, B. Braverman, J. Amato-Grill, S. H. Cantu, F. Huber, A. Lukin, F. Liu, P. Weinberg, J. Long et al., Aquila: QuEra's 256-qubit neutral-atom quantum computer, arXiv:2306.11727.
  53. F. Gyger, M. Ammenwerth, R. Tao, H. Timme, S. Snigirev, I. Bloch, and J. Zeiher, Continuous operation of large-scale atom arrays in optical lattices, Phys. Rev. Res. 6, 033104 (2024).
  54. H. J. Manetsch, G. Nomura, E. Bataille, K. H. Leung, X. Lv, and M. Endres, A tweezer array with 6100 highly coherent atomic qubits, arXiv:2403.12021.
  55. C. S. Adams, J. D. Pritchard, and J. P. Shaffer, Rydberg atom quantum technologies, J. Phys. B: At. Mol. Opt. Phys. 53, 012002 (2019).
  56. L. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G.-O. Reymond, and C. Jurczak, Quantum computing with neutral atoms, Quantum 4, 327 (2020).
  57. S. Butenko, P. Pardalos, I. Sergienko, V. Shylo, and P. Stetsyuk, Estimating the Size of Correcting Codes Using Extremal Graph Problems (Springer, New York, 2009), pp. 227–243.
  58. L. Chang, W. Li, and W. Zhang, Computing a near-maximum independent set in linear time by reducing-peeling, in Proceedings of the ACM International Conference on Management of Data (SIGMOD'17) (Association for Computing Machinery, New York, 2017), pp. 1181–1196.
  59. S. Lamm, P. Sanders, C. Schulz, D. Strash, and R. F. Werneck, Finding near-optimal independent sets at scale, J. Heurist. 23, 207 (2017).
  60. E. Großmann, S. Lamm, C. Schulz, and D. Strash, Finding near-optimal weight independent sets at scale, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'23) (ACM Press, New York, 2023), pp. 293–302.
  61. Y. Liu, T. Safavi, A. Dighe, and D. Koutra, Graph summarization methods and applications: A survey, ACM Comput. Surv. 51, 1 (2018).
  62. M. Hashemi, S. Gong, J. Ni, W. Fan, B. A. Prakash, and W. Jin, A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation, in Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (International Joint Conferences on Artificial Intelligence Organization, 2024), pp. 8058–8066.
  63. M. Lewis and F. Glover, Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis, Networks 70, 79 (2017).
  64. F. Glover, M. Lewis, and G. Kochenberger, Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems, Eur. J. Oper. Res. 265, 829 (2018).
  65. A. Narimani, S. S. C. Rezaei, and A. Zaribafiyan, Combinatorial optimization by decomposition on hybrid CPU–non-CPU solver architectures, arXiv:1708.03439.
  66. E. Pelofske, G. Hahn, and H. Djidjev, Decomposition algorithms for solving np-hard problems on a quantum annealer, J. Signal Proc. Syst. 93, 405 (2020).
  67. M. E. J. Newman, Networks: An Introduction (Oxford University Press, Oxford, UK, 2010).
  68. A. A. Chaves, M. G. C. Resende, M. J. A. Schuetz, J. K. Brubaker, H. G. Katzgraber, E. F. de Arruda, and R. M. A. Silva, A random-key optimizer for combinatorial optimization, arXiv:2411.04293.
  69. M. A. Londe, L. S. Pessoa, C. E. Andrade, and M. G. Resende, Biased random-key genetic algorithms: A review, Eur. J. Oper. Res. 321, 1 (2025).
  70. M. A. Londe, L. S. Pessoa, C. E. Andrade, and M. G. C. Resende, Early years of biased random-key genetic algorithms: A systematic review, J. Glob. Optim. (2024).
  71. M. J. Schuetz, J. K. Brubaker, H. Montagu, Y. van Dijk, J. Klepsch, P. Ross, A. Luckow, M. G. Resende, and H. G. Katzgraber, Optimization of robot-trajectory planning with nature-inspired and hybrid quantum algorithms, Phys. Rev. Appl. 18, 054045 (2022).
  72. A. A. Chaves, M. G. C. Resende, and R. M. A. Silva, A continuous-GRASP random-key optimizer, in Metaheuristics: 15th International Conference (MIC 2024) (Springer-Verlag, Berlin, 2024), pp. 15–20.
  73. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science 220, 671 (1983).
  74. S. Perseguers, Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem, Phys. Rev. Appl. 23, 064023 (2025).
  75. K. Leyton-Brown, H. H. Hoos, F. Hutter, and L. Xu, Understanding the empirical hardness of np-complete problems, Commun. ACM 57, 98 (2014).
  76. Y. Song, M. Kim, H. Hwang, W. Lee, and J. Ahn, Quantum simulation of cayley-tree Ising Hamiltonians with three-dimensional rydberg atoms, Phys. Rev. Res. 3, 013286 (2021).
  77. Y. Matsuda, H. Nishimori, and H. G. Katzgraber, Quantum annealing for problems with ground-state degeneracy, J. Phys.: Conf. Ser. 143, 012003 (2009).
  78. R. A. Rossi and N. K. Ahmed, The network data repository with interactive graph analytics and visualization, in AAAI (2015), https://networkrepository.com.
  79. M. Barthelemy, Spatial networks, Phys. Rep. 499, 1 (2011).
  80. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999)
  81. D. Barredo, V. Lienhard, S. de Léséleuc, T. Lahaye, and A. Browaeys, Synthetic three-dimensional atomic structures assembled atom by atom, Nature (London) 561, 79 (2018).
  82. D. Barredo, V. Lienhard, P. Scholl, S. de Léséleuc, T. Boulier, A. Browaeys, and T. Lahaye, Three-dimensional trapping of individual Rydberg atoms in ponderomotive bottle beam traps, Phys. Rev. Lett. 124, 023201 (2020).
  83. M. Lanthaler, C. Dlaska, K. Ender, and W. Lechner, Rydberg-blockade-based parity quantum optimization, Phys. Rev. Lett. 130, 220601 (2023).
  84. M. Lanthaler, K. Ender, C. Dlaska, and W. Lechner, Quantum optimization with globally driven neutral atom arrays, arXiv:2410.03902.
  85. J. Wurtz, S. H. Sack, and S.-T. Wang, Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms, IEEE Trans. Quantum Eng. 5, 1 (2024).

Outline

Information

Phys. Rev. Research 7, 033107– Published 1 August, 2025
  • Received 16 January 2025
  • Accepted 30 June 2025
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation