The DOI matches its Crossref record; 60 of the 64 references it cites were found in a registry or an index.
A study of heuristic guesses for adiabatic quantum computation
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Promising improvement strategies comprise non-stoquastic Hamiltonians [170], spatially inhomogeneous driving of the transverse field, and reverse annealing [205].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [205]
Citations
Cites
(1979) · Cited by 43,841
Messiah, A. (1961) · Cited by 16,012
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 1×
“He showed that using information about the structure of the problem as a heuristic guide can be used to enhance the performance of quantum search compared to the scheme proposed by Grover [ 18 ].”
MethodQuantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Introduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,886
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
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Self-citationAnalytic and Algorithmic Solution of Random Satisfiability Problems
Mézard, M., Giorgio Parisi, A., & Zecchina, R. (2002) · Science · doi:10.1126/science.1073287 · Cited by 1,045
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
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · cited 6×
“H f comply with the property that it must encode, in its ground state, the solution to the particular 3-SAT USA instance it was designed for [ 1 ,45].”
BackgroundMethodInfluentialRobustness of adiabatic quantum computation
Childs, A. M., Farhi, E., & Preskill, J. P. (2001) · Physical Review A · doi:10.1103/physreva.65.012322 · Cited by 468
Bounds for the adiabatic approximation with applications to quantum computation
Jansen, S., Ruskai, M.-B., & Seiler, R. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2798382 · Cited by 385
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
Rigorous location of phase transitions in hard optimization problems
Achlioptas, D., Naor, A., & Peres, Y. (2005) · Nature · doi:10.1038/nature03602 · Cited by 284
Simple Proof of Equivalence between Adiabatic Quantum Computation and the Circuit Model
Mizel, A., Lidar, D. A., & Mitchell, M. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.070502 · Cited by 218
Clustering of Solutions in the Random Satisfiability Problem
Mézard, M., Mora, T., & Zecchina, R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.197205 · Cited by 217
Bounds for the adiabatic approximation with applications to quantum computationPreprint
Jansen, S., Ruskai, M. B., & Seiler, R. (2006) · Cited by 217
Consistency of the Adiabatic Theorem
Amin, M. H. S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.220401 · Cited by 201
Inconsistency in the Application of the Adiabatic Theorem
Marzlin, K.-P., & Sanders, B. C. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.160408 · Cited by 197
First-Order Phase Transition in the Quantum Adiabatic Algorithm
Young, A. P., Knysh, S., & Smelyanskiy, V. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.020502 · Cited by 168
Quantum Adiabatic Brachistochrone
Rezakhani, A. T., Kuo, W.-J., Hamma, A., Lidar, D. A., & Zanardi, P. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.080502 · Cited by 163
The complexity of quantum spin systems on a two-dimensional square lattice
Oliveira, R. I., & Terhal, B. M. (2008) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2016985.2016987 · Cited by 145
Towards Fault Tolerant Adiabatic Quantum Computation
Lidar, D. A. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.160506 · Cited by 131
Size Dependence of the Minimum Excitation Gap in the Quantum Adiabatic Algorithm
Young, A. P., Knysh, S., & Smelyanskiy, V. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.170503 · Cited by 125
Sufficiency Criterion for the Validity of the Adiabatic Approximation
Tong, D. M., Singh, K., Kwek, L. C., & Oh, C. H. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.150402 · Cited by 122
Perdomo, A., Truncik, C., Tubert-Brohman, I., Rose, G., & Aspuru-Guzik, A. (2008) · Physical Review A · doi:10.1103/physreva.78.012320 · Cited by 120
Self-citationQuantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru-Guzik, A., & Hoffmann, M. R. (2008) · Physical Chemistry Chemical Physics · doi:10.1039/b804804e · Cited by 109
Self-citationEfficient algorithm for a quantum analogue of 2-SAT
Bravyi, S. (2011) · Contemporary Mathematics · doi:10.1090/conm/536/10552 · Cited by 98
Adiabatic quantum computing for random satisfiability problems
Hogg, T. (2003) · Physical Review A · doi:10.1103/physreva.67.022314 · Cited by 93
Quantum adiabatic algorithms, small gaps, and different paths
Farhi, E., Goldstone, J., Gosset, D., Gutmann, S., Meyer, H. B., & Shor, P. W. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-1 · Cited by 88
Universality of entanglement and quantum-computation complexity
Orús, R., & Latorre, J. I. (2004) · Physical Review A · doi:10.1103/physreva.69.052308 · Cited by 83
HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
FARHI, E., GOLDSTONE, J., GUTMANN, S., & NAGAJ, D. (2008) · International Journal of Quantum Information · doi:10.1142/s021974990800358x · Cited by 81
Adiabatic quantum algorithms as quantum phase transitions: First versus second order
Schützhold, R., & Schaller, G. (2006) · Physical Review A · doi:10.1103/physreva.74.060304 · Cited by 79
Adiabatic Quantum State Generation
Aharonov, D., & Ta‐Shma, A. (2007) · SIAM Journal on Computing · doi:10.1137/060648829 · Cited by 78
Hogg, T. (2000) · Physical Review A · doi:10.1103/physreva.61.052311 · Cited by 76
Quantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru‐Guzik, A., & Hoffmann, M. R. (2008) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 75
Self-citationExperimental Study of the Validity of Quantitative Conditions in the Quantum Adiabatic Theorem
Du, J., Hu, L.-Z., Wang, Y., Wu, J., Zhao, M., & Suter, D. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.060403 · Cited by 73
Kautz, H., & Selman, B. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2006.10.004 · Cited by 69
An Elementary Proof of the Quantum Adiabatic TheoremPreprint
Ambainis, A., & Regev, O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0411152 · Cited by 65
Quantum Adiabatic Evolution Algorithms with Different PathsPreprint
Farhi, E., Goldstone, J., & Gutmann, S. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0208135 · Cited by 65
Adiabatic quantum computation and quantum phase transitions
Latorre, J. I., & Orús, R. (2004) · Physical Review A · doi:10.1103/physreva.69.062302 · Cited by 62
Exponential complexity of an adiabatic algorithm for an NP-complete problem
Žnidarič, M., & Horvat, M. (2006) · Physical Review A · doi:10.1103/physreva.73.022329 · Cited by 61
Highly Structured Searches with Quantum Computers
Hogg, T. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2473 · Cited by 58
Preparation of many-body states for quantum simulation
Ward, N. J., Kassal, I., & Aspuru-Guzik, A. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3115177 · Cited by 54
Self-citationEfficient quantum algorithm for preparing molecular-system-like states on a quantum computer
Wang, H., Ashhab, S., & Nori, F. (2009) · Physical Review A · doi:10.1103/physreva.79.042335 · Cited by 48
Validity of the adiabatic approximation in quantum mechanics
MacKenzie, R., Morin-Duchesne, A., Paquette, H., & Pinel, J. (2007) · Physical Review A · doi:10.1103/physreva.76.044102 · Cited by 39
Preparation of Many-Body States for Quantum Simulation
Ward, N. J., Kassal, I., & Aspuru‐Guzik, A. (2009) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 39
Self-citationScaling of the running time of the quantum adiabatic algorithm for propositional satisfiability
Žnidarič, M. (2005) · Physical Review A · doi:10.1103/physreva.71.062305 · Cited by 38
Effect of Local Minima on Adiabatic Quantum Optimization
Amin, M. H. S. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.130503 · Cited by 38
Quantum adiabatic algorithms, small gaps, and different pathsPreprint
Farhi, E., Goldston, J., Gosset, D., Gutmann, S., Meyer, H. B., & Shor, P. W. (2011) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.5555/2011395.2011396 · Cited by 37
Quantum adiabatic computation and adiabatic conditions
Wei, Z., & Ying, M. (2007) · Physical Review A · doi:10.1103/physreva.76.024304 · Cited by 31
Kohen, D., & Tannor, D. J. (1993) · The Journal of Chemical Physics · doi:10.1063/1.464089 · Cited by 28
Reexamination of the quantum adiabatic theorem
Zhao, Y. (2008) · Physical Review A · doi:10.1103/physreva.77.032109 · Cited by 23
Unstructured Adiabatic Quantum Search
Andrecut, M., & Ali, M. (2004) · International Journal of Theoretical Physics · doi:10.1023/b:ijtp.0000048589.20608.aa · Cited by 12
Adiabatic rotation, quantum search, and preparation of superposition states
Siu, M. S. (2007) · Physical Review A · doi:10.1103/physreva.75.062337 · Cited by 10
Adiabatic Approximation ConditionPreprint
Wu, J., Zhao, M., Chen, J.-L., & Zhang, Y.-D. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0706.0264 · Cited by 8
Acharyya, S. (2007) · Journal on Satisfiability Boolean Modeling and Computation · doi:10.3233/sat190037 · Cited by 4
Invariant Perturbation Theory of Adiabatic ProcessPreprint
Chen, J., Zhao, M., Wu, J., & Zhang, Y.-D. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0706.0299 · Cited by 2
Žnidarič, M. (2005) · Physical Review A · Cited by 1
Research works printed but not linked: 1
- Farhi, E., Goldstone, J., Gutmann, S.: Quantum adiabatic evolution algorithms with different paths, quant-ph/0208135 (2002) · arXiv
Cited by
Sorted by citations
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Simulation of electronic structure Hamiltonians using quantum computers
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A. (2011) · Molecular Physics · doi:10.1080/00268976.2011.552441 · Cited by 472
Self-citationSimulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
Self-citationA survey of quantum image representations
Yan, F., Iliyasu, A. M., & Venegas-Andraca, S. E. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1195-6 · Cited by 308
Self-citation
Metadata
- Authors
- Perdomo-Ortiz, A., Venegas-Andraca, S. E., & Aspuru-Guzik, A.
- Affiliations
- Tecnológico de Monterrey (MX)
- Venue
- Quantum Information Processing
- Published
- 2010-03-14
- Volume
- 10
- Issue
- 1
- Pages
- 33-52
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W2078536001
- Cited by
- 111
- References
- 64
- Citations by year
- 2026: 5 · 2025: 12 · 2024: 8 · 2023: 11 · 2022: 10 · 2021: 16 · 2020: 10 · 2019: 15 · 2018: 4 · 2017: 3 · 2016: 2 · 2015: 6 · 2014: 4 · 2013: 1
- FWCI
- 1.69
- Type
- journal article
- Language
- en
- Open access
- green
- nrs.harvard.edu
- Licence
- Locations
- Quantum Information Processing (publishedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- Greater South Information System
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- adiabatic quantum computation, 3-SAT, satisfiability, Hamming distance
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
