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

Reducibility of native weighted graphs on Rydberg arrays

J. Kombe* and J. D. Pritchard†

  • *Contact author: johannes.kombe@strath.ac.uk
  • †Contact author: jonathan.pritchard@strath.ac.uk

Phys. Rev. Applied 26, 054063 – Published 20 November, 2026

DOI: https://doi.org/10.1103/vbpq-f9qf

Abstract

We investigate the classical reducibility of random unit-disk graph (UDG) instances of the maximum independent set and maximum weighted independent set problems, which can be natively realized in Rydberg atom quantum processors. Using state-of-the-art kernelization techniques, we systematically probe how far classical preprocessing can simplify such native optimization problems of varying size and connectivity. While many small or sparse instances can be fully reduced, dense graphs often retain finite irreducible kernels even after extensive reductions. Introducing vertex weights tends to increase reducibility, whereas extending the interaction range in the underlying UDG connectivity suppresses the reduction efficiency. By exploring where classical reductions cease to be effective, we aim to delineate the regime of problem instances that remain computationally demanding—those most relevant for testing and benchmarking near-term quantum optimization hardware. We find that for the remaining finite kernels, quantum execution would require non-native embeddings with substantial resource overheads, suggesting that directly running native instances may be more practical than embedding a reduced kernel.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (112)

  1. V. T. Paschos, Applications of Combinatorial Optimization (Wiley, Hoboken, NJ, USA, 2014), Vol. 3.
  2. R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, edited by R. E. Miller-J. W. Thatcher-J. D. Bohlinger (Springer US, Boston, MA, 1972), pp. 85–103.
  3. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Courier Corporation, Mineola, New York, 1998).
  4. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms (Springer, Berlin, Heidelberg, 2018) ISBN [Amazon][WorldCat].
  5. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, arXiv:quant-ph/0001106.
  6. 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).
  7. F. Glover, G. Kochenberger, R. Hennig, and Y. Du, Quantum bridge analytics I: A tutorial on formulating and using QUBO models, Ann. Oper. Res. 314, 141 (2022).
  8. T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58, 5355 (1998).
  9. A. Das and B. K. Chakrabarti, Colloquium: Quantum annealing and analog quantum computation, Rev. Mod. Phys. 80, 1061 (2008).
  10. P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Perspectives of quantum annealing: Methods and implementations, Rep. Prog. Phys. 83, 054401 (2020).
  11. A. Rajak, S. Suzuki, A. Dutta, and B. K. Chakrabarti, Quantum annealing: An overview, Phil. Trans. R. Soc. A 381, 20210417 (2023).
  12. M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, Variational quantum algorithms, Nat. Rev. Phys. 3, 625 (2021).
  13. N. Astrakhantsev, G. Mazzola, I. Tavernelli, and G. Carleo, Phenomenological theory of variational quantum ground-state preparation, Phys. Rev. Res. 5, 033225 (2023).
  14. A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nat. Commun. 5, 4213 (2014).
  15. A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets, Nature (London) 549, 242 (2017).
  16. C. Hempel, C. Maier, J. Romero, J. McClean, T. Monz, H. Shen, P. Jurcevic, B. P. Lanyon, P. Love, R. Babbush, A. Aspuru-Guzik, R. Blatt, and C. F. Roos, Quantum chemistry calculations on a trapped-ion quantum simulator, Phys. Rev. X 8, 031022 (2018).
  17. C. Kokail, C. Maier, R. van Bijnen, T. Brydges, M. K. Joshi, P. Jurcevic, C. A. Muschik, P. Silvi, R. Blatt, C. F. Roos, and P. Zoller, Self-verifying variational quantum simulation of lattice models, Nature (London) 569, 355 (2019).
  18. E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028.
  19. D. Wecker, M. B. Hastings, and M. Troyer, Progress towards practical quantum variational algorithms, Phys. Rev. A 92, 042303 (2015).
  20. J. Wurtz and P. Love, Maxcut quantum approximate optimization algorithm performance guarantees for p>1, Phys. Rev. A 103, 042612 (2021).
  21. E. Farhi, J. Goldstone, S. Gutmann, and L. Zhou, The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size, Quantum 6, 759 (2022).
  22. K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, A review on quantum approximate optimization algorithm and its variants, Phys. Rep. 1068, 1 (2024).
  23. A. Lucas, Ising formulations of many NP problems, Front. Phys. 2, 5 (2014).
  24. H. Zhang, K. Boothby, and A. Kamenev, Cyclic quantum annealing: Searching for deep low-energy states in 5000-qubit spin glass, Sci. Rep. 14, 30784 (2024).
  25. L. F. Pérez Armas, S. Creemers, and S. Deleplanque, Solving the resource constrained project scheduling problem with quantum annealing, Sci. Rep. 14, 16784 (2024).
  26. M. W. Johnson et al., Quantum annealing with manufactured spins, Nature (London) 473, 194 (2011).
  27. D. De Santis, S. Tirone, S. Marmi, and V. Giovannetti, Optimized QUBO formulation methods for quantum computing, Quantum Sci. Technol. 11, 015056 (2026).
  28. A. D. King et al., Beyond-classical computation in quantum simulation, Science 388, 199 (2025).
  29. A. Zaribafiyan, D. J. J. Marchand, and S. S. Changiz Rezaei, Systematic and deterministic graph minor embedding for Cartesian products of graphs, Quantum Inf. Process. 16, 136 (2017).
  30. E. Pelofske, Comparing three generations of D-wave quantum annealers for minor embedded combinatorial optimization problems, Quantum Sci. Technol. 10, 025025 (2025).
  31. V. Choi, Minor-embedding in adiabatic quantum computation: I. The parameter setting problem, Quantum Inf. Process. 7, 193 (2008).
  32. V. Choi, Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design, Quantum Inf. Process. 10, 343 (2011).
  33. P. Date, R. Patton, C. Schuman, and T. Potok, Efficiently embedding QUBO problems on adiabatic quantum computers, Quantum Inf. Process. 18, 117 (2019).
  34. A. Ceselli and M. Premoli, On good encodings for quantum annealer and digital optimization solvers, Sci. Rep. 13, 5628 (2023).
  35. S. Kim, S.-W. Ahn, I.-S. Suh, A. W. Dowling, E. Lee, and T. Luo, Quantum annealing for combinatorial optimization: A benchmarking study, npj Quantum Inf. 11, 77 (2025).
  36. F. A. Quinton, P. A. S. Myhr, M. Barani, P. Crespo del Granado, and H. Zhang, Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers, Sci. Rep. 15, 12733 (2025).
  37. L. F. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G.-O. Reymond, and C. Jurczak, Quantum computing with neutral atoms, Quantum 4, 327 (2020).
  38. M. Morgado and S. Whitlock, Quantum simulation and computing with Rydberg-interacting qubits, AVS Quantum Sci. 3, 023501 (2021).
  39. D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, and M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature (London) 604, 451 (2022).
  40. S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletić, and M. D. Lukin, High-fidelity parallel entangling gates on a neutral-atom quantum computer, Nature (London) 622, 268 (2023).
  41. D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature (London) 626, 58 (2024).
  42. H. J. Manetsch, G. Nomura, E. Bataille, K. H. Leung, X. Lv, and M. Endres, A tweezer array with 6100 highly coherent atomic qubits, Nature (London) 647, 60 (2025).
  43. N.-C. Chiu, E. C. Trapp, J. Guo, M. H. Abobeih, L. M. Stewart, S. Hollerith, P. L. Stroganov, M. Kalinowski, A. A. Geim, S. J. Evered, S. H. Li, X. Lyu, L. M. Peters, D. Bluvstein, T. T. Wang, M. Greiner, V. Vuletić, and M. D. Lukin, Continuous operation of a coherent 3,000-qubit system, Nature (London) 646, 1075 (2025).
  44. 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).
  45. 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).
  46. H. Levine, A. Keesling, G. Semeghini, A. Omran, T. T. Wang, S. Ebadi, H. Bernien, M. Greiner, V. Vuletić, H. Pichler, and M. D. Lukin, Parallel implementation of high-fidelity multiqubit gates with neutral atoms, Phys. Rev. Lett. 123, 170503 (2019).
  47. M. Saffman, T. G. Walker, and K. Mølmer, Quantum information with Rydberg atoms, Rev. Mod. Phys. 82, 2313 (2010).
  48. 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.
  49. 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.
  50. S. Ebadi et al., Quantum optimization of maximum independent set using Rydberg atom arrays, Science 376, 1209 (2022).
  51. 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).
  52. K. Goswami, R. Mukherjee, H. Ott, and P. Schmelcher, Solving optimization problems with local light-shift encoding on Rydberg quantum annealers, Phys. Rev. Res. 6, 023031 (2024).
  53. A. G. de Oliveira, J. Kombe, G. Pelegrí, P. Schroff, M. T. Wells-Pestell, D. M. Walker, A. J. Daley, and J. D. Pritchard, Sparse-graph optimization using weighted quantum wires in Rydberg-atom arrays, Phys. Rev. Appl. 26, 024007 (2026).
  54. 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).
  55. A. Byun, M. Kim, and J. Ahn, Finding the maximum independent sets of platonic graphs using Rydberg atoms, PRX Quantum 3, 030305 (2022).
  56. C. Dalyac, L.-P. Henry, M. Kim, J. Ahn, and L. Henriet, Exploring the impact of graph locality for the resolution of MIS with neutral atom devices, arXiv:2306.13373.
  57. 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).
  58. A. Byun, S. Jeong, and J. Ahn, Programming higher-order interactions of Rydberg atoms, Phys. Rev. A 110, 042612 (2024).
  59. S. Jeong, M. Kim, M. Hhan, J. Y. Park, and J. Ahn, Quantum programming of the satisfiability problem with Rydberg atom graphs, Phys. Rev. Res. 5, 043037 (2023).
  60. M. Lanthaler, K. Ender, C. Dlaska, and W. Lechner, Quantum optimization with globally driven neutral atom arrays, arXiv:2410.03902.
  61. 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).
  62. M. Lanthaler, C. Dlaska, K. Ender, and W. Lechner, Rydberg-blockade-based parity quantum optimization, Phys. Rev. Lett. 130, 220601 (2023).
  63. L. Bombieri, Z. Zeng, R. Tricarico, R. Lin, S. Notarnicola, M. Cain, M. D. Lukin, and H. Pichler, Quantum adiabatic optimization with Rydberg arrays: Localization phenomena and encoding strategies, PRX Quantum 6, 020306 (2025).
  64. J. Park, S. Jeong, M. Kim, K. Kim, A. Byun, L. Vignoli, L.-P. Henry, L. F. Henriet, and J. Ahn, Rydberg-atom experiment for the integer factorization problem, Phys. Rev. Res. 6, 023241 (2024).
  65. M. J. A. Schuetz, R. S. Andrist, G. Salton, R. Yalovetzky, R. Raymond, Y. Sun, A. Acharya, S. Chakrabarti, M. Pistoia, and H. G. Katzgraber, Quantum compilation toolkit for Rydberg atom arrays with implications for problem hardness and quantum speedups, arXiv:2412.14976.
  66. R. S. Andrist, M. J. 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).
  67. M. J. A. Schuetz, R. Yalovetzky, R. S. Andrist, G. Salton, Y. Sun, R. Raymond, S. Chakrabarti, A. Acharya, R. Shaydulin, M. Pistoia, and H. G. Katzgraber, qReduMIS: A quantum-informed reduction algorithm for the maximum independent set problem, arXiv:2503.12551.
  68. S. Lamm, P. Sanders, C. Schulz, D. Strash, and R. F. Werneck, Finding near-optimal independent sets at scale, J. Heuristics 23, 207 (2017).
  69. D. Hespe, C. Schulz, and D. Strash, Scalable kernelization for maximum independent sets, ACM J. Exp. Algorithmics 24, 1 (2019).
  70. 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) (2019), pp. 144–158.
  71. E. Großmann, K. Langedal, and C. Schulz, Accelerating reductions using graph neural networks and a new concurrent local search for the maximum weight independent set problem, arXiv:2412.14198.
  72. M. R. Garey and D. S. Johnson, “Strong ” NP-completeness results: Motivation, examples, and implications, J. ACM 25, 499 (1978).
  73. D. S. Johnson and M. R. Garey, Computers and Intractability: A Guide to the Theory of NP-Completeness (WH Freeman, San Francisco, California, 1979) ISBN [Amazon][WorldCat].
  74. T. Akiba and Y. Iwata, Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover, Theor. Comput. Sci. 609, 211 (2016).
  75. D. Hespe, S. Lamm, C. Schulz, and D. Strash, Wegotyoucovered: The winning solver from the pace 2019 challenge, vertex cover track, in 2020 Proceedings of the SIAM Workshop on Combinatorial Scientific Computing (CSC) (2020), pp. 1–11.
  76. S. Szabo and B. Zaválnij, Combining algorithms for vertex cover and clique search, In Proceedings of the 22nd International Multiconference INFORMATION SOCIETY–IS (2019), vol. 1, pp. 71–74.
  77. R. Plachetta and A. van der Grinten, SAT-and-reduce for vertex cover: Accelerating branch-and-reduce by SAT solving, in 2021 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) (2021), pp. 169–180.
  78. D. Hespe, S. Lamm, and C. Schorr, Targeted branching for the maximum independent set problem, arXiv:2102.01540.
  79. K. Langedal, D. Hespe, and P. Sanders, Targeted branching for the maximum independent set problem using graph neural networks, in 22nd International Symposium on Experimental Algorithms (SEA 2024), Leibniz International Proceedings in Informatics (LIPIcs), edited by L. Liberti (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2024), pp. 20:1–20:21.
  80. J. S. Warren and I. V. Hicks, Combinatorial branch-and-bound for the maximum weight independent set problem, Relatório Técnico, Texas A&M University, Citeseer 9, 17 (2006), https://www.cmor-faculty.rice.edu/~ivhicks/jeff.rev.pdf.
  81. D. V. Andrade, M. G. C. Resende, and R. F. Werneck, Fast local search for the maximum independent set problem, J. Heuristics 18, 525 (2012).
  82. A. Gellner, S. Lamm, C. Schulz, D. Strash, and B. Zaválnij, Boosting data reduction for the maximum weight independent set problem using increasing transformations, in Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), edited by M. Farach-Colton (Society for Industrial and Applied Mathematics (SIAM), 2021), p. 128.
  83. C. Ebenegger, P. Hammer, and D. de Werra, Pseudo-boolean functions and stability of graphs, Algebraic and Combinatorial Methods in Operations Research, North-Holland Mathematics Studies, Vol. 95, edited by R. Burkard, R. Cuninghame-Green, and U. Zimmermann (North-Holland, Amsterdam, the Netherlands, 1984), pp. 83–97.
  84. G. Alexe, P. L. Hammer, V. V. Lozin, and D. de Werra, Struction revisited, Discrete Appl. Math. 132, 27 (2003).
  85. W. Zheng, J. Gu, P. Peng, and J. X. Yu, Efficient weighted independent set computation over large graphs, in 2020 IEEE 36th International Conference on Data Engineering (ICDE) (2020), pp. 1970–1973.
  86. M. Xiao, S. Huang, and X. Chen, Maximum weighted independent set: Effective reductions and fast algorithms on sparse graphs, Algorithmica 86, 1293 (2024).
  87. A. Figiel, V. Froese, A. Nichterlein, and R. Niedermeier, There and back again: On applying data reduction rules by undoing others, in 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics (LIPIcs), edited by S. Chechik, G. Navarro, E. Rotenberg, and G. Herman (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022), Vol. 244, pp. 53:1–53:15.
  88. Z. Fang, C.-M. Li, and K. Xu, An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem, J. Artif. Int. Res. 55, 799 (2016).
  89. S. Held, W. Cook, and E. C. Sewell, Maximum-weight stable sets and safe lower bounds for graph coloring, Math. Program. Comput. 4, 363 (2012).
  90. H. Jiang, C.-M. Li, and F. Manya, An exact algorithm for the maximum weight clique problem in large graphs, Proc. AAAI Conf. Artif. Intell. 31, 830 (2017).
  91. 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 2002 ACM Symposium on Applied Computing, SAC ’02 (Association for Computing Machinery, New York, NY, USA, 2002), pp. 542–546.
  92. S. Butenko and S. Trukhanov, Using critical sets to solve the maximum independent set problem, Oper. Res. Lett. 35, 519 (2007).
  93. D. Strash, On the power of simple reductions for the maximum independent set problem, Computing and Combinatorics, edited by T. N. Dinh-M. T. Thai (Springer International Publishing, Cham, 2016), pp. 345–356.
  94. L. Chang, W. Li, and W. Zhang, Computing a near-maximum independent set in linear time by reducing-peeling, in Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD ’17 (Association for Computing Machinery, New York, NY, USA, 2017), pp. 1181–1196.
  95. S. Butenko, P. Pardalos, I. Sergienko, V. Shylo, and P. Stetsyuk, Estimating the size of correcting codes using extremal graph problems, Optimization: Structure and Applications, edited by C. Pearce and E. Hunt (Springer New York, New York, NY, 2009), pp. 227–243.
  96. 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 (Association for Computing Machinery, New York, NY, USA, 2023), pp. 293–302.
  97. E. Großmann, K. Langedal, and C. Schulz, Concurrent iterated local search for the maximum weight independent set problem, in 23rd International Symposium on Experimental Algorithms (SEA 2025), Leibniz International Proceedings in Informatics (LIPIcs), edited by P. Mutzel and N. Prezza, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025), Vol. 338, pp. 22:1–22:18.
  98. T. Erlebach, K. Jansen, and E. Seidel, Polynomial-time approximation schemes for geometric graphs, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’01 (Society for Industrial and Applied Mathematics, USA, 2001), pp. 671–679.
  99. T. Matsui, Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs, in Discrete and Computational Geometry, edited by J. Akiyama, M. Kano, and M. Urabe (Springer, Berlin, Heidelberg, 2000), pp. 194–200.
  100. G. K. Das, M. De, S. Kolay, S. C. Nandy, and S. Sur-Kolay, Approximation algorithms for maximum independent set of a unit disk graph, Inf. Process. Lett. 115, 439 (2015).
  101. S. C. Nandy, S. Pandit, and S. Roy, Faster approximation for maximum independent set on unit disk graph, Inf. Process. Lett. 127, 58 (2017).
  102. M. Bonamy, E. Bonnet, N. Bousquet, P. Charbit, and S. Thomasse, EPTAS for max clique on disks and unit balls, in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, USA, 2018), pp. 568–579.
  103. J. Håstad, Clique is hard to approximate within n1−ϵ, Acta Math. 182, 105 (1999).
  104. C. Bazgan, B. Escoffier, and V. T. Paschos, Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness, Theor. Comput. Sci. 339, 272 (2005).
  105. C. de Correc, T. Ayral, and C. Bertrand, Approximate combinatorial optimization with Rydberg atoms: The barrier of interpretability, Phys. Rev. A 112, 042441 (2025).
  106. D. Aharonov, I. Arad, and T. Vidick, Guest column: The quantum PCP conjecture, ACM SIGACT News 44, 47 (2013).
  107. J. Wurtz, A. Bylinskii, B. Braverman, J. Amato-Grill, S. H. Cantu, F. Huber, A. Lukin, F. Liu, P. Weinberg, J. Long, S.-T. Wang, N. Gemelke, and A. Keesling, Aquila: QuEra’s 256-qubit neutral-atom quantum computer, arXiv:2306.11727.
  108. N. Sibalić, J. D. Pritchard, C. S. Adams, and K. J. Weatherill, ARC: An open-source library for calculating properties of alkali Rydberg atoms, Comput. Phys. Commun. 220, 319 (2017).
  109. J. Kombe and J. PritchardReducibility of native weighted graphs on Rydberg Arrays, 10.15129/69d10cd4-8cc8-4bcc-8329-3275804f5199.
  110. J. Gu, W. Zheng, Y. Cai, and P. Peng, Towards computing a near-maximum weighted independent set on massive graphs, in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, KDD’21 (Association for Computing Machinery, New York, NY, USA, 2021), pp. 467–477.
  111. J. Chen, I. A. Kanj, and W. Jia, Vertex cover: Further observations and further improvements, J. Algorithms 41, 280 (2001).
  112. X.-Z.-Q. Zeng, C. You, Q.-W. Wang, Z.-F. Li, Y. Ji, D. An, C. Yu, J.-R. Liu, Z.-M. He, J.-R. Gu, Y. Mei, H.-W. Cheng, Y.-C. Zhang, R. Lin, Z. Wu, J. Rui, J. Zhang, M.-C. Chen, Y.-H. Deng, C.-Y. Lu, and J.-W. Pan, Fast nondestructive readout for high-clock-rate atom array quantum processor, arXiv:2608.17189.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation