Adiabatic Quantum Simulation of Quantum Chemistry
Open accessThe DOI matches its Crossref record; 141 of the 141 references it cites were found in a registry or an index.
Abstract
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.
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
Figures







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?
In the citing paper
“In the past few years, several papers have proposed new quantum algorithms along with experimental demonstrations on quantum devices 387,388 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [387]
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
(1979) · Cited by 43,841
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 2×
“Quantum computers have been rigorously proved to provide an algorithmic advantage over the best known classical approaches2 for a small set of problems [40–42].”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Self-citationLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“[46] S.”
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“Hamiltonian gadgets provide a method for embedding the eigenspectra (and sometimes eigenvectors) of an n-qubit ‘‘target’’ Hamiltonian, denoted by Htarget, in a restricted (typically lowenergy) subspace of a more constrained (N . n)-qubit ‘‘gadget’’ Hamiltonian, denoted by ~H.”
MethodA 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
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 7×
“How to cite this article: Babbush, R., Love, P.J. & Aspuru-Guzik, A. Adiabatic Quantum Simulation of Quantum Chemistry.”
MethodInfluentialBernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Research works printed but not linked: 1
- Abrams D. S. & Lloyd S. Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors. Phys. Rev. Lett. 83, 5162– 5165; 10.1103/PhysRevLett.83.5162 (1999). · DOI · Paper page
Cited by
Items 101–191 of 191
Probabilistic imaginary-time evolution algorithm based on nonunitary quantum circuits
Xie, H.-N., Wei, S.-J., Yang, F., Wang, Z., Chen, C.-T., Fan, H., & Long, G. (2024) · Physical Review A · doi:10.1103/physreva.109.052414 · Cited by 25
Incoherent quantum algorithm dynamics of an open system with near-term devices
Mahdian, M., & Yeganeh, H. D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02800-8 · Cited by 14
An Improved Noise Quantum Annealing Method for TSP
Dong, Y., & Huang, Z. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04628-5 · Cited by 15
Quantum simulation of a quantum stochastic walk
Govia, L. C. G., Taketani, B. G., Schuhmacher, P. K., & Wilhelm, F. K. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/aa540b · Cited by 14
Protein Design by Integrating Machine Learning and Quantum-Encoded Optimization
Panizza, V., Hauke, P., Micheletti, C., & Faccioli, P. (2024) · PRX Life · doi:10.1103/prxlife.2.043012 · Cited by 10
Transitionless driving on adiabatic search algorithm
Oh, S., & Kais, S. (2014) · The Journal of Chemical Physics · doi:10.1063/1.4903451 · Cited by 11
Quantum annealing with twisted fields
Imoto, T., Seki, Y., Matsuzaki, Y., & Kawabata, S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac9155 · Cited by 14
Eigenstates Transition without Undergoing an Adiabatic Process
Mostafavi, F., Yuan, L., & Ramezani, H. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.050404 · Cited by 14
Delgado, A., & Date, P. (2025) · Frontiers in Computer Science · doi:10.3389/fcomp.2025.1528985 · Cited by 12
A quantum annealing protocol to solve the nuclear shell model
Costa, E., Pérez-Obiol, A., Menéndez, J., Rios, A., García-Sáez, A., & Juliá-Díaz, B. (2025) · SciPost Physics · doi:10.21468/scipostphys.19.2.062 · Cited by 14
Exploiting anticommutation in Hamiltonian simulation
Zhao, Q., & Yuan, X. (2021) · Quantum · doi:10.22331/q-2021-08-31-534 · Cited by 15
Nishiya, Y., Nishi, H., Couzinié, Y., Kosugi, T., & Matsushita, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.022423 · Cited by 9
Practicality of a quantum adiabatic algorithm for chemistry applications
Granet, E., Ghanem, K., & Dreyer, H. (2025) · Physical Review A · doi:10.1103/physreva.111.022428 · Cited by 13
Distinguishing Multispin Interactions from Lower-Order Effects
Bergamaschi, T. R., Menke, T., Banner, W. P., Paolo, A. D., Weber, S. J., Hirjibehedin, C. F., Kerman, A. J., & Oliver, W. D. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.044018 · Cited by 9
Oscillating potential well in the complex plane and the adiabatic theorem
Longhi, S. (2017) · Physical Review A · doi:10.1103/physreva.96.042101 · Cited by 7
Quasiparticle pairing encoding of atomic nuclei for quantum annealing
Costa, E., Pérez-Obiol, A., Menéndez, J., Rios, A., García-Sáez, A., & Juliá-Díaz, B. (2025) · Physics Letters B · doi:10.1016/j.physletb.2025.140042 · Cited by 12
Quantum simulation of discretized harmonic oscillator
Jain, V. K., Behera, B. K., & Panigrahi, P. K. (2021) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-021-00250-0 · Cited by 6
Adiabatic ground-state preparation of fermionic many-body systems from a two-body perspective
van Vreumingen, D., & Schoutens, K. (2023) · Physical Review A · doi:10.1103/physreva.108.062603 · Cited by 7
Excited State Search Using Quantum Annealing
Seki, Y., Matsuzaki, Y., & Kawabata, S. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.054002 · Cited by 10
On the theory of quantum and towards practical computation: A review
Kudelić, R. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102454 · Cited by 7
How to experimentally evaluate the adiabatic condition for quantum annealing
Mori, Y., Kawabata, S., & Matsuzaki, Y. (2024) · Scientific Reports · doi:10.1038/s41598-024-58286-2 · Cited by 10
Combarro, E. F., Ranilla, J., & Rúa, I. F. (2019) · Computational and Mathematical Methods · doi:10.1002/cmm4.1009 · Cited by 5
Nonlinear Systems for Unconventional Computing
Kalinin, K. P., & Berloff, N. G. (2020) · Nonlinear systems and complexity · doi:10.1007/978-3-030-44992-6_15 · Cited by 6
Superconducting Qubits: Dephasing and Quantum Chemistry
O’Malley, P. J. J. (2016) · eScholarship (California Digital Library) · Cited by 9
Hamiltonian-oriented homotopy quantum approximate optimization algorithm
Kundu, A., Botelho, L., & Glos, A. (2024) · Physical Review A · doi:10.1103/physreva.109.022611 · Cited by 5
Ladder Operator Block-Encoding
Simon, W., Gustin, C. M., Serafin, K., Ralli, A., Goldstein, G. R., & Love, P. J. (2025) · Quantum · doi:10.22331/q-2025-12-22-1953 · Cited by 24
Self-citationGeometric quantum adiabatic methods for quantum chemistry
Yu, H., Lu, D., Wu, Q., & Wei, T.-C. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033045 · Cited by 6
Linear regression using quantum annealing with continuous variables
Koura, A., Imoto, T., Ura, K., & Matsuzaki, Y. (2025) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/adad7e · Cited by 6
Quantum annealing with pairs of 2Σ molecules as qubits
Asnaashari, K., & Krems, R. V. (2022) · Physical Review A · doi:10.1103/physreva.106.022801 · Cited by 4
Quantum walk processes in quantum devices
Madhu, A. K., Melnikov, A. A., Fedichkin, L. E., Alodjants, A. P., & Lee, R. (2023) · Heliyon · doi:10.1016/j.heliyon.2023.e13416 · Cited by 4
Quantum Zeno approach for molecular energies with maximum commuting initial Hamiltonians
Yu, H., & Wei, T.-C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013104 · Cited by 5
Anschuetz, E. R., Funcke, L., Komiske, P., Kryhin, S., & Thaler, J. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.056008 · Cited by 6
Efficient optimization of perturbative gadgets
Cao, Y., & Kais, S. (2017) · Quantum Information and Computation · doi:10.26421/qic17.9-10 · Cited by 4
Surrogate optimization of variational quantum circuits
Gustafson, E., Tiihonen, J., Chamaki, D., Sorourifar, F., Mullinax, J. W., Li, A. C. Y., Maciejewski, F. B., Sawaya, N. P. D., Krogel, J. T., Bernal, D. E., et al. (2025) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2408530122 · Cited by 7
Quantum algorithms for simulation of quantum chemistry problems by quantum computers: an appraisal
Sharma, S. (2022) · Foundations of Chemistry · doi:10.1007/s10698-022-09428-9 · Cited by 4
Quantum Multi-Round Resonant Transition Algorithm
Yang, F., Chen, X., Zhao, D., Wei, S., Wen, J., Wang, H., Xin, T., & Long, G. (2022) · Entropy · doi:10.3390/e25010061 · Cited by 3
Quantum annealing for semi-supervised learning
Zheng, Y.-L., Zhang, W., Zhou, C., & Geng, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/abe298 · Cited by 3
Error-run-time trade-off in the adiabatic approximation beyond scaling relations
Passos, M. R., Taddei, M. M., & Filho, R. L. D. M. (2020) · Annals of Physics · doi:10.1016/j.aop.2020.168172 · Cited by 5
Counterdiabatic driving for long-lived singlet state preparation
Suresh, A., Varma, V., Batra, P., & Mahesh, T. S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0159448 · Cited by 3
UEfficient optimization of perturbative gadgets
Cao, Y., & Kais, S. (2017) · Quantum Information and Computation · doi:10.26421/qic17.9-10-3 · Cited by 3
Sinha, A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0413 · Cited by 3
Mapping NP-Hard Problems to Restricted Adiabatic Quantum ArchitecturesPreprint
Mooney, G. J., Tonetto, S. U. Y., Hill, C. D., & Hollenberg, L. C. L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.00249 · Cited by 9
Reply to "Comment on "Quantum Time Crystals from Hamiltonians with Long-Range Interactions""
Kozin, V. K., & Kyriienko, O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.06321 · Cited by 3
Quantum simulation of water-molecule bond angles using an NMR quantum computer
Xu, F., Yang, F., Wei, C., Chen, X., Wei, S., Wang, H., Li, J., & Xin, T. (2024) · Physical Review A · doi:10.1103/physreva.109.042618 · Cited by 2
Full counting statistics of particle distribution on a digital quantum computer
Fan, Y.-Z., & Zhang, D.-B. (2024) · Physical Review A · doi:10.1103/physreva.109.012412 · Cited by 4
Time-resolved tomography of a driven adiabatic quantum simulation
Salis, G., Moll, N., Roth, M., Ganzhorn, M., & Filipp, S. (2020) · Physical Review A · doi:10.1103/physreva.102.062611 · Cited by 3
Chen, D.-T., & Jing, J. (2022) · Physical Review A · doi:10.1103/physreva.106.022603 · Cited by 2
Quantum Computing in Drug Discovery: A Review of Foundations and Emerging Applications
Kulkarni, S., Patil, D. P. S., & Patil, R. D. (2025) · International Journal of Advanced Pharmaceutical Sciences and Research · doi:10.54105/ijapsr.e4078.05040625 · Cited by 1
Adaptive random compiler for Hamiltonian simulation
Fan, Y.-Z., Wu, Y.-X., & Zhang, D.-B. (2025) · Physical Review A · doi:10.1103/4nmq-twj8 · Cited by 1
Tsesmelis, M. (2025) · Springer eBooks · doi:10.1007/978-3-031-90727-2_7 · Cited by 1
Symmetry-guided quantum state preparation: branched-subspaces adiabatic preparation (B-SAP)
Cugini, D., Guarnieri, G., Motta, M., & Gerace, D. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae5ad0 · Cited by 1
Zhao, S., & Li, F. (2026) · Physical Review Research · doi:10.1103/mqz1-99xc · Cited by 2
Thermal Pure States for Finite and Isolated Quantum Systems
Coden, M., Nale, E., Moro, G. J., & Fresch, B. (2017) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.7b06561 · Cited by 1
General Framework for Error Interference in Quantum Simulation
Chen, B., Xu, J., Yuan, X., & Zhao, Q. (2026) · Physical Review Letters · doi:10.1103/g2n5-qdxh · Cited by 10
Quantum Simulation of Spin Chains Coupled to Bosonic Modes with Superconducting Circuits
Heras, U. L., García-Álvarez, L., Mezzacapo, A., Solano, E., & Lamata, L. (2015) · Mathematics for industry · doi:10.1007/978-4-431-55342-7_8 · Cited by 5
Guaranteed-accuracy quantum annealing
Imoto, T., Seki, Y., Matsuzaki, Y., & Kawabata, S. (2022) · Physical Review A · doi:10.1103/physreva.106.042615 · Cited by 3
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0003 · Cited by 1
2D implementation of quantum annealing algorisms for fourth order binary optimization problemsPreprint
Tang, Y., & Miao, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.03887
From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization
Trummer, I. (2016) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-6995
Exponentially More Precise Algorithms for Quantum Simulation of Quantum Chemistry
Wei, A. Y. (2016) · Digital Access to Scholarship at Harvard (DASH) (Harvard University)
Noise Analysis of Quantum Approximate Optimization Algorithm on Weighted MAX-CUT
Priyadarshi, L., & Azad, U. (2019) · IEEE Conference on Information and Communication Technology (CICT) · doi:10.1109/cict48419.2019.9066254
Scoggins, M. T., & Rahmani, A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043165 · Cited by 1
Li, H., Gao, P., Zhang, J., Liu, Z., Wei, H., Wen, K., Wei, S., & Long, G. (2022) · Quantum Engineering · doi:10.1155/2022/5872283
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0006
Microwave resonators for superconducting devices
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0013
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0003
The rotating wave approximation
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0001
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0007
Quantum simulation of Hamiltonian eigenstates
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0012
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0002
Quantum simulation of Hamiltonian dynamics
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0011
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0009
The molecular Hamiltonian in second quantization
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0005
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0008
Oblivious amplitude amplification lemma
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0005
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0006
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0003
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0001
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0014
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0005
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0010
Fluctuation-guided adaptive random compiler for Hamiltonian simulation
Wu, Y.-X., Fan, Y.-Z., & Zhang, D.-B. (2026) · Physical Review Applied · doi:10.1103/52wr-1hys · Cited by 1
Quantum PCA on Classical Datasets: Fidelity Benchmarks and Downstream Task Performance
Magdon-Ismail, Z., & Munasinghe, T. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10346
Solving Helmholtz problems with finite elements on a quantum annealer
Rémi, A., Damanet, F., & Geuzaine, C. (2025) · Physical Review A · doi:10.1103/l4l6-qlj4 · Cited by 1
On Quantifying the Degree of Coherence in Qubits
Goswami, D. (2025) · Frontiers in Optics · doi:10.1364/fio.2025.jv5a.3
Introduction to the application of quantum computing in quantum chemistry
Chakravarti, D., & Guidoni, L. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-26596-9.00035-1
Quantifying multi-qubit coherence
Pandey, S., & Goswami, D. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05218-w
Metadata
- Authors
- Babbush, R., Love, P. J., & Aspuru-Guzik, A.
- Affiliations
- Harvard University (US)
- Haverford College (US)
- Venue
- Scientific Reports
- Published
- 2014-10-13
- Volume
- 4
- Issue
- 1
- Pages
- 6603-6603
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC4194464
- OpenAlex
- W2053275122
- Cited by
- 191
- References
- 137
- Citations by year
- 2026: 6 · 2025: 15 · 2024: 12 · 2023: 35 · 2022: 21 · 2021: 21 · 2020: 23 · 2019: 13 · 2018: 10 · 2017: 12 · 2016: 15 · 2015: 3 · 2014: 4
- FWCI
- 11.30
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- arXiv (Cornell University)
- Funders
- National Science Foundation (0955518, 1152291)
- U.S. Department of Defense (FA9550)
- Division of Chemistry (CHE-1152291)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- adiabatic quantum computation, Ising interaction, ancilla qubits
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.