Ramsey Numbers and Adiabatic Quantum Computing
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for 5≤s≤7. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.
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.
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
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
Classical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“An adiabatic algorithm for the calculation of the Ramsey numbers R(k, l) was proposed in (Gaitan and Clark, 2012).”
BackgroundMethodInfluentialDigitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 463
Benedetti, M., Realpe-Gómez, J., Biswas, R., & Perdomo-Ortiz, A. (2016) · Physical Review A · doi:10.1103/physreva.94.022308 · Cited by 215
Quantum Annealing for Constrained Optimization
Hen, I., & Spedalieri, F. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.5.034007 · Cited by 114
“Traditionally, imposing the constraint would consist of adding the ‘penalty’ term H penalty = [ C ( σ zi } ) − c ] 2 to the Hamiltonian, modifying it to H ′ p = H p + αH penalty , where α is a suitably chosen positive constant [18, 19, 21–24].”
Adiabatic quantum programming: minor embedding with hard faults
Klymko, C., Sullivan, B. D., & Humble, T. S. (2014) · Quantum Information Processing · doi:10.1007/s11128-013-0683-9 · Cited by 99
“ized application of adiabatic quantum computing has been used to solve a variety of problems including, for example, instances of satisfiabili ty (SAT) [15] and exact cover [16], finding Ramsey numbers [18], classifying binary images [21], training classifiers for machine learning [23] and finding the lowest free-energy c…”
BackgroundMethod
Metadata
- Authors
- Gaitan, F., & Clark, L.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-01-05
- Volume
- 108
- Issue
- 1
- Pages
- 010501-010501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1769909511
- Cited by
- 69
- References
- 3
- FWCI
- 9.82
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Ramsey Numbers and Adiabatic Quantum Computing. https://app.cochat.ai/papers/10.1103/physrevlett.108.010501
- The paper
- Gaitan, F., & Clark, L. (2012). Ramsey Numbers and Adiabatic Quantum Computing. Physical Review Letters. https://doi.org/10.1103/physrevlett.108.010501
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.