A variational eigenvalue solver on a photonic quantum processor
Open accessThe DOI matches its Crossref record; 47 of the 48 references it cites were found in a registry or an index; 14 of the 31 sources its claims cite were checked for support.
Abstract
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. Quantum computers promise to efficiently solve problems that would be practically impossible with a normal computer. Peruzzo et al. develop a variational computation approach that uses any available quantum resources and, with a photonic quantum processing unit, find the ground-state molecular energy of He–H+.
Overview
CoChat Summary
## TL;DR
The paper introduces a variational alternative to quantum phase estimation for finding eigenvalues, combining short coherent quantum measurements with classical optimization. It experimentally demonstrates the approach on a photonic processor by estimating the ground-state energy curve of He–H\(^+\).
## Key findings
- The authors report an experimental ground-state result for He–H\(^+\): after correcting for experimental errors, they estimate the equilibrium bond length as \(R = 92.3 \pm 0.1\) pm and the ground-state electronic energy as \(E = -2.865 \pm 0.008\) MJ mol\(^{-1}\).
- For the bond dissociation curve, more than 96% of the experimental data are within chemical accuracy of the theoretical values.
- In the discussion, they state that for a 4 × 4 Hamiltonian like the one demonstrated, the QPE circuit would require at least 12 CNOT gates, whereas their method requires one.
- The full experiment was performed in about 158 h, and the bond dissociation curve was obtained by finding the ground states of 79 Hamiltonians.
## Methods
- The paper combines a reconfigurable integrated photonic quantum processor with a classical optimization algorithm: the quantum device estimates Hamiltonian expectation values, and the classical processor updates the state parameters variationally.
- The photonic chip prepares and measures arbitrary two-qubit pure states using single-qubit rotations and one two-qubit entangling gate; the experimental demonstration uses the He–H\(^+\) molecule in a minimal basis.
- For the classical optimization, they use the Nelder–Mead algorithm; expectation values are reconstructed from four two-qubit Pauli measurements at each point.
## Limitations
- The paper states that the method still requires a good approximation to the ground state as input/initialization, and the reliance on multiple separate measurements makes it sensitive to variations in state preparation between calculations.
- The authors report a constant systematic shift of \(\varepsilon = 50\) kJ mol\(^{-1}\) in the measured expectation values; they attribute this to photon-source impurity/distinguishability, circuit imperfections, and unbalanced coupling efficiencies.
- Evident from the text: the demonstration is limited to a two-qubit / 4 × 4 Hamiltonian prototype, so the scalability claim is not experimentally validated here.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures




