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 401–500 of 4,572
Huang, H.-L., Xu, X., Guo, C., Tian, G., Wei, S.-J., Sun, X., Bao, W., & Long, G. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2057-y · Cited by 142
AI/ML algorithms and applications in VLSI design and technology
Amuru, D., Zahra, A., Vudumula, H. V., Cherupally, P. K., Gurram, S. R., Ahmad, A., & Abbas, Z. (2023) · Integration · doi:10.1016/j.vlsi.2023.06.002 · Cited by 136
“[156] approach, which was tested on two circuits: a toy circuit (comprising eight gates) and another circuit called “Apte,” taken from the microelectronics center of North Carolina placement circuit benchmark suite, which is often considered as a VLSI placement benchmark circuit.”
MethodBravyi-Kitaev Superfast simulation of electronic structure on a quantum computer
Setia, K., & Whitfield, J. D. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5019371 · Cited by 96
Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
Bonet-Monroig, X., Babbush, R., & O’Brien, T. E. (2020) · Physical Review X · doi:10.1103/physrevx.10.031064 · Cited by 166
“The advent of variational methods, most notably the variational quantum eigensolver [1, 2], inspires hope that useful contributions to our understanding of strongly-correlated physical and chemical systems might be achievable in pre-error corrected quantum devices [3].”
BackgroundMethodA Full Quantum Eigensolver for Quantum Chemistry Simulations
Wei, S., Li, H., & Long, G. (2020) · Research · doi:10.34133/2020/1486935 · Cited by 111
“Here we adopt the standard gradient descent method as the classical optimizer in VQE.”
BackgroundInfluentialMeasuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
Banchi, L., & Crooks, G. E. (2021) · Quantum · doi:10.22331/q-2021-01-25-386 · Cited by 96
“Therefore, alternative algorithms, better suited for exploiting these devices have been proposed, such as the variational quantum eigensolver [18, 32], the quantum approximate optimization algorithm [14], quantum autoencoders [35], quantum simulation [24], and quantum classifiers for machine learning [3, 13, 29, 37, 3…”
BackgroundMethodQubit-excitation-based adaptive variational quantum eigensolver
Yordanov, Y. S., Armaos, V., Barnes, C. H., & Arvidsson-Shukur, D. R. M. (2021) · Apollo (University of Cambridge) · doi:10.17863/cam.75907 · Cited by 95
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2023) · Nature Communications · doi:10.1038/s41467-023-41217-6 · Cited by 213
“[31] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J.”
Anschuetz, E., Olson, J., Aspuru-Guzik, A., & Cao, Y. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-14082-3_7 · Cited by 104
Self-citationQuantum computing for neutrino-nucleus scattering
Roggero, A., Li, A. C. Y., Carlson, J., Gupta, R., & Perdue, G. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.074038 · Cited by 110
García-Pérez, G., Rossi, M. A. C., Sokolov, B., Tacchino, F., Barkoutsos, P. K., Mazzola, G., Tavernelli, I., & Maniscalco, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040342 · Cited by 136
“The application of VQE has already been demonstrated in many proof-of-principle experiments [15, 22, 24–26].”
MethodInfluentialPreparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge
Farrell, R. C., Chernyshev, I. A., Powell, S. J. M., Zemlevskiy, N. A., Illa, M., & Savage, M. J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054512 · Cited by 178
Robust determination of molecular spectra on a quantum processorPreprint
Colless, J., Ramasesh, V., Dahlen, D., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.06408 · Cited by 95
“Based on the quantum variational principle—that the ground-state wavefunction of any Hamiltonian minimizes the expected energy [12]—an iterative protocol, known as the Variational Quantum Eigensolver (VQE) was developed [13].”
MethodSelf-citationOn the Universality of the Quantum Approximate Optimization Algorithm
Morales, M. E. S., Biamonte, J., & Zimborás, Z. (2019) · arXiv · doi:10.48550/arxiv.1909.03123 · Cited by 95
Robust Architecture for Programmable Universal Unitaries
Saygin, M. Y., Kondratyev, I. V., Dyakonov, I. V., Mironov, S. A., Straupe, S. S., & Kulik, S. P. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.010501 · Cited by 105
On the universality of the quantum approximate optimization algorithm
Morales, M. E. S., Biamonte, J. D., & Zimborás, Z. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02748-9 · Cited by 94
Variational Quantum Algorithms for Computational Fluid Dynamics
Jaksch, D., Givi, P., Daley, A. J., & Rung, T. (2023) · AIAA Journal · doi:10.2514/1.j062426 · Cited by 149
“A promising hybrid quantum-classical algorithm [8] was invented in 2014.”
InfluentialTheoretical guarantees for permutation-equivariant quantum neural networks
Schatzki, L., Larocca, M., Nguyen, Q. T., Sauvage, F., & Cerezo, M. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00804-1 · Cited by 194
A comprehensive review of quantum machine learning: from NISQ to fault tolerance
Wang, Y., & Liu, J. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad7f69 · Cited by 189
“Quantum machine learning represents a highly promising realm in contemporary physics and computer science research, with far-reaching implications spanning quantum chemistry [120], artificial intelligence [98], and even high-energy physics [8].”
InfluentialHigh-fidelity quantum state evolution in imperfect photonic integrated circuits
Mower, J., Harris, N. C., Steinbrecher, G. R., Lahini, Y., & Englund, D. (2015) · Physical Review A · doi:10.1103/physreva.92.032322 · Cited by 93
Quantum Computing for Molecular Biology**
Baiardi, A., Christandl, M., & Reiher, M. (2023) · ChemBioChem · doi:10.1002/cbic.202300120 · Cited by 93
Digital quantum computation of fermion-boson interacting systems
Macridin, A., Spentzouris, P., Amundson, J. F., & Harnik, R. (2018) · Physical Review A · doi:10.1103/physreva.98.042312 · Cited by 125
Learning and inference on generative adversarial quantum circuits
Zeng, J., Wu, Y., Liu, J.-G., Wang, L., & Hu, J. (2019) · Physical Review A · doi:10.1103/physreva.99.052306 · Cited by 94
Grimsley, H. R., Barron, G. S., Barnes, E., Economou, S. E., & Mayhall, N. J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00681-0 · Cited by 93
Quantum Algorithms for Fixed Qubit Architectures
Farhi, E., Goldstone, J., Gutmann, S., & Neven, H. (2017) · arXiv · doi:10.48550/arxiv.1703.06199 · Cited by 93
“Recently there has been interest in using quantum computers for approximate combinatorial optimization [11, 12] and for simulating quantum systems [13, 14, 15, 16].”
BackgroundMedical image diagnosis based on adaptive Hybrid Quantum CNN
Ajlouni, N., Özyavaş, A., Takaoğlu, M., Takaoğlu, F., & Ajlouni, F. (2023) · BMC Medical Imaging · doi:10.1186/s12880-023-01084-5 · Cited by 97
“Notably, Peruzzo et al. introduced the variational quantum eigensolver (VQE) [17], and subsequent work by McClean et al. improved its optimization scheme [18].”
MethodSugisaki, K., Nakazawa, S., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2018) · ACS Central Science · doi:10.1021/acscentsci.8b00788 · Cited by 103
Business Renaissance: Opportunities and Challenges at the Dawn of the Quantum Computing Era
How, M.-L., & Cheah, S.-M. (2023) · Businesses · doi:10.3390/businesses3040036 · Cited by 140
“Algorithms like the Variational Quantum Eigensolver (VQE) can predict molecular ground state energies, playing a pivotal role in molecular dynamics and drug interactions [58].”
MethodEntanglement Generation in Superconducting Qubits Using Holonomic Operations
Egger, D. J., Ganzhorn, M., Salis, G., Fuhrer, A., Müller, P., Barkoutsos, P. K., Moll, N., Tavernelli, I., & Filipp, S. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.11.014017 · Cited by 91
Multistart Methods for Quantum Approximate optimization
Shaydulin, R., Safro, I., & Larson, J. (2019) · 2019 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2019.8916288 · Cited by 110
“Classical derivative-free direct-search methods are commonly applied to such problems: for example, Nelder-Mead is the default method for VQE problems in Grove [48].”
MethodInfluentialQuantum machine learning for particle physics using a variational quantum classifier
Blance, A., & Spannowsky, M. (2021) · Journal of High Energy Physics · doi:10.1007/jhep02(2021)212 · Cited by 129
“it [8{10] or added to a classical neural network in a hybrid approach [11,12]. For (ii) the loss function can be calculated using a quantum algorithm, e.g. in variational quantum algorithm approaches [13,14]. Whereas for (iii) one can minimise the loss function using a quantum annealer [15,16] or a quantum optimisatio…”
MethodTowards provably efficient quantum algorithms for large-scale machine-learning models
Liu, J., Liu, M., Liu, J.-P., Ye, Z., Wang, Y., Alexeev, Y., Eisert, J., & Jiang, L. (2024) · Nature Communications · doi:10.1038/s41467-023-43957-x · Cited by 167
“However, there is increasing evidence that such variational algorithms run on near-term quantum devices [11] are challenged by noise beyond logarithmic depth [18–21] (even though in some instances, noise can even be of some help [22]).”
BackgroundA controlled-NOT gate for frequency-bin qubits
Lu, H.-H., Lukens, J. M., Williams, B. P., Imany, P., Peters, N. A., Weiner, A. M., & Lougovski, P. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0137-z · Cited by 89
Hardware efficient quantum algorithms for vibrational structure calculations
Ollitrault, P. J., Baiardi, A., Reiher, M., & Tavernelli, I. (2020) · Chemical Science · doi:10.1039/d0sc01908a · Cited by 88
“C circuit. In fact, each element of T 2 can be decomposed as: ˙+ i ˙ + j ˙ k ˙ l c.c. = 2i(X iY jX kX l+ Y iX jX kX l+ Y iY jX kY l+ Y iY jY kX l X iX jX kY l X iX jY kX l X iY jY kY l Y iX jY kY l): (19) Therefore, the corresponding quantum circuit obtained after exponentiation of the operator given in Eq. (19) and i…”
BackgroundSimultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
Gacon, J., Zoufal, C., Carleo, G., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-10-20-567 · Cited by 94
Automatic Differentiation in Quantum Chemistry with Applications to Fully Variational Hartree–Fock
Tamayo-Mendoza, T., Kreisbeck, C., Lindh, R. H., & Aspuru‐Guzik, A. (2018) · ACS Central Science · doi:10.1021/acscentsci.7b00586 · Cited by 105
Self-citationOn the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing
Hadfield, S. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3478519 · Cited by 86
Constructing a virtual two-qubit gate by sampling single-qubit operations
Mitarai, K., & Fujii, K. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abd7bc · Cited by 191
Exploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry
Kao, P.-Y., Yang, Y.-C., Chiang, W.-Y., Hsiao, J.-Y., Cao, Y., Aliper, A., Ren, F., Aspuru‐Guzik, A., Zhavoronkov, A. A., Hsieh, M.-H., et al. (2023) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.3c00562 · Cited by 130
Self-citationNeural predictor based quantum architecture search
Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/ac28dd · Cited by 88
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“Arguably, there are three broad quantum computational methods used when studying quantum physical systems: time propagation [51, 111], quantum phase estimation (QPE) [319, 320], and the variational quantum eigensolver (VQE) [169, 170, 321].”
BackgroundMethodInfluentialBabbush, R., Berry, D. W., Sanders, Y. R., Kivlichan, I., Scherer, A., Wei, A. Y., Love, P. J., & Aspuru‐Guzik, A. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9463 · Cited by 124
Self-citationCalculation of the Green's function on near-term quantum computers
Endo, S., Kurata, I., & Nakagawa, Y. O. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033281 · Cited by 120
Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse
Gokhale, P., Javadi-Abhari, A., Earnest, N., Shi, Y., & Chong, F. T. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00027 · Cited by 133
“We specifically evaluated three types of near-term algorithms: (1) Variational Quantum Eigensolver (VQE) [94], which addresses minimum-eigenvalue problems such as molecular ground state estimation; (2) Quantum Approximate Optimization Algorithm (QAOA) [2], which approximates solutions to NP-Hard combinatorial optimizat…”
MethodAlexeev, Y., Amsler, M., Barroca, M. A., Bassini, S., Battelle, T., Camps, D., Casanova, D., Choi, Y. J., Chong, F. T., Chung, C., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.060 · Cited by 191
Chow, J. C. L. (2024) · Medical Sciences · doi:10.3390/medsci12040067 · Cited by 156
Quantum-optimal-control-inspired ansatz for variational quantum algorithms
Choquette, A., Di Paolo, A., Barkoutsos, P. K., Sénéchal, D., Tavernelli, I., & Blais, A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023092 · Cited by 86
“Variational quantum algorithms (VQA) are an example of such methods [3, 4].”
BackgroundMethodComputer-inspired quantum experiments
Krenn, M., Erhard, M., & Zeilinger, A. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-0230-4 · Cited by 86
Developments in the Tensor Network — from Statistical Mechanics to Quantum Entanglement
Okunishi, K., Nishino, T., & Ueda, H. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.062001 · Cited by 104
Molecular nanomagnets: a viable path toward quantum information processing?
Chiesa, A., Santini, P. M., Garlatti, E., Luis, F., & Carretta, S. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad1f81 · Cited by 105
A functional architecture for scalable quantum computing
Sete, E. A., Zeng, W. J., & Rigetti, C. T. (2016) · 2016 IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2016.7738703 · Cited by 85
“These new hardware demonstrations have been matched with advances in applications for relatively small and noisy quantum computing systems.”
MethodAdiabatic state preparation study of methylene
Veis, L., & Pittner, J. (2014) · The Journal of Chemical Physics · doi:10.1063/1.4880755 · Cited by 84
A volumetric framework for quantum computer benchmarks
Blume-Kohout, R., & Young, K. C. (2020) · Quantum · doi:10.22331/q-2020-11-15-362 · Cited by 162
“Z rotations by θ ) [37]; and quantum error correction.”
BackgroundFermionic quantum processing with programmable neutral atom arrays
González-Cuadra, D., Bluvstein, D., Kalinowski, M., Kaubruegger, R., Maskara, N., Naldesi, P., Zache, T. V., Kaufman, A. M., Lukin, M. D., Pichler, H., et al. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2304294120 · Cited by 127
Advances in Silicon Quantum Photonics
Adcock, J. C., Bao, J., Chi, Y., Chen, X., Bacco, D., Gong, Q., Oxenløwe, L. K., Wang, J., & Ding, Y. (2020) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2020.3025737 · Cited by 103
Goto, T., Tran, Q. H., & Nakajima, K. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.090506 · Cited by 168
“Such devices have ushered in the era of hybrid quantum-classical algorithms [4–9].”
BackgroundQuantum Federated Learning With Decentralized Data
Huang, R., Tan, X., & Xu, Q. (2022) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2022.3170150 · Cited by 114
Quantum self-attention neural networks for text classification
Li, G., Zhao, X., & Wang, X. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-3879-7 · Cited by 183
“To explore practical applications with near-term quantum devices, plenty of NISQ algorithms [17–19] appear to be the best hope for obtaining quantum advantage in fields such as quantum chemistry [20], optimization [21], and machine learning [22–27].”
BackgroundMeasurement-Based Variational Quantum Eigensolver
Ferguson, R. R., Dellantonio, L., Balushi, A. A., Jansen, K., Dür, W., & Muschik, C. A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.220501 · Cited by 120
Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation
Gomes, N., Mukherjee, A., Zhang, F., Iadecola, T., Wang, C., Ho, K., Orth, P. P., & Yao, Y. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100114 · Cited by 115
Error Mitigation for Universal Gates on Encoded Qubits
Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M., & Temme, K. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200505 · Cited by 81
“This has given rise to the question: Are there computational tasks that could be implemented without the use of quantum error correction? This question has motivated a set of proposals [32, 21, 16, 35, 26, 27]”
BackgroundAdversarial quantum circuit learning for pure state approximation
Benedetti, M., Grant, E., Wossnig, L., & Severini, S. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab14b5 · Cited by 107
Evaluating the noise resilience of variational quantum algorithms
Fontana, E., Fitzpatrick, N., Ramo, D. M., Duncan, R., & Rungger, I. (2021) · Physical Review A · doi:10.1103/physreva.104.022403 · Cited by 121
“VQAs are composed of a quantum subroutine embedded into a classical optimisation loop [2, 3, 11].”
BackgroundMethodInfluentialAn end-to-end trainable hybrid classical-quantum classifier
Chen, S. Y.-C., Huang, C.-M., Hsing, C.-W., & Kao, Y.-J. (2021) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac104d · Cited by 170
Ding, Z., & Lin, L. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020331 · Cited by 102
“However, the efficiency and accuracy of VQE largely depend on the representation power of the variational ansatz ψ ( θ ), and the solver of the non-convex optimization problem.”
BackgroundInfluentialClassical variational simulation of the Quantum Approximate Optimization Algorithm
Medvidović, M., & Carleo, G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00440-z · Cited by 79
Symmetry-adapted variational quantum eigensolver
Seki, K., Shirakawa, T., & Yunoki, S. (2020) · Physical Review A · doi:10.1103/physreva.101.052340 · Cited by 98
Nonadiabatic Molecular Quantum Dynamics with Quantum Computers
Ollitrault, P. J., Mazzola, G., & Tavernelli, I. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260511 · Cited by 117
Bengtsson, A., Vikstål, P., Warren, C., Svensson, M., Gu, X. Q., Kockum, A. F., Krantz, P., Križan, C., Shiri, D., Svensson, I.-M., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.034010 · Cited by 103
Quantum machine learning with differential privacy
Watkins, W. M., Chen, S. Y.-C., & Yoo, S. (2023) · Scientific Reports · doi:10.1038/s41598-022-24082-z · Cited by 120
“Numerous efforts have been made to design quantum algorithms based on VQCs [9, 10], including the calculation of chemical ground states [8] and optimization problems [55].”
MethodGujju, Y., Matsuo, A., & Raymond, R. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.067001 · Cited by 135
On the practical usefulness of the Hardware Efficient Ansatz
Leone, L., Oliviero, S. F. E., Cincio, Ł., & Cerezo, M. (2024) · Quantum · doi:10.22331/q-2024-07-03-1395 · Cited by 185
“For instance, in a variational quantum eigensolver [7] quantum chemistry application such an initial state is usually the un-entangled mean-field Hartree-Fock state [54].”
BackgroundVariational benchmarks for quantum many-body problems
Wu, D., Rossi, R., Vicentini, F., Astrakhantsev, N., Becca, F., Cao, X., Carrasquilla, J., Ferrari, F., Georges, A., Hibat-Allah, M., et al. (2024) · Science · doi:10.1126/science.adg9774 · Cited by 79
“Quantum algorithms for this task include phase estimation [15], variational approaches [16– 19], adiabatic passage [20], imaginary-time evolution [21], and subspace and Lanczos methods [22, 23].”
BackgroundMethodScaling and Diabatic Effects in Quantum Annealing with a D-Wave Device
Weinberg, P., Tylutki, M., Rönkkö, J., Westerholm, J., Åström, J. A., Manninen, P., Törmä, P., & Sandvik, A. W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090502 · Cited by 92
Metcalf, M., Bauman, N. P., Kowalski, K., & de Jong, W. A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00421 · Cited by 78
Nishi, H., Kosugi, T., & Matsushita, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00409-y · Cited by 110
Variational quantum algorithm for estimating the quantum Fisher information
Beckey, J. L., Cerezo, M., Sone, A., & Coles, P. J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013083 · Cited by 118
“VQAs have been studied for various applications [39–54], and the scaling of their trainability has been explored recently [55–61].”
BackgroundUnified approach to data-driven quantum error mitigation
Lowe, A., Gordon, M. H., Czarnik, P., Arrasmith, A., Coles, P. J., & Cincio, Ł. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033098 · Cited by 135
“[9] A.”
MethodLayer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
Liu, X., Angone, A., Shaydulin, R., Safro, I., Alexeev, Y., & Cincio, L. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3140190 · Cited by 78
Simulating quantum materials with digital quantum computers
Oftelie, L. B., Urbánek, M., Metcalf, M., Carter, J. T., Kemper, A. F., & de Jong, W. A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac1ca6 · Cited by 101
A case study of variational quantum algorithms for a job shop scheduling problem
Amaro, D., Rosenkranz, M., Fitzpatrick, N., Hirano, K., & Fiorentini, M. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00123-4 · Cited by 121
“We selected the popular quantum approximate optimization algorithm (QAOA) [10] and the variational quantum eigensolver (VQE) [11] as well as the less well studied variational quantum imaginary time evolution algorithm (VarQITE) [12] and the filtering variational quantum eigensolver (F-VQE) [13] recently introduced by…”
MethodGate-free state preparation for fast variational quantum eigensolver simulations
Meitei, O. R., Gard, B., Barron, G. S., Pappas, D. P., Economou, S. E., Barnes, E., & Mayhall, N. J. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00493-0 · Cited by 112
“As the leading quantum algorithm for molecular simulation on near-term devices, the variational quantum eigensolver (VQE) 14 provides an ef fi cient procedure for this purpose.”
MethodResource Estimation for Quantum Variational Simulations of the Hubbard Model
Cai, Z. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014059 · Cited by 78
Minimizing Estimation Runtime on Noisy Quantum Computers
Wang, G., Koh, D. E., Johnson, P. D., & Cao, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010346 · Cited by 77
“[1] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L O’Brien.”
BackgroundQuantum synchronization on the IBM Q system
Koppenhöfer, M., Bruder, C., & Roulet, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023026 · Cited by 81
Architecting Noisy Intermediate-Scale Trapped Ion Quantum Computers
Murali, P., Debroy, D. M., Brown, K. R., & Martonosi, M. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00051 · Cited by 125
“Practical applications of this paradigm are expected in the near future, particularly in the domains of computational quantum chemistry [1, 2], machine learning [3, 4] and security [5].”
BackgroundAnalyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
Zhao, C., & Gao, X.-S. (2021) · Quantum · doi:10.22331/q-2021-06-04-466 · Cited by 130
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.13623 · Cited by 212
“edu Variational Quantum Eigensolver (VQE) [4] is one such algorithm that is widely considered a top contender, if not the top contender, for demonstrating a useful quantum speedup.”
BackgroundMethodInfluentialOptimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, S., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. (2019) · arXiv · doi:10.48550/arxiv.1908.03185 · Cited by 77
Variational Quantum Algorithm for Estimating the Quantum Fisher Information
Beckey, J. L., Cerezo, M., Sone, A., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2010.10488 · Cited by 77
Theory of analytical energy derivatives for the variational quantum eigensolver
Mitarai, K., Nakagawa, Y. O., & Mizukami, W. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013129 · Cited by 76
Efficient Step-Merged Quantum Imaginary Time Evolution Algorithm for Quantum Chemistry
Gomes, N., Zhang, F., Berthusen, N., Wang, C., Ho, K., Orth, P. P., & Yao, Y. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00666 · Cited by 97
Yalouz, S., Senjean, B., Günther, J., Buda, F., O’Brien, T. E., & Visscher, L. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd334 · Cited by 76
Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
Yao, J., Lin, L., & Bukov, M. (2021) · Physical Review X · doi:10.1103/physrevx.11.031070 · Cited by 76
Generalized Quantum Subspace Expansion
Yoshioka, N., Hakoshima, H., Matsuzaki, Y., Tokunaga, Y., Suzuki, Y., & Endo, S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.020502 · Cited by 122
“[24] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J.”
How To Use Neural Networks To Investigate Quantum Many-Body Physics
Carrasquilla, J., & Torlai, G. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040201 · Cited by 118
Farrell, R. C., Chernyshev, I. A., Powell, S. J. M., Zemlevskiy, N. A., Illa, M., & Savage, M. J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054513 · Cited by 132
Izmaylov, A. F., Yen, T.-C., & Ryabinkin, I. G. (2019) · Chemical Science · doi:10.1039/c8sc05592k · Cited by 100
Accuracy and Resource Estimations for Quantum Chemistry on a Near-Term Quantum Computer
Kühn, M., Zanker, S., Deglmann, P., Marthaler, M., & Weiß, H. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00236 · Cited by 90
Improving Hamiltonian encodings with the Gray code
Matteo, O. D., McCoy, A. E., Gysbers, P., Miyagi, T., Woloshyn, R. M., & Navrátil, P. (2021) · Physical Review A · doi:10.1103/physreva.103.042405 · Cited by 94
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.