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 2,901–3,000 of 4,572
Quantum computing with CMOS technology
González-Zalba, M. F. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474246 · Cited by 3
A method of determining molecular excited-states using quantum computation
Jouzdani, P., Bringuier, S. A., & Kostuk, M. (2021) · MRS Advances · doi:10.48550/arxiv.1908.05238 · Cited by 15
Towards solving the BCS Hamiltonian gap in near-term quantum computers
Sá, N., Oliveira, I. S., & Roditi, I. (2022) · Results in Physics · doi:10.1016/j.rinp.2022.106131 · Cited by 8
Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers
Kobayashi, F., Mitarai, K., & Fujii, K. (2022) · Physical Review A · doi:10.1103/physreva.105.052415 · Cited by 4
Dou, T., Wang, K., Zhou, Z., Yan, S., & Cui, W. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549885 · Cited by 4
Wang, Z., Zhou, H., Chen, G.-L., Yilong, A., Chun-huo, H., Lu, Y., Tang, K.-H., Du, L., Hua-bin, Z., & Huang, X.-Q. (2008) · PubMed · Cited by 3
Multiqubit state learning with entangling quantum generative adversarial networks
Rasmussen, S. E., & Zinner, N. T. (2022) · Physical Review A · doi:10.1103/physreva.106.032429 · Cited by 6
Quantum algorithms for simulation of quantum chemistry problems by quantum computers: an appraisal
Sharma, S. (2022) · Foundations of Chemistry · doi:10.1007/s10698-022-09428-9 · Cited by 4
“Many different types of quantum architectures have made use of the VQE algorithm (Peruzzo et al. 2014; O’Malley et al. 2016; Kandala et al. 2017; Hempel et al. 2018).”
MethodSingle-magnon excited states of a Heisenberg spin chain using a quantum computer
Ranu, S. K., & Stancil, D. D. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.184402 · Cited by 3
Preparation of the SU(3) Lattice Yang-Mills Vacuum with Variational Quantum Methods
Ciavarella, A. N., & Chernyshev, I. A. (2022) · Quantum 2.0 Conference and Exhibition · doi:10.1364/quantum.2022.qm3c.5 · Cited by 3
Quantifying the uncertainty and global sensitivity of quantum computations on experimental hardware
Xu, G., Arachchilage, K. H., Hussaini, M. Y., & Oates, W. S. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03701-8 · Cited by 6
“…with quantum numerical integration circuits, new proposals using quantum-classical hybrid algorithms, such as quantum approximation optimization algorithm (QAOA [13, 14]) and variational quantum eigensolver (VQE [15–19]), have extended the power of NISQ devices for practical applications.”
MethodWrobel, N., Baul, A., Tam, K.-M., & Moreno, J. (2022) · Quantum Reports · doi:10.3390/quantum4040042 · Cited by 10
Constructing Local Bases for a Deep Variational Quantum Eigensolver for Molecular Systems
Erhart, L., Mitarai, K., Mizukami, W., & Fujii, K. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.064051 · Cited by 4
Miki, T., Tsukayama, D., Okita, R., Shimada, M., & Shirakashi, J. (2022) · IEEE International Conference on Manipulation, Manufacturing and Measurement on the Nanoscale (3M-NANO) · doi:10.1109/3m-nano56083.2022.9941666 · Cited by 5
“COBYLA is a model-based local optimization methodology that uses a linear approximation of the objective function over a simplex, and VQE also employs this optimizer [16,25] to reduce the function evaluations corresponding to the number of executions of quantum computing [25].”
BackgroundMethodQuantum Multi-Round Resonant Transition Algorithm
Yang, F., Chen, X., Zhao, D., Wei, S., Wen, J., Wang, H., Xin, T., & Long, G. (2022) · Entropy · doi:10.3390/e25010061 · Cited by 3
“A variational quantum eigensolver [10] is one way that can provide a quantum over-classical advantage to accomplish this task by using a classical computer and a noisy intermediate-scale quantum device with a low coherence time.”
MethodQuantum-Classical Hybrid Algorithms
Baaquie, B. E., & Kwek, L. C. (2023) · Springer eBooks · doi:10.1007/978-981-19-7517-2_16 · Cited by 4
A direct error correction method for quantum machine learning
Ohno, H. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03863-z · Cited by 5
Enquiring Electronic Structure Using Quantum Computers: Hands on Qiskit
Anaya-Morales, A., & Delgado, F. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2448/1/012014 · Cited by 3
Wen, J., Zheng, C., Huang, Z., & Qian, L. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/acc052 · Cited by 6
Marécat, Q., Senjean, B., & Saubanère, M. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.155110 · Cited by 6
Implementation Of Grover's and Shor's Algorithms In Quantum Machine Learning
Kumar, D. K., Krishna, E. H. V., Ushasri, R., Jahnavi, V., Prakash, K. B., & Imambi, S. S. (2023) · International Conference on Intelligent and Innovative Technologies in Computing, Electrical and Electronics (IITCEE) · doi:10.1109/iitcee57236.2023.10091029 · Cited by 7
“By executing the above process, the factors guessed are, [3, 5].”
BackgroundOptimized numerical gradient and Hessian estimation for variational quantum algorithms
Teo, Y. S. (2023) · Physical Review A · doi:10.1103/physreva.107.042421 · Cited by 9
Multistate transition dynamics by strong time-dependent perturbation in NISQ era
Wang, Y., & Krstić, P. (2023) · Journal of Physics Communications · doi:10.1088/2399-6528/ace67a · Cited by 9
岳, 天., 吴, 晨., 刘, 熠., 杜, 正., 赵, 娜., 焦, 毅., 徐, 喆., & 史, 文. (2023) · SCIENTIA SINICA Terrae · doi:10.1360/sste-2022-0319 · Cited by 3
Li, H., Liang, J., Wang, Z., & Fei, S. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300101 · Cited by 3
Choppakatla, A. (2023) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2023.55318 · Cited by 3
Quantum Computing Applications and Impact for Cyber Physical Systems
Iftemi, A., Cernian, A. S., & Moisescu, M. A. (2023) · International Conference on Control Systems and Computer Science · doi:10.1109/cscs59211.2023.00066 · Cited by 7
Natural Evolutionary Gradient Descent Strategy for Variational Quantum Algorithms
Xie, J., Xu, C., Yin, C., Dong, Y., & Zhang, Z. (2023) · Intelligent Computing · doi:10.34133/icomputing.0042 · Cited by 3
Gene Expression Programming for Quantum Computing
Álvarez, G., Bennink, R. S., Irle, S., & Jakowski, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3617691 · Cited by 4
“In our approach using GEP, a set of initially random quantum circuits (“population”) is evolved by repeatedly introducing variations of the existing circuits (“mutations”) and retaining only those individuals that perform best at the prescribed computational task (have the highest “fitness”).”
Growth Reduction of Similarity-Transformed Electronic Hamiltonians in Qubit Space
Lang, R. A., Ganeshram, A., & Izmaylov, A. F. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00712 · Cited by 8
Variational microcanonical estimator
Pollock, K., Orth, P. P., & Iadecola, T. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033224 · Cited by 4
Ma, N., Chu, W., Zhao, P. Z., & Gong, J. (2023) · Physical Review A · doi:10.1103/physreva.108.042420 · Cited by 5
Basis Set Generation and Optimization in the NISQ Era with Quiqbox.jl
Wang, W., & Whitfield, J. D. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00011 · Cited by 4
“[8] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L O’brien.”
BackgroundMethodKuo, Y.-H., & Chen, H. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043139 · Cited by 3
“Either the simulation of a few atoms arranged in an one-dimensional chain [26], hybrid quantum-classical algorithm [34–36], or variational quantum algorithms [37–39], can be efficiently implemented.”
MethodCrosstalk-Based Parameterized Quantum Circuit Approximation
Ibrahim, M. M. A., Bronn, N. T., & Byrd, G. T. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00014 · Cited by 5
“Our analysis shows that crosstalk mitigation enhances the performance of VQE.”
MethodInfluentialScalable Quantum Simulation for Topological Phases on NISQ Devices
Sun, R.-Y., Shirakawa, T., & Yunoki, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10225 · Cited by 4
“Then, we introduce another layer of parameterized circuit (variational layer) to further guide the circuit state to the ground state of the target Hamiltonian in the VQE [6] calculation.”
MethodA parallel quantum eigensolver for quantum machine learning
Yang, F., Zhao, D., Wei, C., Chen, X., Wei, S., Wang, H., Long, G., & Xin, T. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ad15b4 · Cited by 3
Concrete Analysis of Quantum Lattice Enumeration
Bai, S., van Hoof, M.-I., Johnson, F. B., Lange, T., & Ngo, T. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8727-6_5 · Cited by 7
Prasad, V. K., Cheng, F., Fekl, U., & Jacobsen, H. (2023) · Physical Chemistry Chemical Physics · doi:10.1039/d3cp03523a · Cited by 4
Quantum computer-aided job scheduling for storage and retrieval systems
Windmann, S. (2024) · at - Automatisierungstechnik · doi:10.1515/auto-2023-0072 · Cited by 4
Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
Inoue, W., Aoyama, K., Teranishi, Y., Kanno, K., Nakagawa, Y. O., & Mitarai, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013096 · Cited by 6
“For example, the variational quantum eigensolver (VQE) [3, 4], which has been intensively studied for utilizing noisy quantum computers called the noisy intermediate-scale quantum devices (NISQ devices) [5], is a method to prepare an approximate ground state of a given Hamiltonian by iteratively…”
MethodCorrelated two-leviton states in the fractional quantum Hall regime
Bertin-Johannet, B., Popoff, A., Ronetti, F., Rech, J., Jonckheere, T., Raymond, L., Grémaud, B., & Martin, T. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.035436 · Cited by 6
Simulating Polaritonic Ground States on Noisy Quantum Devices
Hassan, M., Pavošević, F., Wang, D. S., & Flick, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c02875 · Cited by 5
Optimizing Multidimensional Pooling for Variational Quantum Algorithms
Jeng, M., Nobel, A., Jha, V., Levy, D., Kneidel, D., Chaudhary, M., Islam, I., Baumgartner, E., Vanderhoof, E., Facer, A., et al. (2024) · Algorithms · doi:10.3390/a17020082 · Cited by 3
Minimal qubit representations of Hamiltonians via conserved charges
Gunderman, L. G., Jena, A., & Dellantonio, L. (2024) · Physical Review A · doi:10.1103/physreva.109.022618 · Cited by 8
A quantum algorithm for linear differential equations with layerwise parameterized quantum circuits
Xiao, J., Wen, J., Zhou, Z., Qian, L., Huang, Z., Wei, S., & Long, G. (2024) · AAPPS bulletin · doi:10.1007/s43673-023-00115-1 · Cited by 4
“These variational algorithms have already provided efficient solutions for quantum chemistry [39–42], linear algebra [43, 44], and quantum machine learning [45–47].”
Quantum multi-programming for maximum likelihood amplitude estimation
Rao, P., Choi, S., & Yu, K. (2024) · Quantum Computing, Communication, and Simulation · doi:10.1117/12.3002854 · Cited by 6
“6 Additionally, Variational Quantum Algorithms (VQAs), such as Quantum Approximate Optimization Algorithm (QAOA), 7,8 Variation Quantum Eigensolver (VQE), 9 and Quantum Neural Networks, 10–13 have drawn attention as a promising candidate to achieve quantum advantage on NISQ devices.”
MethodAn introduction to quantum computing for statisticians and data scientists
Lopatnikova, A., Tran, M., & Sisson, S. A. (2024) · Foundations of Data Science · doi:10.3934/fods.2024013 · Cited by 14
“the expectation value of the Hamiltonian of the system) in Variational Quantum Eigensolver (Peruzzo et al., 2014).”
BackgroundMethodInfluentialSimulating Quantum Field Theories on Gate-Based Quantum Computers
Vinod, G. M., & Shaji, A. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3385372 · Cited by 4
“The methods employed range from a direct adaptation of classical lattice gauge theory techniques [25], [26] to those using the variational quantum eigensolver [27], [28].”
MethodSimulation of a spin-boson model by iterative optimization of a parametrized quantum circuit
Nishi, T., & Yamanouchi, K. (2024) · AVS Quantum Science · doi:10.1116/5.0193981 · Cited by 3
Addition and Differentiation of ZX-diagrams
Jeandel, E., Perdrix, S., & Veshchezerova, M. (2024) · Logical Methods in Computer Science · doi:10.46298/lmcs-20(2:10)2024 · Cited by 3
Cichy, S., Faehrmann, P. K., Khatri, S., & Eisert, J. (2024) · Physical Review A · doi:10.1103/physreva.109.052624 · Cited by 10
“Two of the most prominent examples of VQAs might be the variational quantum eigensolver [28], aimed at finding energies of Hamiltonians, and the quantum approximate optimization algorithm [29].”
BackgroundLeveraging Data Locality in Quantum Convolutional Classifiers
Jeng, M., Nobel, A., Jha, V., Levy, D., Kneidel, D., Chaudhary, M., Islam, I., Facer, A., Singh, M., Baumgartner, E., et al. (2024) · Entropy · doi:10.3390/e26060461 · Cited by 3
“For instance, the multidimensionality of input datasets is ignored in contemporary QML algorithms and are flattened into one-dimensional arrays [5–9].”
BackgroundMethodInfluentialFighting Noise with Noise: A Stochastic Projective Quantum Eigensolver
Filip, M.-A. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00295 · Cited by 5
“[21] According to the variational principle, for a parametrised wavefunction Ψ( θ ) that satisfies the boundary conditions of the problem, the expectation value of the energy is greater than or equal to the ground state energy of the system, Therefore, by minimising ⟨ E ( θ ) ⟩ with respect to the…”
BackgroundMethodInfluentialVarsamopoulos, S., Philip, E., Elfving, V. E., van Vlijmen, H., Menon, S., Vos, A. M., Dyubankova, N., Torfs, B., & Rowe, A. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00176-x · Cited by 14
Distance-four quantum codes with combined postselection and error correction
Prabhu, P., & Reichardt, B. W. (2024) · Physical Review A · doi:10.1103/physreva.110.012419 · Cited by 16
“Noisy Intermediate-Scale Quantum (NISQ) algorithms for eigensolvers [PMS + 14, WHT15] and machine learning [BWP + 17] are growing as popular applications for state-of-the-art few-qubit quantum systems.”
BackgroundMeasurement-Based Quantum Approximate Optimization
Stollenwerk, T., & Hadfield, S. (2024) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw63119.2024.00183 · Cited by 10
“Two particular approaches of interest are the QAOA [5], which generalizes the quantum approximate optimization algorithm [4]) and VQE (variational quantum eigensolver [37], [38]) paradigms, as well as a number of more recent variants of these approaches.”
BackgroundAlfonso, D. R., Avramidis, B., Paudel, H. P., & Duan, Y. (2024) · Nanomaterials · doi:10.3390/nano14151267 · Cited by 6
“A pioneering application of VQE is its examination of the ground-state properties of H 2 using 2 qubits [6].”
BackgroundMethodDetecting and eliminating quantum noise of quantum measurements
Tang, S., Zheng, C., & Wang, K. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad7a2a · Cited by 6
“The Mitigated IZ dephasing data shows that quantum noise elimination combined with error mitigation can greatly improve the effectiveness of VQE algorithms, yields an accurate estimation of the ground stat energy.”
BackgroundInfluentialFragment-based initialization for quantum subspace methods
D’Cunha, R., Cortes, C. L., Gagliardi, L., & Gray, S. K. (2024) · Physical Review A · doi:10.1103/physreva.110.042613 · Cited by 4
Benchmarking Quantum Computational Advantages on Supercomputers
Wu, J., & Liu, Y. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400143 · Cited by 5
A circuit-generated quantum subspace algorithm for the variational quantum eigensolver
Hirsbrunner, M. R., Mullinax, J. W., Shen, Y., Williams‐Young, D. B., Klymko, K., Beeumen, R. V., & Tubman, N. M. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0224883 · Cited by 8
Hybrid Hamiltonian Simulation for Excitation Dynamics
Wan, L., Liu, J., Li, Z., & Yang, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c02624 · Cited by 6
Particle swarm optimization for a variational quantum eigensolver
Mei, H., Zhao, J., Li, Q.-S., Chen, Z., Zhang, J., Wang, Q., Wu, Y.-C., & Guo, G. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d4cp02021a · Cited by 4
Variational post-selection for ground states and thermal states simulation
Zhang, S., Miao, J., & Hsieh, C. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad8fca · Cited by 8
“Specifically, ground state and thermal state preparation via VQAs are under extensive investigation, where the former is often denoted as the variational quantum eigensolver (VQE) [8–17] while the latter is often called Gibbs state preparation [18–31].”
Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms
Ramôa, M., Santos, L. P., Mayhall, N. J., Barnes, E., & Economou, S. E. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad904e · Cited by 15
“The variational quantum eigensolver (VQE) is a sub-class of VQAs aimed at finding eigenstates and eigenvalues of physical systems [1].”
BackgroundMultidimensional Quantum Generative Modeling by Quantum Hartley Transform
Wu, H., Elfving, V. E., & Kyriienko, O. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400337 · Cited by 13
“QBMs belong to energy-based models that use a parameterized QC as a Hamiltonian operator to prepare quantum Gibbs state whose sampling behavior reflects the probability distribution of given training data.”
Many-body eigenstates from quantum manifold optimization
Smart, S. E., & Narang, P. (2024) · Physical Review A · doi:10.1103/physreva.110.052430 · Cited by 7
“Over the past decade, several quantum computational approaches have been proposed for preparing the lowest-energy eigenstate[1–7], with predominant near-term approaches being related to the variational quantum eigensolver (VQE)[1, 8].”
BackgroundCapturing many-body correlation effects with quantum and classical computing
Kowalski, K., Bauman, N. P., Low, G. H., Roetteler, M., Rehr, J. J., & Vila, F. D. (2024) · Physical Review A · doi:10.1103/physreva.110.l060401 · Cited by 7
“In contrast to the variational quantum eigensolver (VQE) [21–32], which can only be used for energy estimates of a single targeted state (subject to the convergence of the iterative procedures), the QPE method can identify energies of states that have non-zero overlap with the trial wave function.”
Optimizing Quantum Fourier Transformation (QFT) Kernels for Modern NISQ and FT Architectures
Jin, Y., Gao, X., Guo, M., Chen, H., Hua, F., Zhang, C., & Zhang, E. Z. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00074 · Cited by 10
“Quantum computing has exhibited its pronounced advantages in several fields, including cryptography [35], financial modeling [34], and chemical simulations [33].”
Quantum Enhanced Simulation Based Optimization for Newsvendor Problems
Sharma, M., Lau, H. C., & Raymond, R. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00060 · Cited by 8
“This shift in approach has spawned inventive strategies for tackling a diverse range of challenges, spanning domains such as quantum chemistry [4], optimization [5], machine learning [6], and finance [7, 8].”
BackgroundHybrid Quantum Approximate Algorithms for Solving Flow Shop Scheduling Problem
Bożejko, W., Idzikowski, R. M., Jagielski, D., Klempous, R., Trotskyi, S., Tykierko, M., Uchroński, M., & Wodecki, M. (2024) · IEEE International Symposium on Computational Intelligence and Informatics (CINTI) · doi:10.1109/cinti63048.2024.10830818 · Cited by 3
Applying analog quantum computing to solve optimisation problems: case studies on Max-Cut and CVRP
Deleplanque, S., Yaagoubi, A. E., Gras, T., Descamps, F., Mourrier, J., & Lefebvre, I. (2025) · International Journal of Systems Science Operations & Logistics · doi:10.1080/23302674.2025.2463530 · Cited by 5
Eigenvalue analysis of stochastic structural systems: A quantum computing approach
Taliadouros, L., Mavromatis, I. G., & Kougioumtzoglou, I. A. (2025) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2025.103814 · Cited by 5
Variational quantum simulation of the Fokker–Planck equation applied to quantum radiation reaction
Amaro, Ó., Gamiz, L. I. I., & Vranić, M. (2025) · Journal of Plasma Physics · doi:10.1017/s0022377825100652 · Cited by 6
“From (2.6), the maximum energy spread occurs approximately at t ∼ 1 /( 2 R c ) for σ max ∼ 3 5 / 4 √ 55 / 64 γ 0 √ χ 0 , which recovers the scaling derived by Vranic et al .”
InfluentialToward efficient quantum computation of molecular ground‐state energies
Sorourifar, F., Rouabah, M. T., Belaloui, N. E., Louamri, M. M., Chamaki, D., Gustafson, E., Tubman, N. M., Paulson, J. A., & Bernal, D. E. (2025) · AIChE Journal · doi:10.1002/aic.18887 · Cited by 11
Chawla, P., Shetty, D., Tsemo, P. B., Sugisaki, K., Riu, J., Nogué, J., Mukherjee, D., & Prasannaa, V. S. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06876-y · Cited by 8
Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
Binkowski, L., Koßmann, G., Tutschku, C., & Schwonnek, R. (2025) · Academia quantum. · doi:10.20935/acadquant7900 · Cited by 12
“Most VQAs such as the variational quantum eigensolver [3] or the quantum approximate optimization algorithm [10] are originally formulated for unconstrained problems and are thus merely applicable to instances without or softcoded constraints.”
Variational Quantum Demodulation for Coherent Optical Multi-Dimensional QAM
Koike–Akino, T., Matsumine, T., Wang, Y., Millar, D. S., Kojima, K., & Parsons, K. (2020) · Optical Fiber Communication Conference · doi:10.1364/ofc.2020.t3d.6 · Cited by 4
Local bottom-up effective theory of nonlocal electronic interactions
Lanatà, N. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.102.115115 · Cited by 3
Atchade-Adelomou, P., Alonso-Linaje, G., Albó-Canals, J., & Casado-Faulí, D. (2021) · Algorithms · doi:10.3390/a14070194 · Cited by 49
“O ( 1 p ) to obtain an estimate with precision p [52,53].”
BackgroundMethodInfluentialAdaptive random quantum eigensolver
Barraza, N., Pan, C.-Y., Lamata, L., Solano, E., & Albarrán-Arriagada, F. (2022) · Physical Review A · doi:10.1103/physreva.105.052406 · Cited by 3
Machine learning assisted quantum adiabatic algorithm design
Lin, J. H., Ye, M., Zhu, J., & Li, X. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210831 · Cited by 3
Xu, L., Lee, J. T., & Freericks, J. K. (2022) · Physical Review A · doi:10.1103/physreva.105.012406 · Cited by 5
Hu, Z., & Kais, S. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100158 · Cited by 4
“Over the years, numerous quantum algorithms have been proposed with the potential to outperform classical methods with decisive quantum advantage – these include the phase estimation algorithm [14], Shor’s factorization algorithm [15], the Harrow-Hassidim-Lloyd algorithm for linear systems [16], the hybrid classical-q…”
MethodJansen, K., Alexandrou, C., Funcke, L., Hartung, T., Kuehn, S., Polykratis, G., Stornati, P., & Wang, X. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0327 · Cited by 16
Understanding the Impact of Cutting in Quantum Circuits Reliability to Transient Faults
Casciola, N., Giusto, E., Dri, E., Oliveira, D., Rech, P., & Montrucchio, B. (2022) · IEEE International On-Line Testing Symposium (IOLTS) · doi:10.1109/iolts56730.2022.9897308 · Cited by 5
Variational Quantum Simulation of Valence-Bond Solids
Huerga, D. (2022) · Quantum · doi:10.22331/q-2022-12-13-874 · Cited by 7
“The variational quantum eigensolver [5] was one of the first VQA proposed to approximate the ground-state and energy of finite stronglycorrelated fermionic Hamiltonians as an alternative to the phase estimation algorithm [6], which provides the exact ground-state solution but requires coherence times on the quantum de…”
BackgroundTowards Efficient Superconducting Quantum Processor Architecture Design
Li, G., Ding, Y., & Xie, Y. (2022) · Springer eBooks · doi:10.1007/978-3-031-15699-1_3 · Cited by 6
Optimization at the Interface of Unitary and Non-unitary Quantum Operations in PCOAST
Schmitz, A. T., Ibrahim, M. M. A., Sawaya, N. P. D., Guerreschi, G. G., Paykin, J., Wu, X.-C., & Matsuura, A. Y. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00088 · Cited by 10
“A similar situation occurs when measuring an arbitrary Hamiltonian for the broad class of VQE algorithms [9, 10, 11] or any other class which requires the expectation value of a Hermitian observable.”
BackgroundSantos, L., Justum, Y., Vaeck, N., & Desouter-Lecomte, M. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4916355 · Cited by 4
Gradients just got more flexible
Meyer, J. J. (2021) · doi:10.22331/qv-2021-01-26-50 · Cited by 4
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00007-1 · Cited by 7
Quantum variational solving of the Wheeler-DeWitt equation
Czelusta, G., & B, J. M. A. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.126005 · Cited by 4
Stenger, J., Gunlycke, D., & Hellberg, C. S. (2022) · Physical Review A · doi:10.1103/physreva.105.022438 · Cited by 5
Digital Quantum Simulation and Circuit Learning for the Generation of Coherent States
Liu, R., Romero, S. V., Oregi, I., Osaba, E., Villar-Rodríguez, E., & Ban, Y. (2022) · Entropy · doi:10.3390/e24111529 · Cited by 5
“Among them, Variational Quantum Eigensolvers (VQE) [13,14] can prepare the initial state and estimate the ground-state energy in a flexible and efficient way by choosing a suitable ansatz [15–17] in a parameterized quantum circuit (PQC).”
BackgroundOhtsuki, Y., Mikami, S., Ajiki, T., & Tannor, D. J. (2023) · Journal of the Chinese Chemical Society · doi:10.1002/jccs.202200451 · Cited by 6
The unitary dependence theory for characterizing quantum circuits and states
Hu, Z., & Kais, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01188-y · Cited by 6
“This is a design principle that can guide the development of e.g., parameterized quantum circuits 18,27,40,41 where circuits and ansatz states are tested by varying gate parameters.”
BackgroundMethodMandal, A., & Hunt, K. L. C. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5054313 · Cited by 3
Quantum information outside quantum information
Pozas-Kerstjens, A. (2019) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-170923 · Cited by 15
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.