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,501–1,600 of 4,572
Fidelity Overhead for Nonlocal Measurements in Variational Quantum Algorithms
Bansingh, Z. P., Yen, T.-C., Johnson, P. D., & Izmaylov, A. F. (2022) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.2c04726 · Cited by 24
Mitigating algorithmic errors in quantum optimization through energy extrapolation
Cao, C., Yu, Y., Wu, Z., Shannon, N., Zeng, B., & Joynt, R. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac969c · Cited by 26
Q2Chemistry: A quantum computation platform for quantum chemistry
Fan, Y., Liu, J., Zeng, X., Xu, Z., Shang, H., Li, Z., & Yang, J. (2022) · JUSTC · doi:10.52396/justc-2022-0118 · Cited by 30
QCSH: A full quantum computer nuclear shell-model package
Lv, P., Wei, S., Xie, H.-N., & Long, G. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2044-5 · Cited by 20
“In the quantum-classic hybrid model, VQE, the computation process is switched iteratively between a classical computer and a quantum computer.”
BackgroundInfluentialLaziness, barren plateau, and noises in machine learning
Liu, J., Lin, Z., & Jiang, L. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad35a3 · Cited by 39
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 19
Self-citationRelation between fermionic and qubit mean fields in the electronic structure problem
Ryabinkin, I. G., Genin, S. N., & Izmaylov, A. F. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5055357 · Cited by 21
Li, S., Cui, J., & Ren, J. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.129111 · Cited by 17
Quantum gradient descent and Newton’s method for constrained polynomial optimization
Rebentrost, P., Schuld, M., Wossnig, L., Petruccione, F., & Lloyd, S. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab2a9e · Cited by 196
1.4 The Future of Computing: Bits + Neurons + Qubits
Gil, D., & Green, W. M. J. (2020) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc19947.2020.9062918 · Cited by 22
“In near-term quantum computers, we have developed a variational quantum eigensolver (VQE) [59] [60] employing short-depth quantum circuits, which combines “qubits + bits” to build a hybrid quantum-classical algorithm [61].”
MethodQuantum variational approach to lattice gauge theory at nonzero density
Yamamoto, A. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.014506 · Cited by 24
Quantum Error Mitigation Relying on Permutation Filtering
Xiong, Y., Ng, S. X., & Hanzo, L. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3132914 · Cited by 18
“As proposed in [17], variational quantum algorithms [17]– [21] constitute one of the new algorithm design paradigms harnessing the computational power of NISQ computers without relying on quantum error correction techniques.”
Quantum Algorithm for Full Configuration Interaction Calculations without Controlled Time Evolutions
Sugisaki, K., Sakai, C., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2021) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.1c03214 · Cited by 18
Miki, T., Okita, R., Shimada, M., Tsukayama, D., & Shirakashi, J. (2022) · AIP Advances · doi:10.1063/5.0077706 · Cited by 17
Fermionic approach to variational quantum simulation of Kitaev spin models
Jahin, A., Li, A. C. Y., Iadecola, T., Orth, P. P., Perdue, G., Macridin, A., Alam, M. S., & Tubman, N. M. (2022) · Physical Review A · doi:10.1103/physreva.106.022434 · Cited by 20
Hybrid Quantum-Classical Unit Commitment
Mahroo, R., & Kargarian, A. (2022) · IEEE Texas Power and Energy Conference (TPEC) · doi:10.1109/tpec54980.2022.9750763 · Cited by 22
“A few algorithms, such as quantum approximate optimization algorithm (QAOA) [8] and variational quantum eigensolver (VQE) [9], are available to solve QUBOs.”
MethodDiscovering optimal fermion-qubit mappings through algorithmic enumeration
Chiew, M., & Strelchuk, S. (2023) · Quantum · doi:10.22331/q-2023-10-18-1145 · Cited by 45
“Algorithms for near–term quantum computers have sprung up in answer to these challenges, such as the variational quantum eigensolver [24, 25, 16], which is only just coming within reach of current technology.”
BackgroundProgramming physical quantum systems with pulse-level control
Smith, K. N., Ravi, G. S., Alexander, T., Bronn, N. T., Carvalho, A. R. R., Cervera-Lierta, A., Chong, F. T., Chow, J. M., Cubeddu, M., Hashim, A., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.900099 · Cited by 32
“Proposed applications of VQAs include ground state energy estimation of molecules [6] and MAXCUT approximation [2].”
MethodVariational Entanglement-Assisted Quantum Process Tomography with Arbitrary Ancillary Qubits
Xue, S., Wang, Y., Zhan, J., Wang, Y., Zeng, R., Ding, J., Shi, W., Liu, Y., Liu, Y., Huang, A., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.133601 · Cited by 28
TorchQuantum Case Study for Robust Quantum Circuits
Wang, H., Liang, Z., Gu, J., Li, Z., Ding, Y., Jiang, W., Shi, Y., Pan, D. Z., Chong, F. T., & Han, S. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3561118 · Cited by 45
Error-Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis
Jose, S. T., & Simeone, O. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3229747 · Cited by 25
“To address this question, we consider the most fundamental instance of VQAs, namely the variational quantum eigensolver (VQE) [6].”
MethodImproved Variational Quantum Eigensolver Via Quasidynamical Evolution
Jattana, M. S., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.024047 · Cited by 26
Efficient quantum analytic nuclear gradients with double factorization
Hohenstein, E. G., Oumarou, O., Al-Saadon, R., Anselmetti, G.-L., Scheurer, M., Gogolin, C., & Parrish, R. M. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0137167 · Cited by 21
Variational quantum solutions to the Shortest Vector Problem
Albrecht, M. R., Prokop, M., Shen, Y., & Wallden, P. (2023) · Quantum · doi:10.22331/q-2023-03-02-933 · Cited by 26
“problem, we focus on two most widely used VQAs for combinatorial optimisation, namely Variational Quantum Eigensolver (VQE) [21, 22] and Quantum Approximate Optimisation Algorithm (QAOA) [23].”
MethodVolpe, D., Cirillo, G. A., Zamboni, M., & Turvani, G. (2023) · IEEE Access · doi:10.1109/access.2023.3260765 · Cited by 22
“Other quantum-classical algorithms for solving optimization problems are those based on variational routines like the ones in [36], [37] or the quantum-genetic presented in [38].”
BackgroundOptimizing the information extracted by a single qubit measurement
Polla, S., Anselmetti, G.-L., & O’Brien, T. E. (2023) · Physical Review A · doi:10.1103/physreva.108.012403 · Cited by 26
“[9] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J.”
BackgroundAn exponentially-growing family of universal quantum circuits
Kordzanganeh, M., Sekatski, P., Fedichkin, L. E., & Melnikov, A. A. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ace757 · Cited by 37
“[8] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J.”
Evolutionary-based searching method for quantum circuit architecture
Zhang, A., & Zhao, S. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04033-x · Cited by 30
“The effectiveness of VQAs with small-scale structures has been demonstrated by many works [6, 8, 9, 16, 22, 23, 25, 30, 32, 34, 41].”
BackgroundAmsler, M., Deglmann, P., Degroote, M., Kaicher, M., Kiser, M., Kühn, M., Kumar, C., Maier, A., Samsonidze, G. G., Schroeder, A. K., et al. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0146934 · Cited by 28
Interconnect Fabrics for Multi-Core Quantum Processors: A Context Analysis
Escofet, P., Rached, S. B., Rodrigo, S., Almudéver, C. G., Alarcón, E., & Abadal, S. (2023) · International Workshop on Network on Chip Architectures (NoCArc) · doi:10.1145/3610396.3623267 · Cited by 28
“As a result, this technology offers a vast array of potential applications spanning across various fields, including prime factorization [50], database search [12], physics [28], chemistry [37], finance [55], and healthcare [53].”
BackgroundComplexity of life sciences in quantum and AI era
Pyrkov, A. N., Aliper, A., Bezrukov, D. S., Podolskiy, D. I., Ren, F., & Zhavoronkov, A. A. (2024) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1701 · Cited by 30
“51 Specifically, these algorithms are capable of processing ground state calculations 52,53 and linear systems 54 at a faster rate, which enables more precise predictions of drug-receptor interactions 55 and protein folding.”
MethodQibolab: an open-source hybrid quantum operating system
Efthymiou, S., Orgaz, Á., Carobene, R., Cereijo, J., Pasquale, A., Ramos-Calderer, S., Bordoni, S., Fuentes-Ruiz, D., Candido, A., Pedicillo, E., et al. (2024) · Quantum · doi:10.22331/q-2024-02-12-1247 · Cited by 36
Optimizing edge-state transfer in a Su-Schrieffer-Heeger chain via hybrid analog-digital strategies
Romero, S. V., Chen, X., Platero, G., & Ban, Y. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034033 · Cited by 21
“To foster the development of DQS, hybrid quantum-classical optimization algorithms such as variational ∗ ybanxc@gmail.com quantum algorithms [17] grounded in gradient descent [18], or variational quantum eigensolvers [19], become crucial.”
MethodQuantum neural estimation of entropies
Goldfeld, Z., Patel, D., Sreekumar, S., & Wilde, M. M. (2024) · Physical Review A · doi:10.1103/physreva.109.032431 · Cited by 34
“VQAs have now been applied to a variety of problems, including quantum simulation [48], optimization [49–51], and machine learning [52].”
BackgroundToward Hybrid Classical Deep Learning-Quantum Methods for Steganalysis
Wardhani, R. W., Putranto, D. S. C., Le, T.-T.-H., Ji, J., & Kim, H. (2024) · IEEE Access · doi:10.1109/access.2024.3381615 · Cited by 22
“With parameters for part encoding, variational, and measurement circuits, we utilize a general form similar to that of a previous study [46], [47] and [48].”
MethodState Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry
D’Cunha, R., Otten, M., Hermes, M. R., Gagliardi, L., & Gray, S. K. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c01283 · Cited by 19
What is Quantum Parallelism, Anyhow?
Markidis, S. (2024) · ISC High Performance (ISC) · doi:10.23919/isc.2024.10528926 · Cited by 32
Shell-model study of58Ni using quantum computing algorithm
Bhoy, B., & Stevenson, P. D. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad5756 · Cited by 33
Variational Quantum Algorithms for Semidefinite Programming
Patel, D., Coles, P. J., & Wilde, M. M. (2024) · Quantum · doi:10.22331/q-2024-06-17-1374 · Cited by 34
Beyond MP2 initialization for unitary coupled cluster quantum circuits
Hirsbrunner, M. R., Chamaki, D., Mullinax, J. W., & Tubman, N. M. (2024) · Quantum · doi:10.22331/q-2024-11-26-1538 · Cited by 25
Grimsley, H. R., & Evangelista, F. A. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9fa2 · Cited by 28
Majid, B., Sofi, S. A., & Jabeen, Z. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00266-4 · Cited by 22
Efficient quantum simulation of QCD jets on the light front
Qian, W., Li, M., Salgado, C. A., & Kreshchuk, M. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.096001 · Cited by 29
Stabilizer Tensor Networks with Magic State Injection
Nakhl, A. C., Harper, B., West, M. T., Dowling, N., Sevior, M. E., Quella, T., & Usman, M. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.190602 · Cited by 45
“…research community with only a moderate amount of entanglement and magic, in particular Noisy Intermediate Scale Quantum (NISQ) [50] algorithms such as the Quantum Approximate Optimisation Algorithm (QAOA) [51], the Variational Quantum Eigensolver (VQE) [52], or Quantum Machine Learning (QML) [2].”
Fundamental limits on the losses of phase and amplitude optical actuators
Zanotto, S., Morichetti, F., & Melloni, A. I. (2015) · Laser & Photonics Review · doi:10.1002/lpor.201500101 · Cited by 18
Xu, L., Lee, J. T., & Freericks, J. K. (2020) · Modern Physics Letters B · doi:10.1142/s0217984920400497 · Cited by 26
Shirakawa, T., Seki, K., & Yunoki, S. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013004 · Cited by 16
A variational quantum algorithm for Hamiltonian diagonalization
Zeng, J., Cao, C., Zhang, C., Xu, P., & Zeng, B. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac11a7 · Cited by 24
Efficient two-electron ansatz for benchmarking quantum chemistry on a quantum computer
Smart, S. E., & Mazziotti, D. A. (2020) · University of Chicago · doi:10.6082/2cxwm-y5012 · Cited by 16
Transition Slow-Down by Rydberg Interaction of Neutral Atoms and a Fast Controlled-not Quantum Gate
Shi, X. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.054058 · Cited by 16
Quantum simulation of molecules without fermionic encoding of the wave function
Mazziotti, D. A., Smart, S. E., & Mazziotti, A. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac3573 · Cited by 16
Variational quantum solver employing the PDS energy functional
Peng, B., & Kowalski, K. (2021) · Quantum · doi:10.22331/q-2021-06-10-473 · Cited by 18
Relevance of Near-Term Quantum Computing in the Cloud: A Humanities Perspective
Barzen, J., Leymann, F., Falkenthal, M., Vietz, D., Weder, B., & Wild, K. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-72369-9_2 · Cited by 21
“One example is a hybrid algorithm calledVariational QuantumEigensolver for determining eigenvalues [59].”
MethodQuantum maximum mean discrepancy GAN
Huang, Y., Lei, H., Li, X., & Yang, G. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.091 · Cited by 19
Quantum amplitude-amplification operators
Kwon, H., & Bae, J. (2021) · Physical Review A · doi:10.1103/physreva.104.062438 · Cited by 26
Complexity of Supersymmetric Systems and the Cohomology Problem
Cade, C., & Crichigno, P. M. (2024) · Quantum · doi:10.22331/q-2024-04-30-1325 · Cited by 49
Stober, S. T., Harwood, S. M., Trenev, D., Barkoutsos, P. K., Gujarati, T. P., & Mostame, S. (2022) · Physical Review A · doi:10.1103/physreva.105.012425 · Cited by 18
Quantum algorithms for the generalized eigenvalue problem
Liang, J., Shen, S., Li, M., & Fei, S.-M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03370-z · Cited by 20
“The minimal value of the loss functionC implies the ground energy and its corresponding state is thought to be an approximate lowest eigenvector [8].”
BackgroundMethodInfluentialOptimizing counterdiabaticity by variational quantum circuits
Sun, D., Chandarana, P., Xin, Z., & Chen, X. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0282 · Cited by 20
“Among various meth-ods [8–11], adiabatic quantum optimization (AQO) [12] is an e ff ective method to tackle these problems.”
Approximate Quantum Circuit Reconstruction
Chen, D., Baheri, B., Chaudhary, V., Guan, Q., Xie, N., & Xu, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00073 · Cited by 24
“In particular, variational quantum circuits has so far received great attention [4], with well-known examples like quantum approximate optimization algorithm (QAOA) [5] and variational quantum eigensolver (VQE) [6] [7].”
MethodQuantum Computation of Hydrogen Bond Dynamics and Vibrational Spectra
Richerme, P., Revelle, M., Yale, C. G., Lobser, D., Burch, A. D., Clark, S., Saha, D., Lopez-Ruiz, M. A., Dwivedi, A., Smith, J. M., et al. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c01601 · Cited by 33
“[33] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nat.”
BackgroundClassically optimized variational quantum eigensolver with applications to topological phases
Okada, K. N., Osaki, K., Mitarai, K., & Fujii, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043217 · Cited by 30
Optically controlled polariton condensate molecules
Cherotchenko, E. D., Sigurðsson, H., Askitopoulos, A., & Nalitov, A. V. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.103.115309 · Cited by 17
Certified variational quantum algorithms for eigenstate preparation
Kardashin, A., Uvarov, A., Yudin, D. I., & Biamonte, J. (2020) · Physical Review A · doi:10.1103/physreva.102.052610 · Cited by 18
Optimizing Quantum Search Using a Generalized Version of Grover's AlgorithmPreprint
Gilliam, A., Pistoia, M., & Gonciulea, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.06468 · Cited by 39
“While some of such algorithms are meant to address a particular problem in a specific domain, a large body of research has been devoted to the creation of algorithms of general applicability, such as Shor’s algorithm [1], Grover’s Search [2], and Variational Quantum Eigensolver [3].”
BackgroundSimulating Energy Transfer in Molecular Systems with Digital Quantum Computers
Lee, C.-K., Lau, J. W. Z., Shi, L., & Kwek, L. C. (2021) · arXiv · doi:10.48550/arxiv.2101.06879 · Cited by 16
Variational Quantum Gibbs State Preparation with a Truncated Taylor Series
Wang, Y., Li, G., & Wang, X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.054035 · Cited by 124
“[28] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications 5, 4213 (2014).”
BackgroundObservation of a non-Hermitian supersonic mode on a trapped-ion quantum computer
Zhang, Y., Carrasquilla, J., & Kim, Y. B. (2025) · Nature Communications · doi:10.1038/s41467-025-57930-3 · Cited by 39
“Namely, we fi rst turnoffthenon-Hermitian fi eldandsolvefortheHamiltonian ’ sground state with a VQE algorithm and gradually turn on the imaginary fi eld, feeding the previous optimization result as an initialization.”
Simulating quantum circuit expectation values by Clifford perturbation theory
Begušić, T., Hejazi, K., & Chan, G. K. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0269149 · Cited by 75
Pauli path simulations of noisy quantum circuits beyond average case
González-García, G., Cirac, J. I., & Trivedi, R. (2025) · Quantum · doi:10.22331/q-2025-05-05-1730 · Cited by 57
“Out of these, QAOA (for solving classical combinatiorial optimizazion problems) [10], and VQE (for preparing groundstates) [11] stand out.”
Quantum-selected configuration interaction with time-evolved state
Mikkelsen, M., & Nakagawa, Y. O. (2025) · Physical Review Research · doi:10.1103/75pv-hbrx · Cited by 65
“Among these, the variational quantum eigensolver (VQE) [6, 7] has attracted the most attention.”
Impacts of noise and structure on quantum information encoded in a quantum memory
Otten, M., Kapoor, K., Özgüler, A. B., Holland, E. T., Kowalkowski, J., Alexeev, Y., & Lyon, A. L. (2021) · Physical Review A · doi:10.1103/physreva.104.012605 · Cited by 24
Semantics for variational Quantum programming
Jia, X., Kornell, A., Lindenhovius, B., Mislove, M. W., & Zamdzhiev, V. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3498687 · Cited by 31
“Variational quantum algorithms [McClean et al. 2016; Peruzzo et al. 2014] are increasingly important in quantum computation.”
BackgroundQuantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems
Liang, J., Wei, S.-J., & Fei, S.-M. (2022) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1844-7 · Cited by 16
Extending the reach of quantum computing for materials science with machine learning potentials
Schuhmacher, J., Mazzola, G., Tacchino, F., Dmitriyeva, O., Bui, T., Huang, S., & Tavernelli, I. (2022) · AIP Advances · doi:10.1063/5.0099469 · Cited by 19
Fermionic Correlation Functions from Randomized Measurements in Programmable Atomic Quantum Devices
Naldesi, P., Elben, A., Minguzzi, A., Clément, D., Zoller, P., & Vermersch, B. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.060601 · Cited by 26
Hong, C.-L., Tsai, T., Chou, J., Chen, P.-J., Tsai, P.-K., Chen, Y.-C., Kuo, E.-J., Srolovitz, D. J., Hu, A., Cheng, Y., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020360 · Cited by 24
Domain-Specific Quantum Architecture Optimization
Lin, W.-H., Tan, D. B., Niu, M. Y., Kimko, J., & Cong, J. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3202870 · Cited by 26
Variational Quantum Algorithm Applied to Collision Avoidance of Unmanned Aerial Vehicles
Huang, Z., Li, Q., Zhao, J., & Song, M. (2022) · Entropy · doi:10.3390/e24111685 · Cited by 19
Digital Quantum Simulation of the Spin-Boson Model under Markovian Open-System Dynamics
Burger, A., Kwek, L. C., & Poletti, D. (2022) · Entropy · doi:10.3390/e24121766 · Cited by 26
“These techniques are ideally suited for the evaluation of different quantities such as eigenstates [14], general quantum approximate optimization algorithms [15], off-diagonal elements of matrices [16] and more [13].”
BackgroundWeaving, T., Ralli, A., Kirby, W. M., Tranter, A., Love, P. J., & Coveney, P. V. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00910 · Cited by 23
“This idea comes from the theory of pseudopotential approximations, 62 in which it is observed that chemically relevant electrons are”
MethodSelf-citationStochastic quantum Krylov protocol with double-factorized Hamiltonians
Stair, N. H., Cortes, C. L., Parrish, R. M., Cohn, J., & Motta, M. (2023) · Physical Review A · doi:10.1103/physreva.107.032414 · Cited by 21
“Like many other variational quantum algorithms [59– 61], QKD approaches exploit an inherent trade-off be-tween circuit depth and sampling complexity.”
Extension of the Trotterized Unitary Coupled Cluster to Triple Excitations
Haidar, M., Rančić, M. J., Maday, Y., & Piquemal, J. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c01753 · Cited by 19
Measurement optimization of variational quantum simulation by classical shadow and derandomization
Nakaji, K., Endo, S., Matsuzaki, Y., & Hakoshima, H. (2023) · Quantum · doi:10.22331/q-2023-05-04-995 · Cited by 29
Progress and prospects of quantum computing in sustainable development: An analytical review
Sood, V., & Chauhan, R. P. (2023) · Expert Systems · doi:10.1111/exsy.13389 · Cited by 16
“The fourth is by Peruzzo et al. (2014) in cluster #0, with a frequency of 57.”
BackgroundDíez-Valle, P., Luis-Hita, J., Hernández-Santana, S., Martínez-García, F., Díaz-Fernández, Á., Andrés, E., García‐Ripoll, J. J., Sánchez-Martínez, E., & Porras, D. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace474 · Cited by 22
“…VQAs that have been studied in this context are the Quantum Approximate Optimization Algorithm (QAOA) [36], Variational Quantum Eigensolver (VQE) [37], recursive QAOA (RQAOA) [38], Filtering VQE (F-VQE) [39], Layer VQE (L-VQE) [40], ADAPT-QAOA [41], Variational Quantum Imag-inary Time Evolution…”
MethodVolumetric Benchmarking of Error Mitigation with Qermit
Cîrstoiu, C., Dilkes, S., Mills, D., Sivarajah, S., & Duncan, R. (2023) · Quantum · doi:10.22331/q-2023-07-13-1059 · Cited by 30
“2 and inspired by ansatz circuits for NISQ algorithms [35, 36].”
MethodInfluentialPrediction of Protein‐Ligand Binding Affinity by a Hybrid Quantum‐Classical Deep Learning Algorithm
Dong, L., Li, Y., Liu, D., Ji, Y., Hu, B., Shi, S., Zhang, F., Hu, J., Qian, K., Jin, X., et al. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300107 · Cited by 18
A hybrid quantum–classical neural network for learning transferable visual representation
Wang, R., Richerme, P., & Chen, F. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf1c7 · Cited by 18
Challenges and Opportunities in Quantum Software Architecture
Yue, T., Mauerer, W., Ali, S., & Taibi, D. (2023) · Springer eBooks · doi:10.1007/978-3-031-36847-9_1 · Cited by 35
Demonstration of a quantum-classical coprocessing protocol for simulating nuclear reactions
Turro, F., Chistolini, T., Hashim, A., Kim, Y., Livingston, W. P., Kreikebaum, J. M., Wendt, K., DuBois, J. L., Pederiva, F., Quaglioni, S., et al. (2023) · Physical Review A · doi:10.1103/physreva.108.032417 · Cited by 26
Extending the variational quantum eigensolver to finite temperatures
Selisko, J., Amsler, M., Hammerschmidt, T., Drautz, R., & Eckl, T. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad1340 · Cited by 30
“Although the classical optimization in a VQE is challenging due to the presence of local minima and barren plateaus [13–15], its utility has already been experimentally demonstrated for small molecular systems [11, 16].”
Variational Quantum Shot-Based Simulations for Waveguide Modes
Colella, E., Beloin, S., Bastianelli, L., Primiani, V. M., Moglie, F., & Gradoni, G. (2023) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2023.3339243 · Cited by 16
“The cost function to be minimized by VQE to find the ground state and the excited states of the system is defined as follows [31]: where m is the m th excited state to be calculated, | ψ(θ) ⟩ is the parameterized quantum state, that finds the solution of the Helmholtz equation.”
BackgroundMethodMitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
Broers, L., & Mathey, L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013076 · Cited by 25
Variational quantum algorithms for scanning the complex spectrum of non-Hermitian systems
Xie, X.-D., Xue, Z., & Zhang, D.-B. (2024) · Frontiers of Physics · doi:10.1007/s11467-023-1382-3 · Cited by 26
Fitzek, D., Jonsson, R., Dobrautz, W., & Schäfer, C. (2024) · Quantum · doi:10.22331/q-2024-04-09-1313 · Cited by 28
Low-depth simulations of fermionic systems on square-grid quantum hardware
Algaba, M. G., Sriluckshmy, P. V., Leib, M., & Šimkovic, F. (2024) · Quantum · doi:10.22331/q-2024-04-30-1327 · Cited by 31
Measurement-efficient quantum Krylov subspace diagonalisation
Zhang, Z., Wang, A., Xu, X., & Li, Y. (2024) · Quantum · doi:10.22331/q-2024-08-13-1438 · Cited by 40
“They possess potential advantages as the conventional quantum algorithm to solve the ground-state problem, quantum phase estimation, requires considerable quantum resources [21, 22], while the variational quantum eigensolver is limited by the ansatz and classical optimisation bottlenecks [23, 24].”
BackgroundSolving constrained optimization problems via the variational quantum eigensolver with constraints
Le, T. V., & Kekatos, V. (2024) · Physical Review A · doi:10.1103/physreva.110.022430 · Cited by 29
Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
Lee, G., Lee, D., & Huh, J. (2024) · Quantum · doi:10.22331/q-2024-09-19-1477 · Cited by 44
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.