The DOI matches its Crossref record; 71 of the 71 references it cites were found in a registry or an index.
Quantum optimization of maximum independent set using Rydberg atom arrays
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Lastly, there have been very large-scale demonstrations of QAOA on analog quantum simulators.”
From Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer (2022) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“A specific class of problems that has been implemented in a hardware-efficient way is the Maximum independent set (MIS) problem on unit disc graphs, since the independent set constraint is natively fulfilled by the Rydberg blockade mechanism [95].”
From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [95]
The cited source says what the claim attributes to it.
In the citing paper
“There are several algorithmic classes which can be used to solve the MIS on a neutral atom platform, such as the Quantum Approximate Optimisation Algorithm (QAOA), quantum annealing algorithms (QAA) [96], or variational quantum simulation as described in [95,97].”
From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [95]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Electromagnetically induced transparency: Optics in coherent media
Fleischhauer, M., Imamoglu, A., & Marangos, J. P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.633 · Cited by 5,189
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
Spall, J. C. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.119632 · Cited by 2,283
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Self-citationVerstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances in Physics · doi:10.1080/14789940801912366 · Cited by 1,762
Dipole Blockade and Quantum Information Processing in Mesoscopic Atomic Ensembles
Lukin, M. D., Fleischhauer, M., Cote, R., Duan, L. M., Jaksch, D., Cirac, J. I., & Zoller, P. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.037901 · Cited by 1,631
Self-citationAlbash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
The finite group velocity of quantum spin systems
Lieb, E. H., & Robinson, D. W. (1972) · Communications in Mathematical Physics · doi:10.1007/bf01645779 · Cited by 1,463
Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90358-o · Cited by 1,429
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
The Rectilinear Steiner Tree Problem is $NP$-Complete
Garey, M. R., & Johnson, D. S. (1977) · SIAM Journal on Applied Mathematics · doi:10.1137/0132071 · Cited by 1,124
Introduction to Frustrated Magnetism: Materials, Experiments, Theory
(2011) · Springer Series in Solid-State Sciences · doi:10.1007/978-3-642-10589-0 · Cited by 1,114
Markov Chains and Mixing Times
Levin, D., & Peres, Y. (2017) · American Mathematical Society eBooks · doi:10.1090/mbk/107 · Cited by 1,000
Quantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2021) · Nature · doi:10.1038/s41586-021-03582-4 · Cited by 995 · cited 1×
“1 Hardware-e cient encoding of the Maximum Independent Set problem Our experiments are performed on the 2D Rydberg programmable quantum simulator described previously in [26].”
MethodSelf-citationQuantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2020) · arXiv · doi:10.48550/arxiv.2012.12281 · Cited by 995
Self-citationZhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Self-citationGeometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Dynamics of a Quantum Phase Transition
Zurek, W. H., Dorner, U., & Zoller, P. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.105701 · Cited by 808
Probing topological spin liquids on a programmable quantum simulator
Semeghini, G., Levine, H., Keesling, A., Ebadi, S., Wang, T. T., Bluvstein, D., Verresen, R., Pichler, H., Kalinowski, M., Samajdar, R., et al. (2021) · Science · doi:10.1126/science.abi8794 · Cited by 781
Self-citationQuantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2020) · RePEc: Research Papers in Economics · Cited by 765
Self-citationK S, U. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.18067974 · Cited by 733
Quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
Scholl, P., Schuler, M., Williams, H. J., Eberharter, A. A., Barredo, D., Schymik, K.-N., Lienhard, V., Henry, L.-P., Lang, T. C., Lahaye, T., et al. (2021) · Nature · doi:10.1038/s41586-021-03585-1 · Cited by 688
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Self-verifying variational quantum simulation of lattice models
Kokail, C., Maier, C., van Bijnen, R., Brydges, T., Joshi, M. K., Jurcevic, P., Muschik, C. A., Silvi, P., Blatt, R., Roos, C. F., et al. (2019) · Nature · doi:10.1038/s41586-019-1177-4 · Cited by 594
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan, M. P., Sung, K. J., Neeley, M., Satzinger, K. J., Arute, F., Arya, K., Atalaya, J., Bardin, J. C., Barends, R., Boixo, S., et al. (2021) · Nature Physics · doi:10.1038/s41567-020-01105-y · Cited by 564
Self-citationEfficient Z gates for quantum computing
McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review A · doi:10.1103/physreva.96.022330 · Cited by 557
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Universal adiabatic dynamics in the vicinity of a quantum critical point
Polkovnikov, A. (2005) · Physical Review B · doi:10.1103/physrevb.72.161201 · Cited by 502
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
From density-matrix renormalization group to matrix product states
McCulloch, I. P. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/10/p10014 · Cited by 460
Universality considerations in VLSI circuits
Valiant, L. G. (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.6312176 · Cited by 396
A Quantum Algorithm for Finding the Minimum
Durr, C., & Hoyer, P. (1996) · arXiv · doi:10.48550/arxiv.quant-ph/9607014 · Cited by 359
The CMA Evolution Strategy: A Comparing Review
Nikolaus Hansen, C. (2006) · Springer eBooks · doi:10.1007/11007937_4 · Cited by 311
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
Pagano, G., Bapat, A., Becker, P., Collins, K. S., De, A., Hess, P. W., Kaplan, H. B., Kyprianidis, A., Tan, W. L., Baldwin, C., et al. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2006373117 · Cited by 262
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.10.002 · Cited by 192
Quantum Simulations of Classical Annealing Processes
Somma, R. D., Boixo, S., Barnum, H., & Knill, E. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.130504 · Cited by 173
First-Order Phase Transition in the Quantum Adiabatic Algorithm
Young, A. P., Knysh, S., & Smelyanskiy, V. N. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.020502 · Cited by 171
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031026 · Cited by 145
Defect Formation beyond Kibble-Zurek Mechanism and Holography
Chesler, P. M., García-García, A. M., & Liu, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.021015 · Cited by 141
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · HAL · Cited by 123
Farhi, E., Gosset, D., Hen, I., Sandvik, A. W., Shor, P. W., Young, A. P., & Zamponi, F. (2012) · Physical Review A · doi:10.1103/physreva.86.052334 · Cited by 116
Self-citationThe overlap gap property: A topological barrier to optimizing over random structures
Gamarnik, D. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2108492118 · Cited by 103
Zero-temperature quantum annealing bottlenecks in the spin-glass phase
Knysh, S. (2016) · Nature Communications · doi:10.1038/ncomms12370 · Cited by 93
Finding Near-Optimal Independent Sets at Scale
Lamm, S., Sanders, P. W., Schulz, C., et al. (2015) · Journal of Heuristics · doi:10.1007/s10732-017-9337-x · Cited by 91
Monte Carlo simulations of two-dimensional hard core lattice gases
Fernandes, H. C. M., Arenzon, J. J., & Levin, Y. (2007) · The Journal of Chemical Physics · doi:10.1063/1.2539141 · Cited by 88
Wecker, D., Hastings, M. B., & Troyer, M. (2016) · Physical Review A · doi:10.1103/physreva.94.022309 · Cited by 88
Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1812.04170 · Cited by 88
Self-citationKibble-Zurek mechanism and infinitely slow annealing through critical points
Biroli, G., Cugliandolo, L. F., & Sicilia, A. (2010) · Physical Review E · doi:10.1103/physreve.81.050101 · Cited by 87
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · OakTrust (Texas A&M University Libraries) · Cited by 86
Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
Schiffer, B. F., Tura, J., & Cirac, J. I. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020347 · Cited by 70
Tropical Tensor Network for Ground States of Spin Glasses
Liu, J.-G., Wang, L., & Zhang, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.090506 · Cited by 69
Self-citationBulk and boundary quantum phase transitions in a square Rydberg atom array
Kalinowski, M., Samajdar, R., Melko, R. G., Lukin, M. D., Subir Sachdev, A., & Choi, S. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.174417 · Cited by 59
Self-citationAutomated accelerator optimization aided by graph neural networks
Sohrabizadeh, A., Bai, Y., Sun, Y., et al. (2022) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/3489517.3530409 · Cited by 48
Quantum Sampling Algorithms for Near-Term Devices
Wild, D. S., Sels, D., Pichler, H., Zanoci, C., & Lukin, M. D. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.100504 · Cited by 46
Self-citationApproximation Algorithms for Unit Disk Graphs
van Leeuwen, E. J. (2005) · Lecture notes in computer science · doi:10.1007/11604686_31 · Cited by 41
Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays
Pichler, H., Wang, S.-T., Zhou, L., Choi, S., & Lukin, M. D. (2018) · arXiv · doi:10.48550/arxiv.1808.10816 · Cited by 35
Self-citationMayo, J. J., Fan, Z., Chern, G.-W., & del Campo, A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033150 · Cited by 31
Kibble–Zurek scaling and string-net coarsening in topologically ordered systems
Chandran, A., Burnell, F. J., Khemani, V., & Sondhi, S. L. (2013) · Journal of Physics Condensed Matter · doi:10.1088/0953-8984/25/40/404214 · Cited by 30
Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond
Chou, C.-N., Love, P. J., Sandhu, J. S., & Shi, J. (2021) · arXiv · doi:10.48550/arxiv.2108.06049 · Cited by 13
Industry applications of neutral-atom quantum computing solving independent set problems
Wurtz, J., Lopes, P. L. S., Gorgulla, C., Gemelke, N., Keesling, A., & Wang, S. (2022) · arXiv · doi:10.48550/arxiv.2205.08500 · Cited by 8
Self-citationFomin, F. V., & Kratsch, D. (2010) · Texts in theoretical computer science · doi:10.1007/978-3-642-16533-7_1 · Cited by 6
Research works printed but not linked: 18
- E. Farhi J. Goldstone S. Gutmann M. Sipser Quantum Computation by Adiabatic Evolution. arXiv:quant-ph/0001106 (2000). · arXiv
- E. Farhi J. Goldstone S. Gutmann A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 [quant-ph] (2014). · arXiv
- T. M. Graham et al . Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer. arXiv:2112.14589 [quant-ph] (2022). · arXiv
- E. Farhi D. Gamarnik S. Gutmann The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case. arXiv:2004.09002 [quant-ph] (2020). · arXiv
- J.-G. Liu X. Gao M. Cain M. D. Lukin S.-T. Wang Computing solution space properties of combinatorial optimization problems via generic tensor networks. arxiv:2205.03718 [cond-mat-stat-mech] (2022). · arXiv
- M. Szegedy in 45th Annual IEEE Symposium on Foundations of Computer Science (2004) pp. 32–41.
- E. Crosson E. Farhi C. Y.-Y. Lin H.-H. Lin P. Shor Different Strategies for Optimization Using the Quantum Adiabatic Algorithm. arXiv:1401.7320 [quant-ph] (2014). · arXiv
- D. Gamarnik I. Zadik The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property. arXiv:1904.07174 [math.ST] (2019). · arXiv
- D. Bluvstein H. Levine G. Semeghini T. T. Wang S. Ebadi M. Kalinowski A. Keesling N. Maskara H. Pichler M. Greiner V. Vuletić M. D. Lukin A quantum processor based on coherent transport of entangled atom arrays. Nature 604 451–456 (2022). 10.1038/s41586-022-04592-635444318 · DOI · Paper page
- M. Fishman S. R. White E. M. Stoudenmire The ITensor Software Library for Tensor Network Calculations. arXiv:2007.14822 [cs.MS] (2020). · arXiv
- M. Archimi et al . Measurements of blackbody radiation-induced transition rates between high-lying S P and D Rydberg leve l . arXiv:2111.15333 [physics.atom-ph] (2021). · arXiv
- D. P. Kingma J. Ba Adam: A Method for Stochastic Optimization. arXiv:1412.6980 [cs.LG] (2017). · arXiv
- J. Duchi, E. Hazan, Y. Singer, J. Mach. Learn. Res. 12, 2121–2159 (2011).
- L. Luo Y. Xiong Y. Liu X. Sun Adaptive Gradient Methods with Dynamic Bound of Learning Rate. arXiv:1902.09843 [cs.LG] (2019). · arXiv
- J. Biamonte V. Bergholm Tensor Networks in a Nutshell. arXiv:1708.00006 [quant-ph] (2017). · arXiv
- F. Pan P. Zhang Simulating the Sycamore quantum supremacy circuits. arXiv:2103.03074 [quant-ph] (2021). · arXiv
- G. Kalachev P. Panteleev M.-H. Yung Recursive Multi-Tensor Contraction for XEB Verification of Quantum Circuits. arXiv:2108.05665 [quant-ph] (2021). · arXiv
- 10.1103/PhysRevLett.69.2863 · DOI · Paper page
Cited by
Quantum Kibble–Zurek mechanism and critical dynamics on a programmable Rydberg simulator
Keesling, A., Omran, A., Levine, H., Bernien, H., Pichler, H., Choi, S., Samajdar, R., Schwartz, S., Silvi, P., Sachdev, S., et al. (2019) · Nature · doi:10.1038/s41586-019-1070-1 · Cited by 534
Self-citationA review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 408
Koch, C. P., Boscain, U., Calarco, T., Dirr, G., Filipp, S., Glaser, S. J., Kosloff, R., Montangero, S., Schulte-Herbrüggen, T., Sugny, D., et al. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00138-x · Cited by 405
Quantum science with optical tweezer arrays of ultracold atoms and molecules
Kaufman, A. M., & Ni, K.-K. (2021) · Nature Physics · doi:10.1038/s41567-021-01357-2 · Cited by 374
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
Metadata
- Authors
- Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., Luo, X.-Z., Nash, B., Gao, X., Barak, B., Farhi, E., Sachdev, S., Gemelke, N., Zhou, L., Choi, S., Pichler, H., Wang, S.-T., Greiner, M., Vuletić, V., & Lukin, M. D.
- Affiliations
- Harvard University (US)
- University of Waterloo (CA)
- Google (United States) (US)
- Department of Physics, Harvard University, Cambridge, MA 02138, USA.
- QuEra Computing (United States) (US)
- California Institute of Technology (US)
- Massachusetts Institute of Technology (US)
- Austrian Academy of Sciences (AT)
- Corresponding author
- Ebadi, S.
- Keesling, A.
- Cain, M.
- Greiner, M.
- Vuletić, V.
- Lukin, M. D.
- ORCID
- Venue
- Science
- Published
- 2022-06-10
- Volume
- 376
- Issue
- 6598
- Pages
- 1209-1215
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2889426946
- Cited by
- 430
- References
- 71
- Citations by year
- 2026: 71 · 2025: 119 · 2024: 101 · 2023: 91 · 2022: 28
- FWCI
- 27.78
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- Zenodo (CERN European Organization for Nuclear Research) (submittedVersion, cc-by)
- arXiv (Cornell University)
- Zenodo (CERN European Organization for Nuclear Research) (cc-by)
- Funders
- U.S. Department of Energy (DESC0021013, DESC0020347, DESC0019030, DESC0022199)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Cold Atom Physics and Bose-Einstein Condensates
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- maximum independent set, Rydberg atom arrays, Rydberg blockade, quantum optimization, variational quantum algorithms, quantum advantage, local minima
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.