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 901–1,000 of 4,572
Reference-State Error Mitigation: A Strategy for High Accuracy Quantum Computation of Chemistry
Lolur, P., Skogh, M., Dobrautz, W., Warren, C., Biznárová, J., Osman, A., Tancredi, G., Wendin, G. P., Bylander, J., & Rahm, M. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00807 · Cited by 50
Sokolov, I. O., Dobrautz, W., Luo, H., Alavi, A., & Tavernelli, I. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023174 · Cited by 51
Quantum utility – definition and assessment of a practical quantum advantage
Herrmann, N., Arya, D., Doherty, M. W., Mingare, A., Pillay, J. C., Preis, F., & Prestel, S. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00028 · Cited by 70
“[53] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J.”
An expressive ansatz for low-depth quantum approximate optimisation
Vijendran, V., Das, A., Koh, D. E., Assad, S. M., & Lam, P. K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad200a · Cited by 66
Hybrid quantum genetic algorithm for structural damage identification
Xu, L., Wang, X., Wang, Z., & Cao, G. (2025) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.117866 · Cited by 46
Liu, Y., Singh, S., Smith, K. C., Crane, E., Martyn, J. M., Eickbusch, A., Schuckert, A., Li, R. D., Sinanan-Singh, J., Soley, M. B., et al. (2025) · PRX Quantum · doi:10.1103/4rf7-9tfx · Cited by 169
Gutzwiller hybrid quantum-classical computing approach for correlated materials
Yao, Y., Zhang, F., Wang, C., Ho, K., & Orth, P. P. (2021) · Iowa State University Digital Repository (Iowa State University) · Cited by 35
Sureshbabu, S. H., Sajjan, M., Oh, S., & Kais, S. (2021) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.1c00294 · Cited by 47
Bauman, N. P., Chládek, J., Veis, L., Pittner, J., & Kowalski, K. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abf602 · Cited by 39
Variational quantum eigensolver for dynamic correlation functions
Chen, H., Nusspickel, M., Tilly, J., & Booth, G. H. (2021) · Physical Review A · doi:10.1103/physreva.104.032405 · Cited by 47
Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning
Volkoff, T. J., Holmes, Z., & Sornborger, A. T. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040327 · Cited by 45
“[9] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L O’Brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications 5, 4213 (2014).”
BackgroundNew frontiers of quantum computing in chemical engineering
Ajagekar, A., & You, F. (2022) · Korean Journal of Chemical Engineering · doi:10.1007/s11814-021-1027-6 · Cited by 44
Gocho, S., Nakamura, H., Kanno, S., Gao, Q., Kobayashi, T., Inagaki, T., & Hatanaka, M. (2023) · npj Computational Materials · doi:10.1038/s41524-023-00965-1 · Cited by 53
Lykov, D., Wurtz, J., Poole, C., Saffman, M. E., Noel, T., & Alexeev, Y. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00718-4 · Cited by 57
Aromaticity Reversal Induced by Vibrations in Cyclo[16]carbon
Rončević, I., Leslie, F. J., Rossmannek, M., Tavernelli, I., Gross, L., & Anderson, H. L. (2023) · Journal of the American Chemical Society · doi:10.1021/jacs.3c10207 · Cited by 35
Learning efficient decoders for quasichaotic quantum scramblers
Leone, L., Oliviero, S. F. E., Lloyd, S., & Hamma, A. (2024) · Physical Review A · doi:10.1103/physreva.109.022429 · Cited by 67
“The applications of this task range from quantum information and benchmarking protocols [2–4], the understanding of quantum chaos [5–7], quantum chemistry [8–12], quantum cryptography [13– 23], and black hole physics [1, 24].”
BackgroundEnhancing quantum adversarial robustness by randomized encodings
Gong, W., Dong, Y., Li, W., & Deng, D.-L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023020 · Cited by 64
Variational quantum algorithms: fundamental concepts, applications and challenges
Qi, H., Xiao, S., Liu, Z., Gong, C., & Gani, A. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04438-2 · Cited by 62
“Currently, VQE has been demonstrated in various quantum architectures, such as superconducting qubits [50–52], photonic systems [15, 53] and trapped ions [41, 54].”
Distributing circuits over heterogeneous, modular quantum computing network architectures
Andrés-Martínez, P., Forrer, T., Mills, D., Wu, J.-Y., Henaut, L., Yamamoto, K., Murao, M., & Duncan, R. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad6734 · Cited by 68
Pei, Z. (2024) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2024.102334 · Cited by 52
Quantum Computing: Foundations, Architecture and Applications
Christopher Columbus, C., Krishnan, P. T., Elamaran, E., Arul, R., & Kumar, T. S. (2025) · Engineering Reports · doi:10.1002/eng2.70337 · Cited by 48
Error Sensitivity to Environmental Noise in Quantum Circuits for Chemical State Preparation
Sawaya, N. P. D., Smelyanskiy, M., McClean, J. R., & Aspuru-Guzik, A. (2016) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6b00220 · Cited by 35
Self-citationQuantum gates and architecture for the quantum simulation of the Fermi-Hubbard model
Dallaire-Demers, P.-L., & Wilhelm, F. K. (2016) · Physical Review A · doi:10.1103/physreva.94.062304 · Cited by 42
Ru(II) complexes containing uracil nucleobase analogs with cytotoxicity against tumor cells
Corrêa, R. S., Bomfim, L. M., de Oliveira, K. M., et al. (2019) · Journal of Inorganic Biochemistry · doi:10.1016/j.jinorgbio.2019.110751 · Cited by 35
Avkhadiev, A., Shanahan, P. E., & Young, R. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.080501 · Cited by 49
Training Gaussian boson sampling distributions
Banchi, L., Quesada, N., & Arrazola, J. M. (2020) · Physical Review A · doi:10.1103/physreva.102.012417 · Cited by 38
“In this al-gorithm, as in the variational quantum eigensolver [15], a parametric circuit is optimized to approximate the ground state of a Hamiltonian.”
BackgroundMethodRyabinkin, I. G., Izmaylov, A. F., & Genin, S. N. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abda8e · Cited by 45
“In view of these limitations, algorithms based on the variational quantum eigensolver (VQE) framework [3, 4], a hybrid quantum–classical variational scheme, show the most promise.”
VSQL: Variational Shadow Quantum Learning for Classification
Li, G., Song, Z., & Wang, X. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i9.17016 · Cited by 68
“VQA has been applied to many topics such as quantum eigensolver (Peruzzo et al. 2014), quantum simulation (Yuan et al.”
MethodInfluentialHamiltonian operator approximation for energy measurement and ground state preparation
(21925472), T. B., & Kyriienko, O. (2025) · Figshare · Cited by 39
Adaptive job and resource management for the growing quantum cloud
Ravi, G. S., Smith, K. N., Murali, P., & Chong, F. T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00047 · Cited by 77
“Variational Quantum Eigensolver: The goal of this algorithm [30] is to variationally find the lowest eigenvalue of a given problem matrix.”
BackgroundQuantum readout error mitigation via deep learning
Kim, J., Oh, B., Chong, Y., Hwang, E. H., & Park, D. K. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac7b3d · Cited by 49
“[16] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J.”
Variational quantum evolution equation solver
Leong, F. Y., Ewe, W.-B., & Koh, D. E. (2022) · Scientific Reports · doi:10.1038/s41598-022-14906-3 · Cited by 54
“(6) Aui,j = −δx(ui−1,j − 2ui,j + ui+1,j)− δy(ui,j−1 − 2ui,j + ui,j+1),”
Ground-state energy estimation of the water molecule on a trapped ion quantum computerPreprint
Nam, Y., Chen, J.-S., Pisenti, N. C., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.10171 · Cited by 35
“Early demonstrations of the VQE method have been performed on different quantum architectures[12–15], but they rely on dramatic simplifications that work for small molecules but do not readily generalize to larger systems.”
MethodComparison of QAOA with Quantum and Simulated Annealing
Streif, M., & Leib, M. (2019) · arXiv · doi:10.48550/arxiv.1901.01903 · Cited by 35
“Among these are algorithms such as the Variational Quantum Eigensolver (VQE) [6] for quantum chemistry calculations, the Quantum Neural Networks (QNN) [7, 8] for machine learning tasks and the Quantum Approximate Optimization Algorithm (QAOA) [9].”
BackgroundMethodThe Capacity of Quantum Neural Networks
Wright, L. G., & McMahon, P. L. (2019) · arXiv · doi:10.48550/arxiv.1908.01364 · Cited by 35
On physics-informed neural networks for quantum computers
Markidis, S. (2022) · Frontiers in Applied Mathematics and Statistics · doi:10.3389/fams.2022.1036711 · Cited by 60
“In this work, we focus on a hybrid variational solver approach [29, 39, 49] that can be deployed on NISQ systems.”
MethodLeveraging Small-Scale Quantum Computers with Unitarily Downfolded Hamiltonians
Huang, R., Li, C., & Evangelista, F. A. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020313 · Cited by 43
A Conceptual Architecture for a Quantum-HPC Middleware
Saurabh, N., Jha, S., & Luckow, A. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00023 · Cited by 58
“There also exist NISQ approaches, e. g., the variational quantum eigensolver (VQE) [61], and Quantum Monte Carlo (QMC) [62], [63].”
MethodQuantum Simulation of Molecular Response Properties in the NISQ Era
Kumar, A., Asthana, A., Abraham, V., Crawford, T. D., Mayhall, N. J., Zhang, Y., Cincio, Ł., Tretiak, S., & Dub, P. A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00731 · Cited by 48
Paving the way to hybrid quantum–classical scientific workflows
Cranganore, S. S., Maio, V. D., Brandić, I., & Deelman, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.030 · Cited by 55
“The variational quantum eigensolver (VQE) [45, 47, 43] form an important subset of the variational quantum algorithms (VQAs), that computes the eigenvalues of typically large Hermitian matrices ˆ A (see Appendix F) using the Rayleigh-Ritz variational approach [80].”
BackgroundMethodAbadal, S., Han, C. Z., Petrov, V., Galluccio, L., Akyildiz, I. F., & Jornet, J. M. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3399253 · Cited by 44
“…for the state transfer of qubits via waveguided quantum-coherent links and for their orchestration via wireless links between quantum cores [17]. that are classically intractable, which has huge implications in fields such as physics [137], chemistry [138], finance [139], and healthcare [140].”
Characterizing Grover search algorithm on large-scale superconducting quantum computers
AbuGhanem, M. (2025) · Scientific Reports · doi:10.1038/s41598-024-80188-6 · Cited by 61
Optimal Quantum Control with Poor Statistics
Sauvage, F., & Mintert, F. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020322 · Cited by 52
“Those are often given in terms of piecewise constant amplitudes of external electric or magnetic fields [6–10, 43], but also temporal shapes of laser- or microwave pulses with parametrization in terms of Fourier series [11, 12, 37, 44–46], or rotation angles of quantum gates [47, 48] are objects of optimization.”
BackgroundMethodError detection on quantum computers improving the accuracy of chemical calculations
Urbánek, M., Nachman, B. P., & de Jong, W. A. (2020) · Physical Review A · doi:10.1103/physreva.102.022427 · Cited by 46
Predicting toxicity by quantum machine learning
Suzuki, T., & Katouda, M. (2020) · Journal of Physics Communications · doi:10.1088/2399-6528/abd3d8 · Cited by 51
Tilly, J., Jones, G. A., Chen, H., Wossnig, L., & Grant, E. (2020) · Physical Review A · doi:10.1103/physreva.102.062425 · Cited by 48
New trends in quantum machine learning (a)
Buffoni, L., & Caruso, F. (2020) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/132/60004 · Cited by 43
Unitary Selective Coupled-Cluster Method
Fedorov, D. A., Alexeev, Y., Gray, S. K., & Otten, M. (2022) · Quantum · doi:10.22331/q-2022-05-02-703 · Cited by 53
Completely quantum neural networks
Abel, S. A., Criado, J. C., & Spannowsky, M. (2022) · Physical Review A · doi:10.1103/physreva.106.022601 · Cited by 51
“The loss function can also be implemented in an entirely quantum fashion [11, 12, 13] (as a function of the network outputs), and the minimisation of the loss function can be implemented on quantum devices in several ways, in particular using quantum anneal-ers [14, 15, 16, 17, 18, 19].”
MethodVariational Quantum Pulse Learning
Liang, Z., Wang, H., Cheng, J., Ding, Y., Ren, H., Gao, Z., Hu, Z., Boning, D. S., Qian, X., Han, S., et al. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00078 · Cited by 44
“Compared with classical computing, exponential speedup has been demonstrated in areas such as quantum chemistry [21, 6], finance [9], and machine learning [11, 29, 12].”
BackgroundShkolnikov, V. O., Mayhall, N. J., Economou, S. E., & Barnes, E. (2023) · Quantum · doi:10.22331/q-2023-06-12-1040 · Cited by 77
Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design InsightsPreprint
Murali, P., Linke, N. M., Martonosi, M., Javadi-Abhari, A., Nguyen, N. H., & Alderete, C. H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.11349 · Cited by 45
“Quantum computing (QC) is emerging as a promising paradigm for solving classically intractable computational problems in areas such as machine learning [4, 39], cryptography [60], chemistry [32, 50] and others.”
BackgroundQuantum Architecture Search via Deep Reinforcement LearningPreprint
Kuo, E.-J., Fang, Y.-L. L., & Chen, S. Y.-C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.07715 · Cited by 156
“Recent studies in variational quantum algorithms (VQA) have applied quantum computing to many scientific domains, including molecular dynamical studies [37], quantum optimization [38, 39] and various quantum machine learning (QML) applications such as regression [40–42], classification [41, 43–57], generative modeling…”
BackgroundPirhooshyaran, M., & Terlaky, T. (2020) · arXiv · doi:10.48550/arxiv.2012.04046 · Cited by 34
Polla, S., Herasymenko, Y., & O’Brien, T. E. (2021) · Physical Review A · doi:10.1103/physreva.104.012414 · Cited by 38
“A variationally-optimized QDC protocol might be devised, that can efficiently prepare a state in the ground state manifold of some Hamiltonian starting from an arbitrary initial state — differently from the variational quantum eigensolver [7] which requires the preparation of a fiducial state at every iteration.”
BackgroundMethodClemente, G., Crippa, A., & Jansen, K. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.114511 · Cited by 49
“In this section we describe the technique adopted to compute the mass gap and the expectation value of the plaquette operator, using an extension of the Variational Quantum Eigensolver (VQE) algorithm [26].”
MethodChoi, S., Loaiza, I., & Izmaylov, A. F. (2023) · Quantum · doi:10.22331/q-2023-01-03-889 · Cited by 51
A Variational Quantum Linear Solver Application to Discrete Finite-Element Methods
Trahan, C. J., Loveland, M., Davis, N. A., & Ellison, E. (2023) · Entropy · doi:10.3390/e25040580 · Cited by 52
Error statistics and scalability of quantum error mitigation formulas
Qin, D., Chen, Y., & Li, Y. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00707-7 · Cited by 51
“If we use Algorithm 2 to sample circuits, we can evaluate LCES according to LCES 1⁄4 η 1E1⁄23 ðyC f CÞ(2) nu; (19)”
MethodHilaire, P., Vidro, L., Eisenberg, H. S., & Economou, S. E. (2023) · Quantum · doi:10.22331/q-2023-04-27-992 · Cited by 52
“…of a universal fault-tolerant quantum computer [18], this strategy may not be the most efficient for the short-term generation of graph states useful for the so-called noisy intermediate-scale quantum (NISQ) appli-Accepted cations [20], such as photonic variational quantum eigensolvers [21, 22].”
BackgroundReal-Time Krylov Theory for Quantum Computing Algorithms
Shen, Y., Klymko, K., Sud, J., Williams‐Young, D. B., de Jong, W. A., & Tubman, N. M. (2023) · Quantum · doi:10.22331/q-2023-07-25-1066 · Cited by 73
Barison, S., Moreno, J. R., & Motta, M. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb781 · Cited by 106
Zhang, F., Gomes, N., Berthusen, N., Orth, P. P., Wang, C.-Z., Ho, K.-M., & Yao, Y.-X. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013039 · Cited by 37
On quantum ensembles of quantum classifiers
Abbas, A., Schuld, M., & Petruccione, F. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00018-6 · Cited by 48
Ab initio molecular dynamics on quantum computers
Fedorov, D. A., Otten, M., Gray, S. K., & Alexeev, Y. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0046930 · Cited by 50
Pirhooshyaran, M., & Terlaky, T. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00051-z · Cited by 58
“Variational eigenvalue solvers (Peruzzo et al. 2014; Kandala et al. 2017) and quantum neural networks (QNN) (Farhi and Neven 2018; Grant et al. 2018; Verdon et al. 2018; Skolik et al. 2020; Beer et al. 2020; Schuld et al. 2020) are among the many applications of PQC. Analytical approaches towards…”
BackgroundGauge-invariant quantum circuits for U (1) and Yang-Mills lattice gauge theories
Mazzola, G., Mathis, S. V., Mazzola, G., & Tavernelli, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043209 · Cited by 48
Structural risk minimization for quantum linear classifiers
Gyurik, C., Vreumingen, V. D., & Dunjko, V. (2023) · Quantum · doi:10.22331/q-2023-01-13-893 · Cited by 56
“Such algorithms have been proposed for quantum chemistry [5, 6, 7], for optimization [8], and for machine learning [9].”
BackgroundQuantum approximate optimization algorithm with adaptive bias fields
Yu, Y., Cao, C., Dewey, C., Wang, X., Shannon, N., & Joynt, R. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023249 · Cited by 52
Variational quantum classifiers through the lens of the Hessian
Sen, P., Bhatia, A. S., Bhangu, K. S., & Elbeltagi, A. (2022) · PLoS ONE · doi:10.1371/journal.pone.0262346 · Cited by 45
“ground state energy of physical systems [2].”
Computing molecular excited states on a D-Wave quantum annealer
Teplukhin, A., Kendrick, B. K., Mniszewski, S. M., Zhang, Y., Kumar, A., Negre, C. F. A., Anisimov, P. M., Tretiak, S., & Dub, P. A. (2021) · Scientific Reports · doi:10.1038/s41598-021-98331-y · Cited by 38
Optimal Tuning of Quantum Generative Adversarial Networks for Multivariate Distribution Loading
Agliardi, G., & Prati, E. (2022) · Quantum Reports · doi:10.3390/quantum4010006 · Cited by 38
“Alternatively, one may operate hybrid quantum–classical algorithms, where only selected key parts of the workload are delegated to quantum computers [39,40].”
BackgroundModelling carbon capture on metal-organic frameworks with quantum computing
Greene‐Diniz, G., Manrique, D. Z., Sennane, W., Magnin, Y., Shishenina, E., Cordier, P., Llewellyn, P. L., Krompiec, M., Rančić, M. J., & Ramo, D. M. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00155-w · Cited by 50
“VQE is a hybrid quantum-classical algorithm which relies on a quantum computer to estimate the expectation value of energy, while relying on a classical optimiser to suggest improvements of the ansatz [46].”
MethodInfluentialTammaro, A., Galli, D. E., Rice, J. E., & Motta, M. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.2c07653 · Cited by 37
Optimizing quantum circuits with Riemannian gradient flow
Wiersema, R., & Killoran, N. (2023) · Physical Review A · doi:10.1103/physreva.107.062421 · Cited by 62
Quantum computed moments correction to variational estimates
Vallury, H. J., Jones, M. A., Hill, C. D., & Hollenberg, L. C. L. (2020) · Quantum · doi:10.22331/q-2020-12-15-373 · Cited by 44
Entanglement-efficient bipartite-distributed quantum computing
Wu, J.-Y., Matsui, K., Forrer, T., Soeda, A., Andrés-Martínez, P., Mills, D., Henaut, L., & Murao, M. (2023) · Quantum · doi:10.22331/q-2023-12-05-1196 · Cited by 43
“In Section 5, we demonstrate the enhancement of entanglement efficiency in unitary coupled-cluster (UCC) circuits [45, 46] employing our method.”
BackgroundMethodRobust implementation of generative modeling with parametrized quantum circuits
Leyton‐Ortega, V., Perdomo‐Ortiz, A., & Perdomo, O. M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00040-2 · Cited by 51
“In this domain, hybrid quantum-classical (HQC) algorithms, such as the variational quantum eigensolver (VQE) (Peruzzo et al. 2014; McClean et al. 2016) and the quantum approximate optimization algorithm (QAOA) (Farhi and Goldstone 2014), provide ways to use quantum computing hardware for practical applications.”
MethodUltrafast variational simulation of nontrivial quantum states with long-range interactions
Ho, W. W., Jonay, C., & Hsieh, T. H. (2019) · Physical Review A · doi:10.1103/physreva.99.052332 · Cited by 52
“[27] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J.”
MethodMitarai, K., Yan, T., & Fujii, K. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.11.044087 · Cited by 32
Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
Barron, G. S., Gard, B., Altman, O. J., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.034003 · Cited by 44
“One of the most popular algorithms within the reach of near term devices is the variational quantum eigensolver (VQE) [2–7].”
BackgroundMethodSerret, M. F., Marchand, B., & Ayral, T. (2020) · Physical Review A · doi:10.1103/physreva.102.052617 · Cited by 32
Castaldo, D., Rosa, M., & Corni, S. (2021) · Physical Review A · doi:10.1103/physreva.103.022613 · Cited by 37
“…possibility that we considered for the classical optimization procedure is the Nelder-Mead (NM) algorithm[42] which has been applied successfully in the CRAB and DCRAB methods[43, 44] and has been the choice for various hybrid quantum classical approaches to determine the electronic structure[18].”
BackgroundMethodNeural-network variational quantum algorithm for simulating many-body dynamics
Lee, C., Patil, P., Zhang, S., & Hsieh, C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023095 · Cited by 42
“[33] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man Hong Yung, Xiao Qi Zhou, Peter J.”
BackgroundHessian-based optimization of constrained quantum control
Dalgaard, M., Motzoi, F., Jensen, J. H. M., & Sherson, J. F. (2020) · Physical Review A · doi:10.1103/physreva.102.042612 · Cited by 34
Qubit-efficient entanglement spectroscopy using qubit resets
Yirka, J., & Subaşı, Y. (2021) · Quantum · doi:10.22331/q-2021-09-02-535 · Cited by 55
“While some approaches help for specific applications [5, 19, 37, 40] or for individual circuits [39], there are few general techniques for (re)designing low-depth quantum algorithms.”
BackgroundA stochastic approach to unitary coupled cluster
Filip, M.-A., & Thom, A. J. W. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0026141 · Cited by 44
Aydeniz, K. Y., Gard, B., Jakowski, J., Majumder, S., Barron, G. S., Siopsis, G., Humble, T. S., & Pooser, R. C. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100012 · Cited by 47
“In particular, the VQE method offered the first experimental example of an electronic structure calculation by quantum computing on quantum photonic hardware [12].”
MethodOh, S., Choi, J., Kim, J., & Kim, J. (2021) · International Conference on Information Networking · doi:10.1109/icoin50884.2021.9333906 · Cited by 33
“In particular, quantum computing algorithms pro-pose new efficient computing models in the field of machine learning [3]–[6].”
BackgroundVariational quantum algorithm with information sharing
Self, C. N., Khosla, K. E., Smith, A. W. R., Sauvage, F., Haynes, P. D., Knolle, J., Mintert, F., & Kim, M. S. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00452-9 · Cited by 51
“As an example VQA, we consider the Variational Quantum Eigensolver (VQE) [29], used to find the ground states of qubit Hamiltonians H.”
MethodKottmann, K., Metz, F., Fraxanet, J., & Baldelli, N. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043184 · Cited by 56
Variational quantum eigensolver techniques for simulating carbon monoxide oxidation
Sapova, M. D., & Fedorov, A. K. (2022) · Communications Physics · doi:10.1038/s42005-022-00982-4 · Cited by 47
Entanglement from Tensor Networks on a Trapped-Ion Quantum Computer
Foss‐Feig, M., Ragole, S., Potter, A. C., Dreiling, J., Figgatt, C., Gaebler, J., Hall, A., Moses, S. A., Pino, J., Spaun, B., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.150504 · Cited by 39
Quantum simulation of chiral phase transitions
Czajka, A. M., Kang, Z.-B., Ma, H., & Zhao, F. (2022) · Journal of High Energy Physics · doi:10.1007/jhep08(2022)209 · Cited by 47
Variational quantum attacks threaten advanced encryption standard based symmetric cryptography
Wang, Z., Wei, S., Long, G., & Hanzo, L. (2022) · Science China Information Sciences · doi:10.1007/s11432-022-3511-5 · Cited by 43
“Under these restrictions, various classical-quantum hybrid algorithms, including the variational quantum algorithm (VQA) [19–22], and the Quantum Approximate Optimization Algorithm (QAOA) [23] have been proposed.”
Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
Fontana, E., Cerezo, M., Arrasmith, A., Rungger, I., & Coles, P. J. (2022) · Quantum · doi:10.22331/q-2022-09-15-804 · Cited by 65
“Arguably, the leading role has been played by Parametrized Quantum Circuits (PQCs), which are exploited for both Variational Quantum Algorithms [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14] and Quantum Neural Networks [15, 16, 17, 18, 19].”
BackgroundMethodInfluentialQuantum computation for periodic solids in second quantization
Ivanov, A. V., Sünderhauf, C., Holzmann, N., Ellaby, T., Kerber, R. N., Jones, G. A., & Camps, J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013200 · Cited by 47
“Two main families of quantum algorithms can perform such calculation: VQE [13] and quantum phase estimation (QPE) [52–54].”
BackgroundModel-Independent Learning of Quantum Phases of Matter with Quantum Convolutional Neural Networks
Liu, Y.-J., Smith, A., Knap, M., & Pollmann, F. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.220603 · Cited by 44
Castaldo, D., Rosa, M., & Corni, S. (2020) · arXiv · doi:10.48550/arxiv.2007.00368 · Cited by 32
Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
Barron, G. S., Gard, B. T., Altman, O. J., Mayhall, N. J., Barnes, E., & Economou, S. E. (2020) · arXiv · doi:10.48550/arxiv.2003.00171 · 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.