Verification
Claims the paper makes
7 Valid · 4 Not valid · 11 Not checked · 59 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Recent developments in the field of quantum computation offer a way forward for determining efficient solutions of many instances of large eigenvalue problems that are classically intractable6789101112”
§ A variational eigenvalue solver on a photonic quantum processor > Abstract
What the sources say
- Not matchedcites [6] Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information Cambridge University Press (2000).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Could not verifycites [7] Kitaev, A. Quantum measurements and the Abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC) 3 (1996). sourceExperimental — accuracy not yet measured
Our copy under this DOI is the ISAAC 2021 paper 'Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm' (Kitaev's 1995 work appears only as reference [9] in its bibliography), and it nowhere asserts that quantum computation gives efficient solutions to classically intractable large eigenvalue problems. Eigenvalues enter only as complexity parameters — λ, the smallest eigenvalue of the normalized up-Laplacian, in Lemma 31 and Theorem 26 (Section 6.3, 'Time efficient implementations') and in the phase-estimation machinery of Appendix A — and Section 1.1 ('Our Contributions') actually reports the opposite direction for its own problem: 'the quantum algorithm is slower than the classical algorithm in the worst case'. Searched: 'eigenvalue problems classically intractable', 'quantum speedup / exponential advantage', 'phase estimation', 'faster than classical'; no passage addresses the claim's point. (LLM, conf=0.70)
- Partly supportedcites [8] Griffiths, R. B. & Niu, C.-S. Semiclassical fourier transform for quantum computation. Phys. Rev. Lett. 76, 3228–3231 (1996). sourceExperimental — accuracy not yet measured
On p. 1, the paper says a quantum computer, if built, could solve certain problems such as factoring long numbers much faster than conventional algorithms. It also describes a simpler Fourier transform for Shor’s factorization and discrete-logarithm algorithms (p. 1). The copy does not support the claim about efficient solutions to many large eigenvalue problems. (LLM, conf=0.84)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
Every source the paper cites for this claim was checked and supports it.
In the paper
“this would suffer from the N-representability problem, which is known to be intractable for both classical and quantum computers (it is in the quantum complexity class QMA-Hard24).”
§ A variational eigenvalue solver on a photonic quantum processor > Results > Quantum expectation estimation
What the sources say
- Supportedcites [24] Liu, Y.-K., Christandl, M. & Verstraete, F. Quantum computational complexity of the n-representability problem: Qma complete. Phys. Rev. Lett. 98, 110503 (2007). source
The paper states that N-representability is QMA-complete and hence QMA-hard and NP-hard (Abstract). Its discussion of quantum-chemistry relevance says the problem is intractable in the worst case even on a quantum computer, while allowing that particular physical systems may be easier. (LLM, conf=0.93)
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“We have implemented the QPU using integrated quantum photonics technology30.”
§ A variational eigenvalue solver on a photonic quantum processor > Results > Prototype demonstration
What the sources say
- Supportedcites [30] O'Brien, J. L., Furusawa, A. & Vuckovic, J. Photonic quantum technologies. Nat. Photon. 3, 687–695 (2009). source
The citation identifies integrated quantum photonics as the technology used, rather than attributing the citing authors’ QPU implementation to this review. The “Integrated quantum optical circuits” section (p. 6) describes on-chip waveguide circuits performing quantum logic gates and a compiled quantum factoring algorithm. (LLM, conf=0.87)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The time the quantum computer must remain coherent is determined by the necessity of O(p−1) successive applications of , each of which can require on the order of millions or billions of quantum gates for practical applications1719, as compared to the tens to hundreds of gates achievable in the short term.”
§ A variational eigenvalue solver on a photonic quantum processor > Abstract
What the sources say
- Partly supportedcites [17] Whitfield, J. D., Biamonte, J. & Aspuru-Guzik, A. Simulation of electronic structure hamiltonians using quantum computers. Mol. Phys. 109, 735–750 (2011). sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [19] Jones, N. C. et al. Faster quantum chemistry simulation on fault-tolerant quantum computers. New J. Phys. 14, 115023 (2012). sourceExperimental — accuracy not yet measured
Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+.”
§ A variational eigenvalue solver on a photonic quantum processor > Abstract
boostedstates a causeSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
31 more claims
Create a free account to see all 81 claims and to verify the 4 references still open.
- It may state two separate claims as one. 28
- Probably not a substantial claim. 24
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 doesn’t support the claim as written.
In the citing paper
“Leveraging quantum resources, the UCC ansatz was instead realized as a PQC on a photonic processor (Peruzzo et al. , 2014).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Peruzzo et al., 2014
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe cited source doesn’t support the claim as written.
In the citing paper
“The first on-chip GMM of four-qubit cluster state was realised in a laser-writing chip ( Fig.4e ), by manipulating both the polarisation and path DoFs of two photons [85].”
From Integrated photonic quantum technologies (2020) · cites this paper as [85]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe cited source doesn’t support the claim as written.
In the citing paper
“four-qubit linear- and box-cluster states are generated in a laser-writing photonic chip. This is enabled by on-chip manipulating the two-photon four-qubit hyperentangled state and cluster state, that are encoded in photon's path and polarisation DoFs. The Grover's search algorithm on a four-element database was implemented by controlling the device.”
From Integrated photonic quantum technologies (2020) · cites this paper as [85]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Due to its versatility, the variational Hamiltonian ansatz has been implemented for quantum chemistry [21, 29], optimization [24], and for quantum simulation problems [30].”
From Variational quantum algorithms (2021) · cites this paper as [29]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“For the original VQE (Peruzzo et al. , 2014) and QAOA (Farhi et al. , 2014) it can, for example, be described as a single expectation value min θ ⟨ H ⟩ U ( θ ) , where the differences solely appear in the specific form and construction of the qubit Hamiltonian.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Peruzzo et al., 2014
Experimental — accuracy not yet measured
12 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
(1999) · Cited by 12,854
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605 · cited 3×
“[12] S.”
BackgroundMethodPractical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981 · cited 3×
“[14] D.”
MethodInfluential�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597
Molecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
Self-citation
Research works printed but not linked: 3
- Helgaker, T., Jorgensen, P. & Olsen, J. Mol. Electronic Struct. Theory Wiley, Sussex (2002).
- Saad, Y. Numerical Methods for Large Eigenvalue Problems Vol. 158, (SIAM (1992).
- Rayleigh, J. W. In finding the correction for the open end of an organ-pipe. Phil. Trans. 161, 77 (1870).
Cited by
Items 1,101–1,200 of 4,572
Lie-algebraic classical simulations for quantum computing
Goh, M. L., Larocca, M., Cincio, Ł., Cerezo, M., & Sauvage, F. (2025) · Physical Review Research · doi:10.1103/3y65-f5w6 · Cited by 145
“As an example, in a variational quantum eigen-solver (VQE) [59] aiming at preparing the ground state of an Hamiltonian H , this loss would be the expectation value ⟨ H ( θ ) ⟩ . unitary Similarly, in the context of QML, the same circuit may be applied to a dataset of quantum states, and the loss to…”
Hybrid classical-quantum linear solver using Noisy Intermediate-Scale Quantum machines
Chen, C.-C., Shiau, S.-Y., Wu, M.-F., & Wu, Y.-R. (2019) · Scientific Reports · doi:10.1038/s41598-019-52275-6 · Cited by 48
“The idea is similar to that of variational quantum eigensolvers 38–41 , where quantum speedup is exploited only for sampling exponentially large state Hilbert spaces, while the rest of computational task is done by classical computer.”
BackgroundQuantum algorithm for the simulation of open-system dynamics and thermalization
Su, H.-Y., & Li, Y. (2020) · Physical Review A · doi:10.1103/physreva.101.012328 · Cited by 30
Time-optimal control of a dissipative qubit
Lin, C., Sels, D., & Wang, Y. (2020) · Physical Review A · doi:10.1103/physreva.101.022320 · Cited by 33
Stair, N. H., & Evangelista, F. A. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0014928 · Cited by 36
Contextual Subspace Variational Quantum Eigensolver
Kirby, W. M., Tranter, A., & Love, P. J. (2021) · Quantum · doi:10.22331/q-2021-05-14-456 · Cited by 44
Self-citationVariational optimization of the quantum annealing schedule for the Lechner-Hauke-Zoller scheme
Susa, Y., & Nishimori, H. (2021) · Physical Review A · doi:10.1103/physreva.103.022619 · Cited by 33
Optimization of Simultaneous Measurement for Variational Quantum Eigensolver Applications
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00054 · Cited by 41
Zhang, F., Gomes, N., Berthusen, N., Orth, P. P., Wang, C., Ho, K., & Yao, Y. (2021) · Iowa State University Digital Repository (Iowa State University) · Cited by 27
Filtering states with total spin on a quantum computer
Siwach, P., & Denis Lacroix, A. (2021) · Physical Review A · doi:10.1103/physreva.104.062435 · Cited by 31
An investigation of IBM quantum computing device performance on combinatorial optimisation problems
Khumalo, M. T., Chieza, H. A., Prag, K., & Woolway, M. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07438-4 · Cited by 47
“The VQE algorithm was proposed by [38] to approximate the ground state energy of a molecule [34] and early applications of VQE to chemistry problems were predominantly studied.”
InfluentialUnderstanding domain-wall encoding theoretically and experimentally
Berwald, J., Chancellor, N., & Dridi, R. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0410 · Cited by 48
Quantum simulation of nuclear Hamiltonian with a generalized transformation for Gray code encoding
Siwach, P., & Arumugam, P. (2021) · Physical Review C · doi:10.1103/physrevc.104.034301 · Cited by 35
Error-mitigated photonic variational quantum eigensolver using a single-photon ququart
Lee, D., Lee, J., Hong, S., Lim, H., Cho, Y., Han, S.-W., Shin, H., Rehman, J. U., & Kim, Y. (2021) · Optica · doi:10.1364/optica.441163 · Cited by 33
State preparation and evolution in quantum computing: A perspective from Hamiltonian moments
Aulicino, J. C., Keen, T., & Peng, B. (2021) · International Journal of Quantum Chemistry · doi:10.1002/qua.26853 · Cited by 32
Interpolation Methods for Molecular Potential Energy Surface Construction
Kwon, H., Morrow, Z., Kelley, C. T., et al. (2021) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.1c06812 · Cited by 27
Quantum neural network autoencoder and classifier applied to an industrial case study
Mangini, S., Marruzzo, A., Piantanida, M., Gerace, D., Bajoni, D., & Macchiavello, C. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00070-4 · Cited by 44
“There are several fields of application in which new quantum algorithms have been analyzed: quantum chemistry (Sokolov et al. 2020; Barkoutsos et al. 2018; Peruzzo et al. 2014; Kivlichan et al. 2018), optimization problems (Farhi et al.”
BackgroundSchleich, P., Kottmann, J. S., & Aspuru‐Guzik, A. (2022) · Physical Chemistry Chemical Physics · doi:10.1039/d2cp00247g · Cited by 34
Self-citationTsuchimochi, T., Ryo, Y., Ten‐no, S., & Sasasako, K. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00906 · Cited by 32
CaQR: A Compiler-Assisted Approach for Qubit Reuse through Dynamic Circuit
Hua, F., Jin, Y., Chen, Y., Vittal, S., Krsulich, K., Bishop, L. S., Lapeyre, J., Javadi-Abhari, A., & Zhang, E. Z. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3582016.3582030 · Cited by 57
“Quantum computation is important as it can solve classical intractable problems such as factoring [23] [23], chemistry simulation [12, 21], and large database search [10].”
BackgroundControlled-Controlled-Phase Gates for Superconducting Qubits Mediated by a Shared Tunable Coupler
Glaser, N. J., Roy, F., & Filipp, S. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.044001 · Cited by 42
Entanglement entropy production in Quantum Neural Networks
Ballarin, M., Mangini, S., Montangero, S., Macchiavello, C., & Mengoni, R. (2023) · Quantum · doi:10.22331/q-2023-05-31-1023 · Cited by 44
“As smallscale quantum devices start to be available [12], a new class of quantum procedures called variational quantum algorithms have been developed to take advantage of current and near-term quantum hardware, by trading theoretical guarantees of success with feasibility of execution [9, 11, 13].”
BackgroundPredicting molecular vibronic spectra using time-domain analog quantum simulation
MacDonell, R. J., Navickas, T., Wohlers-Reichel, T. F., Valahu, C. H., Rao, A. D., Millican, M. J., Currington, M. A., Biercuk, M. J., Tan, T. R., Hempel, C., et al. (2023) · Chemical Science · doi:10.1039/d3sc02453a · Cited by 43
Prediction of the neutron drip line in oxygen isotopes using quantum computation
Sarma, C., Matteo, O. D., Abhishek, A., & Srivastava, P. C. (2023) · Physical Review C · doi:10.1103/physrevc.108.064305 · Cited by 39
“In the present noisy intermediate-scale quantum (NISQ) era [4], variational methods like the variational quantum eigensolver (VQE) [5] are among the most successful quantum algorithms.”
BackgroundMethodNAPA: Intermediate-Level Variational Native-Pulse Ansatz for Variational Quantum Algorithms
Liang, Z., Cheng, J., Ren, H., Wang, H., Hua, F., Song, Z., Ding, Y., Chong, F. T., Han, S., Qian, X., et al. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3355277 · Cited by 70
“It has important applications in quantum many-body physics, quantum chemistry, and other fields [32], [42].”
BackgroundPolicy Gradient based Quantum Approximate Optimization AlgorithmPreprint
Yao, J., Bukov, M., & Lin, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.01068 · Cited by 72
“Examples of QVA include the Variational Quantum Eigensolver (Peruzzo et al., 2014), the Quantum Approximate Optimization © 2020 J. Yao, M. Bukov & L. Lin.”
MethodGate-based quantum computing for protein design
Khatami, M. H., Mendes, U. C., Wiebe, N., & Kim, P. M. (2023) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1011033 · Cited by 26
“Similarly, a version of the VQE approach is employed by Robert et al .”
Mitigating Barren Plateaus of Variational Quantum Eigensolvers
Liu, X., Liu, G., Zhang, H.-K., Huang, J., & Wang, X. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3383050 · Cited by 72
“VQAs are promising to deliver applications in many important topics, including ground state preparation [7], [8], [28], [29], [30], [31], quantum data compression [32], [33], machine learning [9], [19], [24], [34], [35], [36], [37], [38], and combinatorial optimization [39], [40].”
Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture
Mastroianni, C., Plastina, F., Settino, J., & Vinci, A. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3398410 · Cited by 32
“QAOA [23] and VQE [24] offer two different approaches to “bring the problem into the ansatz”.”
BackgroundMethodQudit-based variational quantum eigensolver using photonic orbital angular momentum states
Kim, B., Hu, K.-M., Sohn, M., Kim, Y., Kim, Y., Lee, S.-W., & Lim, H. (2024) · Science Advances · doi:10.1126/sciadv.ado3472 · Cited by 46
“This optimization process is repeated iteratively until the convergence of the ground state energy is achieved ( 4 ).”
Salas, M., Singh, A., Pignataro, C., & Pal, L. (2026) · Communications Materials · doi:10.1038/s43246-026-01105-0 · Cited by 40
“An extension of VQE, known as qubit-ADAPT-VQE, optimizes these procedures by reducing both the number of iterations and circuit complexity,allowingforchemicallyaccuratesimulationsinstudiesofadsorption inMOFsandCO 2 capture systems 262 .”
Quantum state discrimination using noisy quantum neural networks
Patterson, A., Chen, H., Wossnig, L., Severini, S., Browne, D. E., & Rungger, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013063 · Cited by 41
“pproach. Calculation of the gradients of quantum parameters has received attention recently [25,26,27] due to the introduction of variational methods such as the variational quantum eigensolver (VQE) [28]. The gradient of the loss function with respect to a parameter θ iis calculated by the method outlined in [25], wh…”
MethodHybrid quantum-classical approach to enhanced quantum metrology
Yang, X., Chen, X., Li, J., Peng, X., & Laflamme, R. (2021) · Scientific Reports · doi:10.1038/s41598-020-80070-1 · Cited by 30
“[32] Peruzzo A, McClean J, Shadbolt P, et al.”
BackgroundDeep reinforcement learning for universal quantum state preparation via dynamic pulse control
He, R.-H., Wang, R., Nie, S.-S., Wu, J., Zhang, J., & Wang, Z.-M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00119-6 · Cited by 38
Benfenati, F., Mazzola, G., Capecci, C., Barkoutsos, P. K., Ollitrault, P. J., Tavernelli, I., & Guidoni, L. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00091 · Cited by 41
Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing
Harwood, S. M., Trenev, D., Stober, S. T., Barkoutsos, P. K., Gujarati, T. P., Mostame, S., & Greenberg, D. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3479197 · Cited by 44
Mizuta, K., Fujii, M., Fujii, S., Ichikawa, K., Imamura, Y., Okuno, Y., & Nakagawa, Y. O. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043121 · Cited by 29
Quantum Circuit Learning with Parameterized Boson Sampling
Shi, J., Tang, Y., Lu, Y., Feng, Y., Shi, R., & Zhang, S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3095103 · Cited by 35
“For example, the variational quantum eigensolver [42] is used to implement quantum chemical simulation by estimating the ground state energy of molecules in the sys-tem [43], [44].”
MethodPatterns for Hybrid Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Vietz, D. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_2 · Cited by 38
“The patterns extend our collection of patterns of previous work [12, 10, 11].”
BackgroundOmiya, K., Nakagawa, Y. O., Koh, S., Mizukami, W., Gao, Q., & Kobayashi, T. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00877 · Cited by 44
Quantum neural networks force fields generation
Kiss, O., Tacchino, F., Vallecorsa, S., & Tavernelli, I. (2022) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac7d3c · Cited by 39
Meta-learning digitized-counterdiabatic quantum optimization
Chandarana, P., Vieites, P. S., Hegade, N. N., Solano, E., Ban, Y., & Chen, X. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace54a · Cited by 36
Parallel Hybrid Networks: An Interplay between Quantum and Classical Neural Networks
Kordzanganeh, M., Kosichkina, D., & Melnikov, A. A. (2023) · Intelligent Computing · doi:10.34133/icomputing.0028 · Cited by 38
Fragmented imaginary-time evolution for early-stage quantum signal processors
Silva, T. D. L., Taddei, M. M., Carrazza, S., & Aolita, L. (2023) · Scientific Reports · doi:10.1038/s41598-023-45540-2 · Cited by 49
“This has motivated several ground-state cooling algorithms (with and without QITE), especially for combinatorial optimisations 2,20–23 or molecular electronic structures 1,24–26 .”
MethodDivide and conquer approach to quantum Hamiltonian simulation
Hadfield, S., & Papageorgiou, A. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab1ef · Cited by 35
Quantum simulations employing connected moments expansions
Kowalski, K., & Peng, B. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0030688 · Cited by 31
Practical application improvement to Quantum SVM: theory to practicePreprint
Park, J.-E., Quanz, B., Wood, S., Higgins, H., & Harishankar, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.07725 · Cited by 72
“Additionally, we are presently in the so-called "noisy intermediate-scale quantum" (NISQ) era due to the limitation of physical qubits and fidelity, which has ideated a hybrid approach for many algorithms such as Variational Quantum Eigensolver (VQE) [8, 9].”
Demonstration of Breast Cancer Detection Using QSVM on IBM Quantum ProcessorsPreprint
Shan, Z., Guo, J., Ding, X., Zhou, X., Wang, J., Lian, H., Gao, Y., Zhao, B., & Xu, J. (2022) · Research Square · doi:10.21203/rs.3.rs-1434074/v1 · Cited by 32
Self-citationQuantum error mitigation by Pauli check sandwiching
Gonzales, A., Shaydulin, R., Saleem, Z. H., & Suchara, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-28109-x · Cited by 26
“Protocols that improve measurements of an observable have applications in problems such as the estimation of the ground state energy of a given Hamiltonian [15].”
BackgroundNISQ Quantum Computing: A Security-Centric Tutorial and Survey [Feature]
Chen, F., Jiang, L., Müller, H. A., Richerme, P., Chu, C., Fu, Z., & Min, Y. (2024) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2024.3349665 · Cited by 41
Primitive quantum gates for an S U ( 3 ) discrete subgroup: Σ ( 36 × 3 )
Gustafson, E., Ji, Y., Lamm, H., Murairi, E. M., Perez, S. O., & Zhu, S. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.034515 · Cited by 66
Engineered dissipation to mitigate barren plateaus
Sannia, A., Tacchino, F., Tavernelli, I., Giorgi, G. L., & Zambrini, R. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00875-0 · Cited by 58
“As an example, variational quantum eigensolvers (VQEs) 8,9 can be used to approximate the ground state of a given Hamiltonian H through a trial quantum circuit, also called an ansatz, by minimizing the cost function given by the expectation valueof H .”
Krylov diagonalization of large many-body Hamiltonians on a quantum processor
Yoshioka, N., Amico, M., Kirby, W., Jurcevic, P., Dutt, A., Fuller, B., Garion, S., Haas, H., Hamamura, I., Ivrii, A., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-59716-z · Cited by 126
Provable bounds for noise-free expectation values computed from noisy samples
Barron, S. V., Egger, D. J., Pelofske, E., Bärtschi, A., Eidenbenz, S., Lehmkuehler, M., & Woerner, S. (2024) · Nature Computational Science · doi:10.1038/s43588-024-00709-1 · Cited by 25
“Quantum computing is a new computational paradigm that promises to impact many disciplines, ranging from quantum chemistry 1,2 , quantum physics 3 and material sciences 4 to machine learning 5–7 , optimization 8–12 and finance 13 .”
Experimental Quantum Simulation of Chemical Dynamics
Navickas, T., MacDonell, R. J., Valahu, C. H., Olaya-Agudelo, V. C., Scuccimarra, F., Millican, M. J., Matsos, V. G., Nourse, H. L., Rao, A. D., Biercuk, M. J., et al. (2025) · Journal of the American Chemical Society · doi:10.1021/jacs.5c03336 · Cited by 56
Variational quantum simulation of ultrastrong light-matter coupling
Paolo, A. D., Barkoutsos, P. K., Tavernelli, I., & Blais, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033364 · Cited by 30
“(2) by means of a VQA requires first to construct a proper variational form [1,6].”
BackgroundCappelletti, W., Erbanni, R., & Keller, J. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00013 · Cited by 29
“Like many quantum machine learning algorithms [1]–[8], our procedure for classification of classical data fits in the general scheme of variational quantum algorithms [18], where a parametric quantum computation F θ is applied to an input vector x to get the result ˆ y = F θ ( x ) .”
MethodSimulating Effective QED on Quantum Computers
Stetina, T. F., Ciavarella, A. N., Li, X., & Wiebe, N. (2022) · Quantum · doi:10.22331/q-2022-01-18-622 · Cited by 38
Simulating quench dynamics on a digital quantum computer with data-driven error mitigation
Sopena, A., Gordon, M. H., Sierra, G., & López, E. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac0e7a · Cited by 32
Chan, H. H. S., Fitzpatrick, N., Segarra‐Martí, J., Bearpark, M. J., & Tew, D. P. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp02227j · Cited by 39
Variational quantum packaged deflation for arbitrary excited states
Wen, J., Lv, D., Yung, M., & Long, G. (2021) · Quantum Engineering · doi:10.1002/que2.80 · Cited by 32
Self-citationBauman, N. P., & Kowalski, K. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0076260 · Cited by 28
Applicability of Quantum Computing on Database Query Optimization
Schönberger, M. (2022) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3514221.3520257 · Cited by 35
“We consider two algorithms: the variational quantum eigensolver (VQE) [14] and the quantum approximate optimization algorithm (QAOA) [6].”
MethodXie, Q., Liu, S., & Zhao, Y. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00159 · Cited by 33
An overview of quantum error mitigation formulas
Qin, D., Xu, X., & Li, Y. (2022) · Chinese Physics B · doi:10.1088/1674-1056/ac7b1e · Cited by 40
Covariance Matrix Preparation for Quantum Principal Component Analysis
Gordon, M. H., Cerezo, M., Cincio, Ł., & Coles, P. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030334 · Cited by 40
Training Variational Quantum Circuits with CoVaR: Covariance Root Finding with Classical Shadows
Boyd, G., & Koczor, B. (2022) · Physical Review X · doi:10.1103/physrevx.12.041022 · Cited by 52
Bierman, J., Li, Y., & Lu, J. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00895 · Cited by 39
Two Algorithms for Excited-State Quantum Solvers: Theory and Application to EOM-UCCSD
Kim, Y., & Krylov, A. I. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c02480 · Cited by 30
Accelerated variational algorithms for digital quantum simulation of many-body ground states
Lyu, C., Montenegro, V., & Bayat, A. (2020) · Quantum · doi:10.22331/q-2020-09-16-324 · Cited by 36
“To date, there are three different methods for simulating the ground state of many-body systems on quantum simulators: (i) imaginary time evolution [51, 56]; (ii) adiabatic evolution [10, 24]; and (iii) Variational Quantum Eigensolver (VQE) [61].”
MethodMueck, L. (2015) · Nature Chemistry · doi:10.1038/nchem.2248 · Cited by 30
A Threshold for Quantum Advantage in Derivative PricingPreprint
Chakrabarti, S., Krishnakumar, R., Mazzola, G., Stamatopoulos, N., Woerner, S., & Zeng, W. J. (n.d.) · RePEc: Research Papers in Economics · Cited by 27
“Design and Implementation of Efficient Quantum Support Vector Machine,”
Mafu, M., & Senekane, M. (2021) · 2021 International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet52533.2021.9698509 · Cited by 25
Nearly optimal state preparation for quantum simulations of lattice gauge theories
Kane, C. F., Gomes, N., & Kreshchuk, M. (2024) · Physical Review A · doi:10.1103/physreva.110.012455 · Cited by 39
Information processing at the speed of light
AbuGhanem, M. (2024) · Frontiers of Optoelectronics · doi:10.1007/s12200-024-00133-3 · Cited by 35
Next Generation Power System Planning and Operation With Quantum Computation
Ganeshamurthy, P. A., Ghosh, K., O’Meara, C., Cortiana, G., Schiefelbein, J., & Monti, A. (2024) · IEEE Access · doi:10.1109/access.2024.3509743 · Cited by 45
Exploring the Frontiers of Computational NMR: Methods, Applications, and Challenges
Das, S., & Merz, K. M. (2025) · Chemical Reviews · doi:10.1021/acs.chemrev.5c00259 · Cited by 32
Quantum computer-aided design of quantum optics hardware
Kottmann, J. S., Krenn, M., Kyaw, T. H., Alperin-Lea, S., & Aspuru‐Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abfc94 · Cited by 29
“[60] In this work, we use VQE to optimize fidelities for a given target state which can be written as expectation value”
MethodSelf-citationAssessing three closed-loop learning algorithms by searching for high-quality quantum control pulses
Yang, X., Arenz, C., Pelczer, I., Chen, Q., Wu, R.-B., Peng, X., & RABITZ, H. A. (2020) · Physical Review A · doi:10.1103/physreva.102.062605 · Cited by 26
Unitary block optimization for variational quantum algorithms
Slattery, L., Villalonga, B., & Clark, B. K. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023072 · Cited by 34
Improving the accuracy and efficiency of quantum connected moments expansions *
Claudino, D., Peng, B., Bauman, N. P., Kowalski, K., & Humble, T. S. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac0292 · Cited by 30
Anand, A., Romero, J., Degroote, M., & Aspuru‐Guzik, A. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202000069 · Cited by 41
Self-citationDesigning Calibration and Expressivity-Efficient Instruction Sets for Quantum Computing
Lao, L., Murali, P., Martonosi, M., & Browne, D. E. (2021) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca52012.2021.00071 · Cited by 39
“edu chemistry [6] and material science [7].”
BackgroundQuantum computation and simulation with superconducting qubits*
He, K., Geng, X., Huang, R., Liu, J., & Chen, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac16cf · Cited by 27
Quantum kernels to learn the phases of quantum matter
Sancho-Lorente, T., Román-Roche, J., & Zueco, D. (2022) · Physical Review A · doi:10.1103/physreva.105.042432 · Cited by 40
“To be concrete, we discuss the use of a variational quantum eigensolver to find the ground state [58, 59].”
MethodThe Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry
Miháliková, I., Pivoluska, M., Plesch, M., Friák, M., Nagaj, D., & Šob, M. (2022) · Nanomaterials · doi:10.3390/nano12020243 · Cited by 34
“For example, in [22], the authors used a small photonic quantum computer to calculate the He–H+ system’s ground-state energies for various atomic distances.”
MethodQuantum algorithms for electronic structures: basis sets and boundary conditions
Liu, J., Fan, Y., Li, Z., & Yang, J. (2022) · Chemical Society Reviews · doi:10.1039/d1cs01184g · Cited by 34
One-particle Green's functions from the quantum equation of motion algorithm
Rizzo, J., Libbi, F., Tacchino, F., Ollitrault, P. J., Marzari, N., & Tavernelli, I. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043011 · Cited by 31
“In this context, several near-term methods have been proposed, starting from the well known variational quantum eigensolver (VQE) for calculating the ground state of a given Hamiltonian [14, 15].”
MethodZoufal, C., Mishmash, R. V., Sharma, N., Kumar, N., Sheshadri, A., Deshmukh, A. A., Ibrahim, N., Gacon, J., & Woerner, S. (2023) · Quantum · doi:10.22331/q-2023-01-26-909 · Cited by 36
“Wewould like to point out that one can also formulate a feature selection problem in terms of a QUBO, which could be solved, e.g., with VQE or QAOA, see [16], or adiabatic quantum computing, see [17].”
MethodInfluentialProbing Geometric Excitations of Fractional Quantum Hall States on Quantum Computers
Kirmani, A. A., Bull, K., Hou, C.-Y., Saravanan, V., Saeed, S. M., Papić, Z., Rahmani, A., & Ghaemi, P. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.056801 · Cited by 43
Quantum approximate optimization for combinatorial problems with constraints
Ruan, Y., Yuan, Z., Xue, X., & Liu, Z. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.020 · Cited by 33
Effects of quantum resources and noise on the statistical complexity of quantum circuits
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acb56a · Cited by 40
“[17] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’Brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications 5, 4213 (2014).”
Error-resilient Monte Carlo quantum simulation of imaginary time
Huo, M., & Li, Y. (2023) · Quantum · doi:10.22331/q-2023-02-09-916 · Cited by 42
Crawford, O., Cruise, J. R., Mertig, N., & González-Zalba, M. F. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00679-8 · Cited by 28
“This compilation method is useful for variational algorithms [66] from chemistry [67, 68] and finance [69] which repeatedly execute some number of up to bN/2c two-qubit operations in parallel.”
MethodSurrogate-based optimization for variational quantum algorithms
Shaffer, R., Kocia, L., & Sarovar, M. (2023) · Physical Review A · doi:10.1103/physreva.107.032415 · Cited by 38
“From both the QAOA and VQE illustrations in Section IV, we observe that SBO often achieves a lower error than SPSA for an equivalent number of iterations or experimental shots.”
BackgroundMethodInfluentialA randomized measurement toolbox for an interacting Rydberg-atom quantum simulator
Notarnicola, S., Elben, A., Lahaye, T., Browaeys, A., Montangero, S., & Vermersch, B. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acfcd3 · Cited by 44
Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem
Palackal, L., Poggel, B., Wulff, M., Ehm, H., Lorenz, J. M., & Mendl, C. B. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00080 · Cited by 54
“VQE [5] is a more general variational quantum algorithm allowing for an arbitrary ansatz.”
BackgroundMethodA Survey of Quantum Internet Protocols From a Layered Perspective
Li, Y., Zhang, H., Zhang, C., Huang, T., & Yu, F. R. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3361662 · Cited by 54
“…quantum computing, significant advantages over classical computing have been observed in various aspects, such as large number factorization [275], unordered search [276], linear equation solving [277], combinatorial optimization [278], [279], [280], and big data classification [281], [282], [283].”
BackgroundRocca, D., Cortes, C. L., Gonthier, J. F., Ollitrault, P. J., Parrish, R. M., Anselmetti, G.-L., Degroote, M., Moll, N., Santagati, R., & Streif, M. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00352 · Cited by 55
“34 In ref 35, several different approaches (including orbital transformation) were compared by considering small molecules in the minimal STO-3G basis set; it was shown that DF coupled with a symmetry shift provides the best results in terms of 1-norm reduction and scaling with the system size.”
MethodPrimitive quantum gates for an S U ( 2 ) discrete subgroup: Binary octahedral
Gustafson, E., Lamm, H., & Lovelace, F. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.109.054503 · Cited by 68
Metadata
- Authors
- Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L.
- Affiliations
- The University of Sydney (AU)
- Harvard University (US)
- University of Bristol (GB)
- Haverford College (US)
- Corresponding author
- Peruzzo, Alberto
- O’Brien, Jeremy L.
- Venue
- Nature Communications
- Published
- 2014-07-23
- Volume
- 5
- Issue
- 1
- Pages
- 4213-4213
- ISSN
- 2041-1723 (ISSN-L)
- PMC
- PMC4124861
- OpenAlex
- W2161685427
- Cited by
- 4,552
- References
- 48
- Citations by year
- 2026: 591 · 2025: 765 · 2024: 722 · 2023: 658 · 2022: 564 · 2021: 561 · 2020: 346 · 2019: 191 · 2018: 83 · 2017: 29 · 2016: 18 · 2015: 16 · 2014: 4
- FWCI
- 22.24
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by-nc-nd
- creativecommons.org/licenses/by-nc-nd/4.0 (tdm)
- creativecommons.org/licenses/by-nc-nd/4.0 (vor)
- Locations
- Nature Communications (publishedVersion, cc-by-nc-nd)
- Europe PMC (PubMed Central) (publishedVersion, cc-by-nc-nd)
- PubMed Central (publishedVersion, cc-by-nc-nd)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion, cc-by-nc-nd)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- RePEc: Research Papers in Economics (submittedVersion)
- RMIT Research Repository (RMIT University Library) (submittedVersion, cc-by-nc-nd)
- Figshare (submittedVersion, cc-by-nc-nd)
- UWA Profiles and Research Repository (UWA) (submittedVersion, cc-by-nc-nd)
- Bristol Research (University of Bristol) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (DE-FG02-97ER25308, 0955518, 1037992)
- U.S. Department of Energy (DEFG0297ER25308, DE‐FG02‐, FG02-97ER25308)
- Alfred P. Sloan Foundation
- John Templeton Foundation
- Camille and Henry Dreyfus Foundation
- Royal Academy of Engineering
- National Natural Science Foundation of China (61033001, 61361136003)
- Engineering and Physical Sciences Research Council (EP/J017175/1, EP/L024020/1, EP/K021931/1)
- Australian Research Council (DE140101700)
- National Key Research and Development Program of China (61033001, 2011CBA00301, 61361136003, 2011CBA00300)
- Division of Chemistry (CHE-1037992)
- Air Force Office of Scientific Research (FA 9550-12-1-0046, FA9550-, FA9550-12, FA9550‐12‐1)
- 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
- variational quantum eigensolver, photonic quantum processors, quantum chemistry, classical optimization, hybrid quantum-classical computation
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash and gpt-6-sol).
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.