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
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-citationSimulation of Electronic Structure Hamiltonians Using Quantum Computers
Whitfield, J. D., Biamonte, J., & Aspuru‐Guzik, A. (2011) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 218
Self-citationOptimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021027 · Cited by 210
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Callison, A., & Chancellor, N. (2022) · Physical Review A · doi:10.1103/physreva.106.010101 · Cited by 172
Prospects for quantum enhancement with diabatic quantum annealing
Crosson, E., & Lidar, D. A. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00313-6 · Cited by 153
Reverse annealing for the fully connected p -spin model
Ohkuwa, M., Nishimori, H., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.98.022314 · Cited by 109
Mandrà, S., Zhu, Z., Wang, W., Perdomo‐Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 108
Self-citationDynamics of reverse annealing for the fully connected p -spin model
Yamashiro, Y., Ohkuwa, M., Nishimori, H., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.100.052321 · Cited by 76
A quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo‐Ortiz, A., Fluegemann, J., Narasimhan, S., Biswas, R., & Smelyanskiy, V. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02347-y · Cited by 84
Self-citationAnalog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0210-7 · Cited by 80
Readiness of Quantum Optimization Machines for Industrial Applications
Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S. V., Zhu, Z., O’Gorman, B., Katzgraber, H. G., Diedrich, A., Neven, H., de Kleer, J., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.014004 · Cited by 62
Self-citationImplementation of Quantum Annealing: A Systematic Review
Yulianti, L. P., & Surendro, K. (2022) · IEEE Access · doi:10.1109/access.2022.3188117 · Cited by 68
Reverse quantum annealing of the p -spin model with relaxation
Passarelli, G., Yip, K.-W., Lidar, D. A., Nishimori, H., & Lucignano, P. (2020) · Physical Review A · doi:10.1103/physreva.101.022331 · Cited by 55
Improving quantum annealing of the ferromagnetic p -spin model through pausing
Passarelli, G., Cataudella, V., & Lucignano, P. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.024302 · Cited by 47
Quantum Annealing with Longitudinal Bias Fields
Graß, T. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.120501 · Cited by 46
Finding spin glass ground states using quantum walks
Callison, A., Chancellor, N., Mintert, F., & Kendon, V. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab5ca2 · Cited by 52
Training an Ising machine with equilibrium propagation
Laydevant, J., Marković, D., & Grollier, J. (2024) · Nature Communications · doi:10.1038/s41467-024-46879-4 · Cited by 57
Performance of Domain-Wall Encoding for Quantum Annealing [dataset]
Chen, J., & Chancellor, N. (2021) · Durham Research Online (Durham University) · doi:10.15128/r11j92g748d · Cited by 43
Energetic Perspective on Rapid Quenches in Quantum Annealing
Callison, A., Festenstein, M. Z., Chen, J., Nita, L., Kendon, V. M., & Chancellor, N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010338 · Cited by 41
Finding spin glass ground states using quantum walks
Callison, A., Chancellor, N., Mintert, F., & Kendon, V. M. (2019) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 37
Mean field analysis of reverse annealing for code-division multiple-access multiuser detection
Arai, S., Ohzeki, M., & Tanaka, K. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033006 · Cited by 36
Schedule path optimization for adiabatic quantum computing and optimization
Zeng, L., Zhang, J., & Sarovar, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165305 · Cited by 31
Analog nature of quantum adiabatic unstructured search
Slutskii, M., Albash, T., Barash, L., & Hen, I. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab51f9 · Cited by 30
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum AnnealingPreprint
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · ResearchSpace (University of Auckland) · doi:10.48550/arxiv.1803.04340 · Cited by 22
Variationally scheduled quantum simulation
Matsuura, S., Buck, S., Senicourt, V., & Zaribafiyan, A. (2021) · Physical Review A · doi:10.1103/physreva.103.052435 · Cited by 27
Matsuzaki, Y., Hakoshima, H., Sugisaki, K., Seki, Y., & Kawabata, S. (2021) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/abdf20 · Cited by 23
Engineering the development of quantum programs: Application to the Boolean satisfiability problem
Alonso, D., Sánchez, P., & Sánchez-Rubio, F. (2022) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2022.103216 · Cited by 24
Advanced anneal paths for improved quantum annealing
Pelofske, E., Hahn, G., & Djidjev, H. N. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00040 · Cited by 19
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
“Promising improvement strategies comprise non-stoquastic Hamiltonians [170], spatially inhomogeneous driving of the transverse field, and reverse annealing [205].”
BackgroundMany-body localization enables iterative quantum optimization
Wang, H., Yeh, H.-C., & Kamenev, A. (2022) · Nature Communications · doi:10.1038/s41467-022-33179-y · Cited by 19
An Alternative Approach to Construct the Initial Hamiltonian of the Adiabatic Quantum Computation
Duan, Q.-H., Zhang, S., Wu, W., & Chen, P. (2013) · Chinese Physics Letters · doi:10.1088/0256-307x/30/1/010302 · Cited by 19
Experimental test of search range in quantum annealing
Chancellor, N., & Kendon, V. M. (2021) · Physical Review A · doi:10.1103/physreva.104.012604 · Cited by 15
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 17
Self-citationA double-slit proposal for quantum annealing
Munoz-Bauza, H., Chen, H., & Lidar, D. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0160-0 · Cited by 16
Universal Quantum Optimization with Cold Atoms in an Optical Cavity
Ye, M., Tian, Y., Lin, J. H., Luo, Y., You, J., Hu, J., Zhang, W., Chen, W., & Li, X. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.103601 · Cited by 16
Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
Campos, E., Venegas-Andraca, S. E., & Lanzagorta, M. O. (2021) · Scientific Reports · doi:10.1038/s41598-021-95801-1 · Cited by 18
Self-citationBreakdown of the Weak-Coupling Limit in Quantum Annealing
Bando, Y., Yip, K.-W., Chen, H., Lidar, D. A., & Nishimori, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.054033 · Cited by 16
Increase of degeneracy improves the performance of the quantum adiabatic algorithm
Zhuang, Q. (2014) · Physical Review A · doi:10.1103/physreva.90.052317 · Cited by 15
Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
Passarelli, G., Yip, K.-W., Lidar, D. A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.032431 · Cited by 14
Customized Quantum Annealing Schedules
Khezri, M., Dai, X., Yang, R. L., Albash, T., Lupaşcu, A., & Lidar, D. A. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.044005 · Cited by 21
Track clustering with a quantum annealer for primary vertex reconstruction at hadron collidersPreprint
Das, S., Wildridge, A. J., & Jung, A. W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.08879 · Cited by 22
Diagonal catalysts in quantum adiabatic optimization
Albash, T., & Kowalsky, M. (2021) · Physical Review A · doi:10.1103/physreva.103.022608 · Cited by 13
Counterdiabatic reverse annealing
Passarelli, G., & Lucignano, P. (2023) · Physical Review A · doi:10.1103/physreva.107.022607 · Cited by 15
VanQver: the variational and adiabatically navigated quantum eigensolver
Matsuura, S., Yamazaki, T., Senicourt, V., Huntington, L., & Zaribafiyan, A. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8080 · Cited by 13
Effectiveness of quantum annealing for continuous-variable optimization
Arai, S., Oshiyama, H., & Nishimori, H. (2023) · Physical Review A · doi:10.1103/physreva.108.042403 · Cited by 13
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500424 · Cited by 16
Fluctuation-guided search in quantum annealing
Chancellor, N. (2020) · Physical Review A · doi:10.1103/physreva.102.062606 · Cited by 11
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319586 · Cited by 15
Achieving fair sampling in quantum annealingPreprint
Kumar, V., Tomlin, C., Nehrkorn, C., O’Malley, D., & Dulny, J. S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.08487 · Cited by 12
Optimization by a quantum reinforcement algorithm
Ramezanpour, A. (2017) · Physical Review A · doi:10.1103/physreva.96.052307 · Cited by 12
A double-slit proposal for quantum annealing
Munoz-Bauza, H., Chen, H., & Lidar, D. A. (2019) · eScholarship (California Digital Library) · Cited by 10
Quantum annealing with error mitigation
Shingu, Y., Nikuni, T., Kawabata, S., & Matsuzaki, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.042606 · Cited by 12
Enhancing quantum annealing performance by a degenerate two-level system
Watabe, S., Seki, Y., & Kawabata, S. (2020) · Scientific Reports · doi:10.1038/s41598-019-56758-4 · Cited by 9
Phase transitions in the frustrated Ising ladder with stoquastic and nonstoquastic catalysts
Takada, K., Sota, S., Yunoki, S., Pokharel, B., Nishimori, H., & Lidar, D. A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043013 · Cited by 8
Unconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Okada, K. N., Nishi, H., Kosugi, T., & Matsushita, Y. (2024) · Scientific Reports · doi:10.1038/s41598-023-50406-8 · Cited by 9
Linked Markovian quantum tunnels: An approximation technique for solving the bin packing problem
Ligeiro, R. (2017) · Journal of Computational Science · doi:10.1016/j.jocs.2017.03.004 · Cited by 8
On Post-processing the Results of Quantum Optimizers
Borle, A., & McCarter, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34500-6_16 · Cited by 7
Leclerc, L., Dalyac, C., Bendotti, P., Griset, R., Mikael, J., & Henriet, L. (2025) · Physical Review A · doi:10.1103/physreva.111.032611 · Cited by 7
Diagnosing first- and second-order phase transitions with probes of quantum chaos
Huh, K.-B., Ikeda, K., Jahnke, V., & Keun-young Kim, A. (2021) · Physical review. E · doi:10.1103/physreve.104.024136 · Cited by 7
The quantum annealing gap and quench dynamics in the exact cover problem
Irsigler, B., & Graß, T. (2022) · Quantum · doi:10.22331/q-2022-01-18-624 · Cited by 7
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
Mirkarimi, P., Callison, A., Light, L., Chancellor, N., & Kendon, V. M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023151 · Cited by 9
Modernizing quantum annealing II: genetic algorithms with the inference primitive formalism
Chancellor, N. (2022) · Natural Computing · doi:10.1007/s11047-022-09905-2 · Cited by 12
Quantum Annealing Sampling with a Bias Field
Graß, T. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.044036 · Cited by 5
From Problem to Solution: A General Pipeline to Solve Optimisation Problems on Quantum Hardware
Rohe, T., Grätz, S., Kölle, M., Zielinski, S., Stein, J., & Linnhoff–Popien, C. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-84460-7_2 · Cited by 8
Why adiabatic quantum annealing is unlikely to yield speed-up
Villanueva, A., Najafi, P., & Kappen, H. J. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad0439 · Cited by 5
Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
Jattana, M. S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad6aea · Cited by 5
Performance of quantum annealing for 2-satisfiability problems with multiple satisfying assignments
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/n7r5-s63q · Cited by 5
Efficient Population Transfer via Non-Ergodic Extended States in Quantum Spin Glass
Kechedzhi, K., Smelyanskiy, V., McClean, J. R., Denchev, V. S., Mohseni, M., Isakov, S. V., Boixo, S., Altshuler, B. L., & Neven, H. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2018.9 · Cited by 5
Toward a standardized methodology for constructing quantum computing use casesPreprint
Chancellor, N., CUMMING, R. L., & Thomas, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.05846 · Cited by 11
Zeno-effect computation: Opportunities and challenges
Berwald, J., Chancellor, N., & Dridi, R. (2025) · Physical Review A · doi:10.1103/physreva.111.042623 · Cited by 8
Chiang, C.-F., & Alsing, P. M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03968-5 · Cited by 4
Decoding quantum error correction with Ising model hardwarePreprint
Roffe, J., Zohren, S., Horsman, D. C., & Chancellor, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.10254 · Cited by 4
Mapping state transition susceptibility in quantum annealing
Pelofske, E. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013224 · Cited by 3
Reverse Quantum Annealing Assisted by Forward Annealing
Jattana, M. S. (2024) · Quantum Reports · doi:10.3390/quantum6030030 · Cited by 4
Blockchain: Post-Quantum Security & Legal EconomicsPreprint
Haney, B. S. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3444695 · Cited by 3
Schulz, S., Willsch, D., & Michielsen, K. F. L. (2025) · Quantum · doi:10.22331/q-2025-10-29-1898 · Cited by 2
On the circuit model of two quantum adiabatic search algorithms
Sun, J. (2024) · International Journal of Quantum Information · doi:10.1142/s0219749924500230 · Cited by 2
Atom cavity encoding for NP-complete problems
Ye, M., & Li, X. (2024) · Quantum Frontiers · doi:10.1007/s44214-024-00069-x · Cited by 2
Performance of the quantum adiabatic algorithm on constraint satisfaction and spin glass problems
Hen, I., & Young, A. P. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02343-3 · Cited by 2
Performance of Domain-Wall Encoding for Quantum Annealing
Chen, J., Stollenwerk, T., & Chancellor, N. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3094280 · Cited by 2
Quantum Chemical Calculations on Small Protein Models
Jákli, I., Perczel, A., Viskolcz, B., & Csizmadia, I. G. (2014) · Springer eBooks · doi:10.1007/978-3-319-09976-7_2 · Cited by 2
Finding spin-glass ground states using quantum walks [dataset]
Callison, A. (2019) · Durham Research Online (Durham University) · doi:10.15128/r21544bp097 · Cited by 5
Effect of quantum statistics on computational power of atomic quantum annealers
Luo, Y., & Li, X. (2023) · Physical Review A · doi:10.1103/physreva.107.012608 · Cited by 1
Ma, Q., Ma, Z., & Gao, M. Y. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad3710 · Cited by 1
Anomalously slow dynamics of inhomogeneous quantum annealing
Dadgar, M., & Baldwin, C. L. (2025) · Physical Review A · doi:10.1103/physreva.111.062601 · Cited by 1
Noise effects on diabatic quantum annealing protocols
Salatino, G., Matzler, M., Scocco, A., Lucignano, P., & Passarelli, G. (2025) · Physical Review A · doi:10.1103/x9hw-xhvj · Cited by 2
Quantum Annealing Algorithms for Estimating Ising Partition Functions
Li, H., Yao, Z., & Qiu, X. (2026) · Physical Review Letters · doi:10.1103/8gmb-p619 · Cited by 2
Tsesmelis, M. (2025) · Springer eBooks · doi:10.1007/978-3-031-90727-2_7 · Cited by 1
Quantum-Walk-Inspired Dynamic Adiabatic Local Search
Chiang, C.-F., & Alsing, P. M. (2023) · Entropy · doi:10.3390/e25091287 · Cited by 3
Embedding quantum optimization problems using AC driven quantum ferromagnets
Mossi, G., Oganesyan, V., & Kapit, E. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae5fec · Cited by 1
Arbitrarily large polynomial speed-up in quantum search with prior knowledgePreprint
Sadowski, P. (2015) · arXiv (Cornell University) · Cited by 1
Classical Simulation of Quantum Adiabatic Algorithms using Mathematica on GPUsPreprint
Díaz-Pier, S., Venegas-Andraca, S. E., & Gómez-Muñoz, J. L. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.1399 · Cited by 1
Self-citationAuthor Correction: Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00297-8 · Cited by 3
Open-system modeling of quantum annealing: theory and applicationsPreprint
Yip, K.-W. (2021) · arXiv (Cornell University) · doi:10.25549/usctheses-c89-443939 · Cited by 3
Fluctuation guided search in quantum annealing [dataset and code]
Chancellor, N. (2020) · Durham Research Online (Durham University) · doi:10.15128/r1c534fn95w · Cited by 1
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
