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,201–1,300 of 4,572
Quetschlich, N., Burgholzer, L., & Wille, R. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3673241 · Cited by 56
“(b) Target device with three physical qubits.”
Reinforcement learning for semi-autonomous approximate quantum eigensolver
Albarrán-Arriagada, F., Retamal, J. C., Solano, E., & Lamata, L. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ab43b4 · Cited by 28
“The emergence of hybrid classical-quantum algorithms in the past few years [40, 41, 42, 43, 44, 45, 46] opens the door to the development of useful eigensolvers.”
BackgroundApplication of Pontryagin's minimum principle to Grover's quantum search problem
Lin, C., Wang, Y., Kolesov, G., & Kalabic, U. V. (2019) · Physical Review A · doi:10.1103/physreva.100.022327 · Cited by 26
A quantum model of feed-forward neural networks with unitary learning algorithms
Shao, C. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2592-z · Cited by 24
“The above idea is similar to the variational quantum eigensolvers (VQE) to find the ground state of Hamiltonians [29].”
BackgroundQuantifying the Efficiency of State Preparation via Quantum Variational Eigensolvers
Matos, G., Johri, S., & Papić, Z. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010309 · Cited by 36
QDB: From Quantum Algorithms Towards Correct Quantum Programs
Huang, Y., & Martonosi, M. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.plateau.2018.4 · Cited by 57
Evolving objective function for improved variational quantum optimization
Kolotouros, I., & Wallden, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023225 · Cited by 24
Quantum Computer-Aided design of Quantum Optics Hardware
Kottmann, J. S., Krenn, M., Kyaw, T. H., Alperin-Lea, S., & Aspuru-Guzik, A. (2020) · arXiv · doi:10.48550/arxiv.2006.03075 · Cited by 24
Self-citationLoaiza, I., & Izmaylov, A. F. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00912 · Cited by 55
Efficient Estimation of Trainability for Variational Quantum Circuits
Heyraud, V., Li, Z., Donatella, K., Boité, A. L., & Ciuti, C. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040335 · Cited by 44
Neural-network-encoded variational quantum algorithms
Miao, J., Hsieh, C., & Zhang, S. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.014053 · Cited by 33
“Among various VQAs, the variational quantum eigen-solver (VQE) [6, 7] certainly stands out as one of the most exemplary algorithms.”
BackgroundMethodIncompressible Navier–Stokes solve on noisy quantum hardware via a hybrid quantum–classical scheme
Song, Z., Deaton, R., Gard, B., & Bryngelson, S. H. (2024) · Computers & Fluids · doi:10.1016/j.compfluid.2024.106507 · Cited by 44
“VQE was created to determine the ground-state energy of chemistry molecules based on the Rayleigh–Ritz variational principle [65] and later adopted to solve Poisson equations [66, 67].”
Entanglement detection with quantum support vector machine (QSVM) on near-term quantum devices
Mahdian, M., & Mousavi, Z. B. (2025) · Scientific Reports · doi:10.1038/s41598-025-95897-9 · Cited by 34
Bang-bang control as a design principle for classical and quantum optimization algorithms
Bapat, A., & Jordan, S. (2019) · Quantum Information and Computation · doi:10.26421/qic19.5-6-4 · Cited by 23
Quantum locally linear embedding for nonlinear dimensionality reduction
He, X., Li, S., Lyu, C., & Wang, X. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02818-y · Cited by 32
“[15,16].”
BackgroundTan, K. C., & Volkoff, T. J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033251 · Cited by 38
“Such strategies have been used in applications such as finding approximate eigenstates of Hamiltonians[5, 6], recompiling quantum circuits [7] and solving linear algebraic problems [8–10].”
MethodSimulating Static and Dynamic Properties of Magnetic Molecules with Prototype Quantum Computers
Crippa, L., Tacchino, F., Chizzini, M., Aita, A., Grossi, M., Chiesa, A., Santini, P. M., Tavernelli, I., & Carretta, S. (2021) · Magnetochemistry · doi:10.3390/magnetochemistry7080117 · Cited by 24
“Although the VQE was originally introduced [73] and is nowadays widely applied [75,82–84] to treat quantum chemistry problems, it can easily be extended to deal with many-body [85] and spin models [75].”
BackgroundFlam-Shepherd, D., Wu, T., Gu, X., Cervera-Lierta, A., Krenn, M., & Aspuru‐Guzik, A. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00493-5 · Cited by 34
“Thus, in particular, quantum optics experiments are not only used to test the foundations of quantum physics [4–6], they are also at the heart of numerous quantum technologies in many areas including communication [7] and computation [8–10].”
BackgroundSelf-citationVariational Quantum-Based Simulation of Waveguide Modes
Ewe, W.-B., Koh, D. E., Goh, S. T., Chu, H., & Png, C. E. (2022) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2022.3151510 · Cited by 37
“To circumvent this drawback, we make use of a more efficient decomposition similar to that proposed recently by Sato et al. [27] that expresses 𝑀 as a linear combination of unitary transformations of simple Hamiltonians.”
BackgroundInfluentialMeng, F., Li, Z., Yu, X., & Zhang, Z. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3119010 · Cited by 36
Limiting the Search Space in Optimal Quantum Circuit Mapping
Burgholzer, L., Schneider, S., & Wille, R. (2022) · Springer eBooks · doi:10.1007/978-3-032-06770-8_11 · Cited by 31
Quingo: A Programming Framework for Heterogeneous Quantum-Classical Computing with NISQ Features
Fu, X., Yu, J., Su, X., Jiang, H., Wu, H., Cheng, F., Deng, X., Zhang, J., Jin, L., Yang, Y., et al. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3483528 · Cited by 39
García-Molina, P., Rodríguez-Mediavilla, J., & García‐Ripoll, J. J. (2022) · Physical Review A · doi:10.1103/physreva.105.012433 · Cited by 39
Application of Pontryagin's maximum principle to quantum metrology in dissipative systems
Lin, C., Ma, Y., & Sels, D. (2022) · Physical Review A · doi:10.1103/physreva.105.042621 · Cited by 26
Yamamoto, K., Manrique, D. Z., Khan, I. T., Sawada, H., & Ramo, D. M. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033110 · Cited by 36
Quantum variational learning for quantum error-correcting codes
Cao, C., Zhang, C., Wu, Z., Grassl, M., & Zeng, B. (2022) · Quantum · doi:10.22331/q-2022-10-06-828 · Cited by 49
“Variational quantum circuits (VQCs) have been widely used in near-term quantum algorithms for various tasks [48, 49], such as ground state preparation [50, 51], eigenenergy estimation [52, 53], quantum data compression [54, 55], quantum circuit compiling [56, 57].”
MethodAlternative approach to quantum imaginary time evolution
Jouzdani, P., Johnson, C. W., Mucciolo, E. R., & Stetcu, I. (2022) · Physical Review A · doi:10.1103/physreva.106.062435 · Cited by 28
Preparing valence-bond-solid states on noisy intermediate-scale quantum computers
Murta, B., Cruz, P. M. Q., & Fernández-Rossier, J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013190 · Cited by 27
Efficient quantum feature extraction for CNN-based learning
Dou, T., Zhang, G., & Cui, W. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.06.003 · Cited by 32
Quantifying quantum entanglement via a hybrid quantum-classical machine learning framework
Lin, X., Chen, Z., & Wei, Z. (2023) · Physical Review A · doi:10.1103/physreva.107.062409 · Cited by 30
Schrödinger-Heisenberg Variational Quantum Algorithms
Shang, Z.-X., Chen, M.-C., Yuan, X., Lu, C., & Pan, J.-W. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.060406 · Cited by 39
“[10] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L O’brien.”
BackgroundMethodTensor Networks for Interpretable and Efficient Quantum-Inspired Machine Learning
Ran, S.-J., & Su, G. (2023) · Intelligent Computing · doi:10.34133/icomputing.0061 · Cited by 40
“Variational quantum eigensolvers [147] were developed and applied to a wide range of areas such as quantum chemistry and quantum materials (one may refer to a recent review in Ref.”
BackgroundFitzpatrick, A., Nykänen, A., Talarico, N. W., Lunghi, A., Maniscalco, S., García-Pérez, G., & Knecht, S. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c05882 · Cited by 49
Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
Oumarou, O., Scheurer, M., Parrish, R. M., Hohenstein, E. G., & Gogolin, C. (2024) · Quantum · doi:10.22331/q-2024-06-13-1371 · Cited by 51
“Many NISQ algorithms such as the variational quantum eigensolver (VQE) [2] are essentially methods to reduce circuit depth at the expense of requiring many repetitions, also called shots.”
MethodUniversal bound on sampling bosons in linear optics and its computational implications
Yung, M., Gao, X., & Huh, J. (2019) · National Science Review · doi:10.1093/nsr/nwz048 · Cited by 35
Self-citationSubdivided Phase Oracle for NISQ Search Algorithms
Satoh, T., Ohkura, Y., & Meter, R. V. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3012068 · Cited by 35
Predicting excited states from ground state wavefunction by supervised quantum machine learning
Kawai, H., & Nakagawa, Y. O. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aba183 · Cited by 40
Boltzmann machine learning with a variational quantum algorithm
Shingu, Y., Seki, Y., Watabe, S., Endo, S., Matsuzaki, Y., Kawabata, S., Nikuni, T., & Hakoshima, H. (2021) · Physical Review A · doi:10.1103/physreva.104.032413 · Cited by 34
“[28] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L Obrien.”
BackgroundImplementation of quantum compression on IBM quantum computers
Pivoluska, M., & Plesch, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-09881-8 · Cited by 30
Kanno, K., Kohda, M., Imai, R., Koh, S., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2026) · Physical Review Research · doi:10.1103/dmn4-snfx · Cited by 203
Mahroo, R., & Kargarian, A. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3320872 · Cited by 36
“This is achieved us-ing methods, such as quantum approximate optimization algorithm (QAOA) [5], Grover algorithm [6], and variational quantum eigensolver [7].”
MethodMachine learning assisted construction of a shallow depth dynamic ansatz for noisy quantum hardware
Halder, S., Dey, A., Shrikhande, C., & Maitra, R. (2024) · Chemical Science · doi:10.1039/d3sc05807g · Cited by 29
Mapping structural topology optimization problems to quantum annealing
Wang, X., Wang, Z., & Ni, B. (2024) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-024-03791-1 · Cited by 22
Xiao, Y., Yang, L., Shu, C., Chew, S. C., Khoo, B. C., Cui, Y., & Liu, Y. Y. (2024) · Physics of Fluids · doi:10.1063/5.0226232 · Cited by 38
Topology-driven quantum architecture search framework
Su, J., Fan, J., Wu, S., Li, G., Qin, S., & Gao, F. (2025) · Science China Information Sciences · doi:10.1007/s11432-024-4486-x · Cited by 34
“Quantum computing exhibits promising potential in addressing complex problems, such as combinatorial optimization [1,2], factoring [3], linear system solving [4], chemical simulations [5,6], and machine learning [7–16].”
Sugisaki, K., Kanno, S., Itoko, T., Sakuma, R., & Yamamoto, N. (2025) · Physical Chemistry Chemical Physics · doi:10.1039/d5cp02202a · Cited by 78
“In 2014, the variational quantum eigensolver (VQE) was proposed for quantum chemical calculations using noisy intermediate-scale quantum (NISQ) [10] devices.”
Variationally scheduled quantum simulation
Matsuura, S., Buck, S., Senicourt, V., & Zaribafiyan, A. (2021) · Physical Review A · doi:10.1103/physreva.103.052435 · Cited by 30
Quantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2025) · Figshare · Cited by 27
Automatically differentiable quantum circuit for many-qubit state preparation
Zhou, P.-F., Hong, R., & Ran, S.-J. (2021) · Physical Review A · doi:10.1103/physreva.104.042601 · Cited by 29
Experimental Quantum Embedding for Machine Learning
Gianani, I., Mastroserio, I., Buffoni, L., Bruno, N., Donati, L., Cimini, V., Barbieri, M., Cataliotti, F. S., & Caruso, F. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100140 · Cited by 23
Towards a variational Jordan–Lee–Preskill quantum algorithm
Liu, J., Li, Z., Zheng, H., Yuan, X., & Sun, J. (2022) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aca06b · Cited by 39
Quantum computation of phase transition in the massive Schwinger model
Thompson, S., & Siopsis, G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac5f5a · Cited by 33
“We identified simple Ans¨atze for the VQE algorithm with which we could get good approximations to the ground and first excited state energies for lattices with L = 3 and L = 4 spatial sites.”
InfluentialChemistry beyond the Hartree–Fock energy via quantum computed moments
Jones, M. A., Vallury, H. J., Hill, C. D., & Hollenberg, L. C. L. (2022) · Scientific Reports · doi:10.1038/s41598-022-12324-z · Cited by 36
Simulating time evolution with fully optimized single-qubit gates on parametrized quantum circuits
Wada, K., Raymond, R., Ohnishi, Y., Kaminishi, E., Sugawara, M., Yamamoto, N., & Watanabe, H. C. (2022) · Physical Review A · doi:10.1103/physreva.105.062421 · Cited by 24
“In addition to the quantum phase estimation (QPE) algorithm [8, 9], and the variational quantum eigensolver (VQE) [10–12], the imaginary time evolution (ITE) algorithm [13, 14] might be applied to obtain the ground state energy and wavefunction.”
BackgroundMethodThe basics of quantum computing for chemists
Claudino, D. (2022) · International Journal of Quantum Chemistry · doi:10.1002/qua.26990 · Cited by 31
Data-Driven Reliability Models of Quantum Circuit: From Traditional ML to Graph Neural Network
Saravanan, V., & Saeed, S. M. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3202430 · Cited by 28
“To assess how close the QAOA solution to the optimal solution, the approximation ratio (AR) is used, which is computed as [48].”
MethodKhan, I. T., Tudorovskaya, M., Kirsopp, J. J. M., Ramo, D. M., Warrier, P. W., Papanastasiou, D. K., & Singh, R. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0144680 · Cited by 29
Mondal, D., Halder, D., Halder, S., & Maitra, R. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0153182 · Cited by 29
Quantum simulation of excited states from parallel contracted quantum eigensolvers
Benavides-Riveros, C. L., Wang, Y., Warren, S., & Mazziotti, D. A. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad2d1d · Cited by 32
“So far, several quantum algorithms have been developed to approximate eigenstates of many-body Hamiltonians, including quantum phase estimation (QPE) [6, 7] and the variational quantum eigen-solver (VQE) [8, 9].”
Group-theoretic error mitigation enabled by classical shadows and symmetries
Zhao, A., & Miyake, A. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00854-5 · Cited by 50
“In order to minimize the accumulation of errors, such algorithms prioritize low-depth circuits, for instance, variational quantum circuits 7 – 10 .”
Automatic quantum circuit encoding of a given arbitrary quantum state
Shirakawa, T., Ueda, H., & Yunoki, S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043008 · Cited by 49
“…quantum circuit is constructed on the basis of digitized quantum adiabatic process expressed by a product of local time-evolution unitary operators and the variational parameters are optimized so as to minimize the expectation value of energy, as in the variational quantum eigensolver [2].”
BackgroundDoubly Optimal Parallel Wire Cutting without Ancilla Qubits
Harada, H., Wada, K., & Yamamoto, N. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040308 · Cited by 64
Simulation of molecular spectroscopy with circuit quantum electrodynamics
Hu, L., Ma, Y.-C., Xu, Y., Wang, W.-T., Ma, Y.-W., Liu, K., Wang, H.-Y., Song, Y.-P., Yung, M.-H., & Sun, L.-Y. (2018) · 中国科学通报:英文版 · doi:10.1016/j.scib.2018.02.001 · Cited by 33
Self-citationTILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing Architecture
Wu, X.-C., Debroy, D. M., Ding, Y., Baker, J. M., Alexeev, Y., Brown, K. R., & Chong, F. T. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00023 · Cited by 43
“By leveraging the quan tum mechanical principles of superposition and entangle ment, QC algorithms have the potential to revolutionize areas such as machine learning [11], quantum chemistry [43,69], and cryptography [76].”
MethodEntangled Datasets for Quantum Machine LearningPreprint
Schatzki, L., Arrasmith, A., Coles, P. J., & Cerezo, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.03400 · Cited by 96
“Perhaps the most natural way to produce quantum datasets is using the Variational Quantum Eigensolver (VQE) algorithm [56], and forming the datasets from ground states of a given Hamiltonian.”
BackgroundMethodReducing the Amount of Single‐Qubit Rotations in VQE and Related Algorithms
Rasmussen, S. E., Loft, N. J. S., Bækkegaard, T., Kues, M., & Zinner, N. T. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000063 · Cited by 22
Sparse Quantum State Preparation for Strongly Correlated Systems
Feniou, C., Adjoua, O., Claudon, B., Zylberman, J., Giner, E., & Piquemal, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c03159 · Cited by 38
Gradient-based optimization for quantum architecture search
He, Z., Wei, J., Chen, C., Huang, Z., Situ, H., & Li, L. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106508 · Cited by 30
Machine learning on quantum experimental data toward solving quantum many-body problems
Cho, G., & Kim, D. (2024) · Nature Communications · doi:10.1038/s41467-024-51932-3 · Cited by 21
“Hybrid approaches in which classical computers are combined with quantum computers as to circumvent this issue have been introduced 14 .”
BackgroundPlatinum-based catalysts for oxygen reduction reaction simulated with a quantum computer
Paola, C. D., Plekhanov, E. A., Krompiec, M., Kumar, C., Marsili, E., Du, F., Weber, D., Krauser, J. S., Shishenina, E., & Ramo, D. M. (2024) · npj Computational Materials · doi:10.1038/s41524-024-01460-x · Cited by 26
“A practical approach, well-suited for the current noisy quantum computers, involves employing the VQE 26,27 .”
First-order phase transition of the Schwinger model with a quantum computer
Angelides, T., Naredi, P., Crippa, A., Jansen, K., Kühn, S., Tavernelli, I., & Wang, D. S. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00950-6 · Cited by 84
“We use the variationalquantumeigensolver(VQE) 38 andderiveaprotocolformapping thisproblemonaquantumcircuit.”
Stochastic noise can be helpful for variational quantum algorithms
Liu, J., Wilde, F., Mele, A. A., Jin, X., Jiang, L., & Eisert, J. (2025) · Physical Review A · doi:10.1103/physreva.111.052441 · Cited by 72
“Large classes of variational quantum eigensolvers (VQE), the quantum approximate optimization algorithm (QAOA) and models for quantum-assisted machine learning are thought to operate along those lines, based on suitable loss functions to be minimized [8–14].”
Shajan, A., Kaliakin, D. S., Mitra, A., Moreno, J. R., Li, Z., Motta, M., Johnson, C., Saki, A. A., Das, S., Sitdikov, I., et al. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00114 · Cited by 84
Quantum Measurement for Quantum Chemistry on a Quantum Computer
Patel, S., Jayakumar, P., Yen, T.-C., & Izmaylov, A. F. (2025) · Chemical Reviews · doi:10.1021/acs.chemrev.5c00055 · Cited by 49
Wauters, M. M., Mbeng, G. B., & Santoro, G. E. (2020) · Physical Review A · doi:10.1103/physreva.102.062404 · Cited by 45
Quantum computation for pricing the collateralized debt obligations
Tang, H. L., Pal, A., Wang, T., Qiao, L., Gao, J., & Jin, X. (2021) · Quantum Engineering · doi:10.1002/que2.84 · Cited by 39
Symmetry-Induced Error Filtering in a Photonic Lieb Lattice
Chang, Y.-J., Lu, Y., Wang, Y., Xu, X.-Y., Zhou, W.-H., Cui, W.-H., Wang, X., Gao, J., Qiao, L., & Jin, X. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.110501 · Cited by 22
Generic detection-based error mitigation using quantum autoencoders
Zhang, X., Kong, W., Farooq, M. U., Yung, M., Guo, G., & Wang, X. (2021) · Physical Review A · doi:10.1103/physreva.103.l040403 · Cited by 33
Self-citationTrotter Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation
Chinni, K., Muñoz-Arias, M. H., Deutsch, I., & Poggi, P. M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010351 · Cited by 34
Quantum Simulation of Molecules in Solution
Castaldo, D., Jahangiri, S., Delgado, A., & Corni, S. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00974 · Cited by 26
Sample complexity of learning parametric quantum circuits
Cai, H., Ye, Q., & Deng, D.-L. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac4f30 · Cited by 39
Unsupervised detection of decoupled subspaces: Many-body scars and beyond
Szołdra, T., Sierant, P., Lewenstein, M., & Zakrzewski, J. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.224205 · Cited by 29
“Physical applications include variational quantum eigensolvers [6–8], algorithms for ground state preparation [9], time evolution simulations [10–12] or quantum variational autoencoders ( QVAE ) [13–15].”
Second-Quantized Fermionic Operators with Polylogarithmic Qubit and Gate Complexity
Kirby, W., Fuller, B., Hadfield, C. F., & Mezzacapo, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020351 · Cited by 36
“Alternatively, we can estimate the expectation value of each term via Hadamard tests and implement a variational quantum eigensolver (VQE) that searches for the Hamiltonian’s ground state energy [32, 33].”
MethodQuantum optimization for training quantum neural networks
Liao, Y., Hsieh, M.-H., & Ferrie, C. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00169-w · Cited by 41
“…to generate quantum states that minimize the expectation value of a given Hamiltonian, such as the case in variational quantum eigensolvers (VQE) (Peruzzo et al. 2014) for chemistry problems or quantum approximate optimization algorithms (QAOA) (Farhi et al. 2014) for combinatorial optimization…”
InfluentialApproximating the quantum approximate optimization algorithm with digital-analog interactions
Headley, D., Müller, T., Martin, A., Solano, E., Sanz, M., & Wilhelm, F. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042446 · Cited by 35
VACSEN : A V isualization A pproa c h for Noi s e Awaren e ss in Qua n tum Computing
Ruan, S., Wang, Y., Jiang, W., Mao, Y., & Guan, Q. (2022) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2022.3209455 · Cited by 33
Finite-size criticality in fully connected spin models on superconducting quantum hardware
Grossi, M., Kiss, O., Luca, F. D., Zollo, C., Gremese, I., & Mandarino, A. (2023) · Physical review. E · doi:10.1103/physreve.107.024113 · Cited by 30
“[40] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J.”
MethodQuantum simulation of bosons with the contracted quantum eigensolver
Wang, Y., Sager-Smith, L. M., & Mazziotti, D. A. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acf9c3 · Cited by 28
PANSATZ: pulse-based ansatz for variational quantum algorithms
Meirom, D., & Frankel, S. H. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1273581 · Cited by 33
Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting
Fan, Y., Cao, C., Xu, X., Li, Z., Lv, D., & Yung, M. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c01804 · Cited by 43
“Therefore, VQE is thus preferable for NISQ devices and has been experimentally demonstrated on leading quantum platforms including photonic quantum processors[13], superconducting devices[11, 14– 16] and trapped-ion quantum processors[17–19].”
BackgroundSelf-citationReducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
Staudacher, K., Guggemos, T., Grundner-Culemann, S., & Gehrke, W. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.3 · Cited by 38
“With variational algorithms (e.g., QAOA [10] or VQE [25]), real-world applications like optimization problems on real quantum chips may become feasible.”
BackgroundCalibrating the role of entanglement in variational quantum circuits
Nakhl, A. C., Quella, T., & Usman, M. (2024) · Physical Review A · doi:10.1103/physreva.109.032413 · Cited by 38
“…been the subject of intense research due to the possibility of combining the manipulation of quantum systems with classical optimisation techniques[3], allowing one to take advantage of the high dimensionality of the state space of quantum systems along with sophisticated optimisation algorithms.”
BackgroundForte : A suite of advanced multireference quantum chemistry methods
Evangelista, F. A., Li, C., Verma, P., Hannon, K. P., Schriber, J. B., Zhang, T., Cai, C., Wang, S., He, N., Stair, N. H., et al. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0216512 · Cited by 22
Quantum Machine Learning Tensor Network States
Kardashin, A., Uvarov, A., & Biamonte, J. (2021) · Frontiers in Physics · doi:10.3389/fphy.2020.586374 · Cited by 31
“Similarly, we can also use this external minimization to connect our method to VQE [20].”
MethodComplete Quantum-State Tomography with a Local Random Field
Yang, P., Yu, M., Betzholz, R., Arenz, C., & Cai, J. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.010405 · Cited by 23
“For example, this is the case in hybrid quantum simulation [41], where such expectation measurements are used by a classical co-processor to update a set of parameters governing the quantum simulation [42–46].”
Accelerating Scientific Computing in the Post-Moore’s Era
Hamilton, K. E., Schuman, C. D., Young, S. R., Bennink, R. S., Imam, N., & Humble, T. S. (2020) · ACM Transactions on Parallel Computing · doi:10.1145/3380940 · Cited by 27
“QAOA shares similarities with VQE [126, 164, 194], as a classical parameter search is necessary to identify the quantum state that optimizes the defined objective.”
MethodHong–Ou–Mandel interference between independent III–V on silicon waveguide integrated lasers
Agnesi, C., Lio, B. D., Cozzolino, D., et al. (2019) · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · Cited by 21
Matsuzaki, Y., Hakoshima, H., Sugisaki, K., Seki, Y., & Kawabata, S. (2021) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/abdf20 · Cited by 28
A Tutorial on Quantum Graph Recurrent Neural Network (QGRNN)
Choi, J., Oh, S., & Kim, J. (2021) · International Conference on Information Networking · doi:10.1109/icoin50884.2021.9333917 · Cited by 32
“VQE is a hybrid quantum-classical optimizer using near-term quantum devices [18]–[21].”
BackgroundTsuchimochi, T., Taii, M., Nishimaki, T., & Ten‐no, S. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033100 · Cited by 32
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.