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 301–400 of 4,572
Experimental error mitigation via symmetry verification in a variational quantum eigensolver
Sagastizabal, R., Bonet-Monroig, X., Singh, M., Rol, M. A., Bultink, C. C., Fu, X., Price, C. H., Ostroukh, V., Muthusubramanian, N., Bruno, A., et al. (2019) · Physical Review A · doi:10.1103/physreva.100.010302 · Cited by 155
Noisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 182
Self-citationCapacity and Quantum Geometry of Parametrized Quantum Circuits
Haug, T., Bharti, K., & Kim, M. S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040309 · Cited by 127
On barren plateaus and cost function locality in variational quantum algorithms
Uvarov, A. V., & Biamonte, J. D. (2021) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/abfac7 · Cited by 126
Decoding quantum errors with subspace expansions
McClean, J. R., Zhang, J., Rubin, N. C., Babbush, R., & Neven, H. (2020) · Nature Communications · doi:10.1038/s41467-020-14341-w · Cited by 183
“The 5 physical qubits of the [[5, 1, 3]] code are labeled as |ψi〉.”
BackgroundMethodInfluentialSelf-citationAdaptive Variational Quantum Dynamics Simulations
Yao, Y.-X., Gomes, N., Zhang, F., Wang, C.-Z., Ho, K.-M., Iadecola, T., & Orth, P. P. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030307 · Cited by 182
Quantum gradient descent and Newton’s method for constrained polynomial optimization
Rebentrost, F. P., & Lloyd, S. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 130
Quantum Computing 40 Years Later
Preskill, J. P. (2023) · CRC Press eBooks · doi:10.1201/9781003358817-7 · Cited by 188
TensorCircuit: a Quantum Software Framework for the NISQ Era
Zhang, S., Allcock, J., Wan, Z., Liu, S., Sun, J., Yu, H., Yang, X.-H., Qiu, J., Ye, Z., Chen, Y., et al. (2023) · Quantum · doi:10.22331/q-2023-02-02-912 · Cited by 207
Exploiting Locality in Quantum Computation for Quantum Chemistry
McClean, J. R., Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · The Journal of Physical Chemistry Letters · doi:10.1021/jz501649m · Cited by 125
Self-citationBarren Plateaus Preclude Learning Scramblers
Holmes, Z., Arrasmith, A., Yan, B., Coles, P. J., Albrecht, A., & Sornborger, A. T. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.190501 · Cited by 125
“This includes variational quantum algorithms (VQAs) [29–45], which are used for numerous applications.”
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., De Raedt, H., & Michielsen, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02692-8 · Cited by 128
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125
“There exist many versions tailored for different fields of applications, such as the variational quantum eigensolver (VQE) [8] for finding the minimal energy state in quantum chemistry applications or quantum neural networks (QNNs) [9, 10] for quantum machine learning applications.”
BackgroundMethodA Case for Multi-Programming Quantum Computers
Das, P., Tannu, S. S., Nair, P. J., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358287 · Cited by 123
“We are likely to see NISQ machines over the next decade and such machines are expected to solve important algorithms such as Quantum Approximate Optimization Algorithm (QAOA) [6] and Variational Quantum Eigensolver (VQE) [22, 30].”
MethodMugel, S., Kuchkovsky, C., Sánchez, E., Fernández-Lorenzo, S., Luis-Hita, J., Lizaso, E., & Orús, R. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013006 · Cited by 124
Variational quantum algorithm for the Poisson equation
Liu, H., Wu, Y., Wan, L., Pan, S., Qin, S., Gao, F., & Wen, Q. (2021) · Physical Review A · doi:10.1103/physreva.104.022418 · Cited by 167
Quantum Information and Algorithms for Correlated Quantum Matter
Head-Marsden, K., Flick, J., Ciccarino, C. J., & Narang, P. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00620 · Cited by 155
Suzuki, Y., Endo, S., Fujii, K., & Tokunaga, Y. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010345 · Cited by 232
Quantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 189
An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Kübler, J. M., Arrasmith, A., Cincio, L., & Coles, P. J. (2020) · Quantum · doi:10.22331/q-2020-05-11-263 · Cited by 141
“In order to compare the performance of iCANS1 and iCANS2 to established methods, we consider two optimization tasks: variational quantum compiling with a fixed input state [14–17] and a variational quantum eigensolver (VQE) [3] for a Heisenberg spin chain.”
MethodInfluentialProjection-based runtime assertions for testing and debugging Quantum programs
Li, G., Zhou, L., Yu, N., Ding, Y., Ying, M., & Xie, Y. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3428218 · Cited by 156
“…we argue that considering one input is already useful in testing many quantum programs because the input information of many practical quantum algorithms (e.g., Shor’s algorithm [Shor 1999], Grover algorithm [Grover 1996], VQE algorithm [Peruzzo et al. 2014], HHL algorithm [Harrow et al. 2009])…”
MethodHarrow, A. W., & Napp, J. C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.140502 · Cited by 121
Measurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121
Self-citationReducing Qubit Requirements for Quantum Simulations Using Molecular Point Group Symmetries
Setia, K., Chen, R., Rice, J. E., Mezzacapo, A., Pistoia, M., & Whitfield, J. D. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00113 · Cited by 121
Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
Gonthier, J. F., Radin, M. D., Buda, C., Doskocil, E. J., Abuan, C. M., & Romero, J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033154 · Cited by 120
Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer
Dallaire-Demers, P.-L., Romero, J., Veis, L., Sim, S., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab3951 · Cited by 119
Self-citationOrbital optimized unitary coupled cluster theory for quantum computer
Mizukami, W., Mitarai, K., Nakagawa, Y. O., Yamamoto, T., Yan, T., & Ohnishi, Y.-Y. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033421 · Cited by 116
Filtering variational quantum algorithms for combinatorial optimization
Amaro, D., Modica, C., Rosenkranz, M., Fiorentini, M., Benedetti, M., & Lubasch, M. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3e54 · Cited by 174
“Popular variational quantum algorithms such as the variational quantum eigensolver (VQE) [11] and the quantum approximate optimization algorithm (QAOA) [12] attempt to prepare this ground state by searching for the circuit parameters that minimize the energy expectation value of the corresponding quantum state.”
MethodExtending the computational reach of a noisy superconducting quantum processorPreprint
Kandala, A., Temme, K., Corcoles, A. D., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.04492 · Cited by 119
Constrained Variational Quantum Eigensolver: Quantum Computer Search Engine in the Fock Space
Ryabinkin, I. G., Genin, S. N., & Izmaylov, A. F. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b00943 · Cited by 120
(2019) · doi:10.1145/3297858.3304018 · Cited by 118
Smart, S. E., & Mazziotti, D. A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.070504 · Cited by 140
Sun, S.-N., Motta, M., Tazhigulov, R. N., Tan, A. T. K., Chan, G. K., & Minnich, A. J. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010317 · Cited by 182
Quantum computing models for artificial neural networks
Mangini, S., Tacchino, F., Gerace, D., Bajoni, D., & Macchiavello, C. (2021) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/134/10002 · Cited by 157
Material matters in superconducting qubits
Murray, C. E. (2021) · Materials Science and Engineering R Reports · doi:10.1016/j.mser.2021.100646 · Cited by 173
Higher order derivatives of quantum neural networks with barren plateaus
Cerezo, M., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abf51a · Cited by 118
“This strategy is employed in two closely related paradigms: variational quantum algorithms (VQAs) [1] for chemistry, optimization, and other applications [2–16], and quantum neural networks (QNNs) for classification applications [17–21].”
Decoding small surface codes with feedforward neural networks
Varsamopoulos, S., Criger, B., & Bertels, K. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aa955a · Cited by 117
Applications of near-term photonic quantum computers: software and algorithms
Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8504 · Cited by 128
Avoiding Barren Plateaus Using Classical Shadows
Sack, S. H., Medina, R. A., Michailidis, A. A., Kueng, R., & Serbyn, M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020365 · Cited by 193
Variational Quantum Fidelity Estimation
Cerezo, M., Poremba, A., Cincio, Ł., & Coles, P. J. (2020) · Quantum · doi:10.22331/q-2020-03-26-248 · Cited by 159
“They will prepare ground and excited states of molecules [1], states that simulate quantum dynamics [2], and states that encode the solutions to linear systems [3].”
BackgroundMethodMeasurements of Quantum Hamiltonians with Locally-Biased Classical Shadows
Hadfield, C., Bravyi, S., Raymond, R., & Mezzacapo, A. (2022) · Communications in Mathematical Physics · doi:10.1007/s00220-022-04343-8 · Cited by 117
“This is the case of VQE for molecular Hamiltonians if one initialises the variational procedure from a reference state, which can be, for example, the Hartree–Fock solution, a generic fermionic Gaussian state [22], or perturbative Møller–Plesset solutions.”
BackgroundInfluentialMachine Learning Algorithms in Quantum Computing: A Survey
Ramezani, S. B., Sommers, A., Manchukonda, H. K., Rahimi, S., & Amirlatifi, A. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9207714 · Cited by 185
“Examples include, the use of Quantum Approximate Optimization Algorithm (QAOA) [16] where parameters from classical solution to a problem are used as the initial guess and starting point for larger problems, or variational quantum eigen solvers [17], [18] .”
MethodHeim, B., Soeken, M., Marshall, S., Granade, C., Roetteler, M., Geller, A., Troyer, M., & Svore, K. M. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-00245-7 · Cited by 158
Crossing a topological phase transition with a quantum computer
Smith, A., Jobst, B., Green, A. G., & Pollmann, F. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.l022020 · Cited by 111
“Such variational solvers have already been demonstrated in the setting of small molecules [10, 11] using variational quantum eigensolvers (VQE) [36].”
BackgroundMachine Learning of Noise-Resilient Quantum Circuits
Cincio, Ł., Rudinger, K., Sarovar, M., & Coles, P. J. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010324 · Cited by 163
“In addition, variational quantum algorithms (VQAs) [13–26] can also be thought of as machine learning of quantum circuits.”
BackgroundqHiPSTER: The Quantum High Performance Software Testing EnvironmentPreprint
Smelyanskiy, M., Sawaya, N. P. D., & Aspuru‐Guzik, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07195 · Cited by 264
Self-citationParallel quantum simulation of large systems on small NISQ computers
Barratt, F., Dborin, J., Bal, M., Stojevic, V., Pollmann, F., & Green, A. G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00420-3 · Cited by 111
“Innovations for quantum simulation include using these circuits as variational wavefunctions 5 , optimising them stochastically or by phase estimation 6 , and evolving them either by accurate Trotterisation of the evolution operator 7 – 9 or variationally 10 .”
MethodEfficient Measure for the Expressivity of Variational Quantum Algorithms
Du, Y., Tu, Z., Yuan, X., & Tao, D. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080506 · Cited by 192
Molecular Quantum Dynamics: A Quantum Computing Perspective
Ollitrault, P. J., Miessen, A., & Tavernelli, I. (2021) · Accounts of Chemical Research · doi:10.1021/acs.accounts.1c00514 · Cited by 158
Review of Distributed Quantum Computing: From single QPU to High Performance Quantum Computing
Barral, D., Cardama, F. J., Díaz-Camacho, G., Faílde, D., Llovo, I. F., Juane, M. M., Vázquez-Pérez, J., Villasuso, J., Piñeiro, C., Costas, N., et al. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100747 · Cited by 243
“The authors apply these techniques for Hamiltonian simulation using the Variational Quantum Eigensolver (VQE) [226], and suggest using this hybrid variational ansatz for future modular architectures.”
An efficient quantum algorithm for the time evolution of parameterized circuits
Barison, S., Vicentini, F., & Carleo, G. (2021) · Quantum · doi:10.22331/q-2021-07-28-512 · Cited by 110
“To circumvent the problem, current generations of quantum algorithms rely on a hybrid classicalquantum approach [8, 9, 10, 11, 12, 13].”
MethodIntel Quantum Simulator: a cloud-ready high-performance simulator of quantum circuits
Guerreschi, G. G., Hogaboam, J., Baruffa, F., & Sawaya, N. P. D. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8505 · Cited by 185
Nguyen, C. V., Idrees, M., Phuc, H. V., Hieu, N. N., Bình, N. T. T., Amin, B., & Vu, T. V. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.235419 · Cited by 113
Gate-Efficient Simulation of Molecular Eigenstates on a Quantum Computer
Ganzhorn, M., Egger, D. J., Tavernelli, I., Filipp, S., Barkoutsos, P. K., Ollitrault, P. J., Salis, G., Moll, N., Roth, M., Fuhrer, A., et al. (2019) · RWTH Publications (RWTH Aachen) · Cited by 109
Digitized-counterdiabatic quantum approximate optimization algorithm
Chandarana, P., Hegade, N. N., Paul, K., Albarrán-Arriagada, F., Solano, E., del Campo, A., & Chen, X. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013141 · Cited by 156
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2020) · RWTH Publications (RWTH Aachen) · Cited by 109
Quantum Krylov subspace algorithms for ground- and excited-state energy estimation
Cortes, C. L., & Gray, S. K. (2022) · Physical Review A · doi:10.1103/physreva.105.022417 · Cited by 174
“As a result, variational quantum algorithms such as the variational quantum eigen-solver (VQE) [8–10] and quantum approximate optimization algorithm (QAOA) [11] have emerged as possible candidate algorithms capable of dealing with the constraints of the current hardware in the noisy intermediate…”
MethodEfficient quantum circuits for quantum computational chemistry
Yordanov, Y. S., Arvidsson-Shukur, D. R. M., & Barnes, C. H. W. (2020) · Physical Review A · doi:10.1103/physreva.102.062612 · Cited by 107
“[6] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L Obrien.”
BackgroundExpressibility of the alternating layered ansatz for quantum computation
Nakaji, K., & Yamamoto, N. (2021) · Quantum · doi:10.22331/q-2021-04-19-434 · Cited by 119
Algorithms for Quantum Simulation at Finite Energies
Lu, S., Bañuls, M. C., & Cirac, J. I. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020321 · Cited by 150
Recent Advances for Quantum Neural Networks in Generative Learning
Tian, J., Sun, X., Du, Y., Zhao, S., Liu, Q., Zhang, K., Yi, W., Huang, W., Wang, C., Wu, X., et al. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3272029 · Cited by 189
“memory and thus has a practical value in quantum chemistry simulation [103, 240] as discussed in Refs.”
BackgroundMethodMeasuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
Banchi, L., & Crooks, G. E. (2020) · arXiv · doi:10.48550/arxiv.2005.10299 · Cited by 107
Optimizing quantum optimization algorithms via faster quantum gradient computation
Gilyén, A., Arunachalam, S., & Wiebe, N. (2019) · Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms · doi:10.1137/1.9781611975482.87 · Cited by 103
Superfast encodings for fermionic quantum simulation
Setia, K., Bravyi, S., Mezzacapo, A., & Whitfield, J. D. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033033 · Cited by 107
Magann, A. B., Arenz, C., Grace, M. D., Ho, T.-S., Kosut, R. L., McClean, J. R., Rabitz, H. A., & Sarovar, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010101 · Cited by 116
Self-citationFermion-to-qubit mappings with varying resource requirements for quantum simulation
Steudtner, M., & Wehner, S. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aac54f · Cited by 104
Decoding quantum errors with subspace expansions
McClean, J. R., Zhang, J., Rubin, N. C., Babbush, R., & Neven, H. (2020) · RePEc: Research Papers in Economics · Cited by 105
Self-citation$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3035814 · Cited by 104
“Since commuting families can be measured simultaneously, this constitutes a reduction in the measurement cost of VQE from O ( N 4 ) naively to O ( N 3 ) with these partitions.”
BackgroundMethodInfluentialDynamic linear response quantum algorithm
Roggero, A., & Carlson, J. (2019) · Physical Review C · doi:10.1103/physrevc.100.034610 · Cited by 140
Error-mitigated quantum gates exceeding physical fidelities in a trapped-ion system
Zhang, S., Lu, Y., Zhang, K., Chen, W., Li, Y., Zhang, J.-N., & Kim, K. (2020) · Nature Communications · doi:10.1038/s41467-020-14376-z · Cited by 140
Adaptive Variational Quantum Dynamics Simulations
Yao, Y., Gomes, N., Zhang, F., Wang, C., Ho, K., Iadecola, T., & Orth, P. P. (2021) · Iowa State University Digital Repository (Iowa State University) · Cited by 104
$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
Gokhale, P., & Chong, F. T. (2019) · arXiv · doi:10.48550/arxiv.1908.11857 · Cited by 104
Scalable Measures of Magic Resource for Quantum Computers
Haug, T., & Kim, M. S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010301 · Cited by 104
“Variational quantum algorithms find the parameters θ of a parameterized quantum circuit | ψ ( θ ) (cid:105) such that they maximize a cost function C ( θ ) measured on a quantum computer [31, 63, 64].”
Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
Sanders, Y. R., Berry, D. W., Costa, P. C. S., Tessler, L. W., Wiebe, N., Gidney, C., Neven, H., & Babbush, R. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020312 · Cited by 103
A comparison of various classical optimizers for a variational quantum linear solver
Pellow-Jarman, A., Sinayskiy, I., Pillay, A. W., & Petruccione, F. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03140-x · Cited by 147
“Near uniform trends are observed across all test problem instances with regards to the final distribution of the cost value at termination [Fig: 3, 4, 5], and therefore these results are discussed in general with respect to the trends observed in performance across problem instances as noise levels…”
BackgroundMethodPerformance comparison of optimization methods on variational quantum algorithms
Bonet-Monroig, X., Wang, H., Vermetten, D., Senjean, B., Moussa, C., Bäck, T., Dunjko, V., & O'Brien, T. E. (2023) · Physical Review A · doi:10.1103/physreva.107.032407 · Cited by 107
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“They have found application in areas of quantum chemistry [31], machine learning [32, 33] and optimization [34].”
BackgroundUniversal variational quantum computation
Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.103.l030401 · Cited by 102
“[2] A.”
BackgroundInfluentialBeyond quantum supremacy: the hunt for useful quantum computers
Brooks, M. (2019) · Nature · doi:10.1038/d41586-019-02936-3 · Cited by 146
Variational-state quantum metrology
Koczor, B., Endo, S., Jones, T., Matsuzaki, Y., & Benjamin, S. C. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab965e · Cited by 101
“Optimisation of the ansatz parameters For the optimisation of the ansatz parameters, one might employ any suitable one of a range of methods: for example a direct search such as Nelder–Mead (demonstrated experimentally in 2014 [1]), or a systematic scan if the number of parameters is small [59].”
MethodThree-nucleon forces: implementation and applications to atomic nuclei and dense matter
Hebeler, K. (2020) · TUbilio (Technical University of Darmstadt) · Cited by 101
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Digital quantum simulation of molecular vibrations
McArdle, S., Mayorov, A., Shan, X., Benjamin, S. C., & Yuan, X. (2019) · Chemical Science · doi:10.1039/c9sc01313j · Cited by 132
Quantum optimization with a novel Gibbs objective function and ansatz architecture search
Li, L., Fan, M., Coram, M., Riley, P., & Leichenauer, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023074 · Cited by 98
“…and opportunities for further developments: The Gibbs objective function is easy to implement for the combinatorial optimization problems we considered here, but may be useful more broadly for quantum optimization problems, such as variational approaches to molecular ground states [17, 20].”
MethodQuantum Power Method by a Superposition of Time-Evolved States
Seki, K., & Yunoki, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010333 · Cited by 143
Holographic quantum algorithms for simulating correlated spin systems
Foss-Feig, M., Hayes, D., Dreiling, J. M., Figgatt, C., Gaebler, J. P., Moses, S. A., Pino, J. M., & Potter, A. C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033002 · Cited by 100
High-Performance Computing with Quantum Processing Units
Britt, K. A., & Humble, T. S. (2017) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3007651 · Cited by 130
“have shown variational eigensolvers for computational chemistry can accommodate a divide-andconquer strategy for calculating the lowest-energy ground state [Peruzzo et al. 2014].”
MethodA quantum-classical cloud platform optimized for variational hybrid algorithms
Karalekas, P. J., Tezak, N., Peterson, E. C., Ryan, C. A., Silva, M. P. D., & Smith, R. S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7559 · Cited by 162
Quantum simulation of quantum field theory in the light-front formulation
Kreshchuk, M., Kirby, W. M., Goldstein, G. R., Beauchemin, P. H., & Love, P. J. (2022) · Physical Review A · doi:10.1103/physreva.105.032418 · Cited by 140
“Such calculations would attempt to variationally minimize the expectation of the invariant mass in a given sector of K and Q, and then perform measurements to estimate the PDFs in this variational ansatz [40].”
BackgroundMethodSelf-citationA Threshold for Quantum Advantage in Derivative Pricing
Chakrabarti, S., Krishnakumar, R., Mazzola, G., Stamatopoulos, N., Woerner, S., & Zeng, W. J. (2021) · Quantum · doi:10.22331/q-2021-06-01-463 · Cited by 190
“In this section we illustrate an approximate method to initialize the quantum register using the Variational Quantum Eigensolver (VQE) approach [22].”
MethodGenetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm
Acampora, G., Chiatto, A., & Vitiello, A. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110296 · Cited by 107
Bauman, N. P., Bylaska, E. J., Krishnamoorthy, S., Low, G. H., Wiebe, N., Granade, C. E., Roetteler, M., Troyer, M., & Kowalski, K. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5094643 · Cited by 98
Calculating energy derivatives for quantum chemistry on a quantum computer
O’Brien, T. E., Senjean, B., Sagastizabal, R., Bonet-Monroig, X., Dutkiewicz, A., Buda, F., DiCarlo, L., & Visscher, L. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0213-4 · Cited by 82
Stanisic, S., Bosse, J. L., Gambetta, F. M., Santos, R. A., Mruczkiewicz, W., O’Brien, T. E., Ostby, E. P., & Montanaro, A. (2022) · Nature Communications · doi:10.1038/s41467-022-33335-4 · Cited by 198
Quantum machine learning: from physics to software engineering
Melnikov, A. A., Kordzanganeh, M., Alodjants, A. P., & Lee, R. (2023) · Advances in Physics X · doi:10.1080/23746149.2023.2165452 · Cited by 178
“This was first implemented to find the ground-state energy of He − H [30] and was then substantially extended in Ref.”
BackgroundInfluentialJastrow-type Decomposition in Quantum Chemistry for Low-Depth Quantum Circuits
Matsuzawa, Y., & Kurashige, Y. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00963 · Cited by 145
Koh, D. E., & Grewal, S. (2022) · Quantum · doi:10.22331/q-2022-08-16-776 · Cited by 97
Quantum algorithm for the advection–diffusion equation simulated with the lattice Boltzmann method
Budinski, L. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-02996-3 · Cited by 146
“While the VQC is proven to be most suitable for machine learning [16–19] and chemistry [10,20], significant research has been done in the area of linear algebra [21,22] and optimization [23–25] as well.”
MethodQuantum computing for smart grid applications
Ullah, M. H., Eskandarpour, R., Zheng, H., & Khodaei, A. (2022) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12602 · Cited by 140
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.