A variational eigenvalue solver on a photonic quantum processor
Open accessThe DOI matches its Crossref record; 47 of the 48 references it cites were found in a registry or an index; 14 of the 31 sources its claims cite were checked for support.
Abstract
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. Quantum computers promise to efficiently solve problems that would be practically impossible with a normal computer. Peruzzo et al. develop a variational computation approach that uses any available quantum resources and, with a photonic quantum processing unit, find the ground-state molecular energy of He–H+.
Overview
CoChat Summary
## TL;DR
The paper introduces a variational alternative to quantum phase estimation for finding eigenvalues, combining short coherent quantum measurements with classical optimization. It experimentally demonstrates the approach on a photonic processor by estimating the ground-state energy curve of He–H\(^+\).
## Key findings
- The authors report an experimental ground-state result for He–H\(^+\): after correcting for experimental errors, they estimate the equilibrium bond length as \(R = 92.3 \pm 0.1\) pm and the ground-state electronic energy as \(E = -2.865 \pm 0.008\) MJ mol\(^{-1}\).
- For the bond dissociation curve, more than 96% of the experimental data are within chemical accuracy of the theoretical values.
- In the discussion, they state that for a 4 × 4 Hamiltonian like the one demonstrated, the QPE circuit would require at least 12 CNOT gates, whereas their method requires one.
- The full experiment was performed in about 158 h, and the bond dissociation curve was obtained by finding the ground states of 79 Hamiltonians.
## Methods
- The paper combines a reconfigurable integrated photonic quantum processor with a classical optimization algorithm: the quantum device estimates Hamiltonian expectation values, and the classical processor updates the state parameters variationally.
- The photonic chip prepares and measures arbitrary two-qubit pure states using single-qubit rotations and one two-qubit entangling gate; the experimental demonstration uses the He–H\(^+\) molecule in a minimal basis.
- For the classical optimization, they use the Nelder–Mead algorithm; expectation values are reconstructed from four two-qubit Pauli measurements at each point.
## Limitations
- The paper states that the method still requires a good approximation to the ground state as input/initialization, and the reliance on multiple separate measurements makes it sensitive to variations in state preparation between calculations.
- The authors report a constant systematic shift of \(\varepsilon = 50\) kJ mol\(^{-1}\) in the measured expectation values; they attribute this to photon-source impurity/distinguishability, circuit imperfections, and unbalanced coupling efficiencies.
- Evident from the text: the demonstration is limited to a two-qubit / 4 × 4 Hamiltonian prototype, so the scalability claim is not experimentally validated here.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures




Verification
Claims the paper makes
7 Valid · 4 Not valid · 11 Not checked · 59 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Recent developments in the field of quantum computation offer a way forward for determining efficient solutions of many instances of large eigenvalue problems that are classically intractable6789101112”
§ A variational eigenvalue solver on a photonic quantum processor > Abstract
What the sources say
- Not matchedcites [6] Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information Cambridge University Press (2000).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Could not verifycites [7] Kitaev, A. Quantum measurements and the Abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC) 3 (1996). sourceExperimental — accuracy not yet measured
Our copy under this DOI is the ISAAC 2021 paper 'Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm' (Kitaev's 1995 work appears only as reference [9] in its bibliography), and it nowhere asserts that quantum computation gives efficient solutions to classically intractable large eigenvalue problems. Eigenvalues enter only as complexity parameters — λ, the smallest eigenvalue of the normalized up-Laplacian, in Lemma 31 and Theorem 26 (Section 6.3, 'Time efficient implementations') and in the phase-estimation machinery of Appendix A — and Section 1.1 ('Our Contributions') actually reports the opposite direction for its own problem: 'the quantum algorithm is slower than the classical algorithm in the worst case'. Searched: 'eigenvalue problems classically intractable', 'quantum speedup / exponential advantage', 'phase estimation', 'faster than classical'; no passage addresses the claim's point. (LLM, conf=0.70)
- Partly supportedcites [8] Griffiths, R. B. & Niu, C.-S. Semiclassical fourier transform for quantum computation. Phys. Rev. Lett. 76, 3228–3231 (1996). sourceExperimental — accuracy not yet measured
On p. 1, the paper says a quantum computer, if built, could solve certain problems such as factoring long numbers much faster than conventional algorithms. It also describes a simpler Fourier transform for Shor’s factorization and discrete-logarithm algorithms (p. 1). The copy does not support the claim about efficient solutions to many large eigenvalue problems. (LLM, conf=0.84)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
Every source the paper cites for this claim was checked and supports it.
In the paper
“this would suffer from the N-representability problem, which is known to be intractable for both classical and quantum computers (it is in the quantum complexity class QMA-Hard24).”
§ A variational eigenvalue solver on a photonic quantum processor > Results > Quantum expectation estimation
What the sources say
- Supportedcites [24] Liu, Y.-K., Christandl, M. & Verstraete, F. Quantum computational complexity of the n-representability problem: Qma complete. Phys. Rev. Lett. 98, 110503 (2007). source
The paper states that N-representability is QMA-complete and hence QMA-hard and NP-hard (Abstract). Its discussion of quantum-chemistry relevance says the problem is intractable in the worst case even on a quantum computer, while allowing that particular physical systems may be easier. (LLM, conf=0.93)
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“We have implemented the QPU using integrated quantum photonics technology30.”
§ A variational eigenvalue solver on a photonic quantum processor > Results > Prototype demonstration
What the sources say
- Supportedcites [30] O'Brien, J. L., Furusawa, A. & Vuckovic, J. Photonic quantum technologies. Nat. Photon. 3, 687–695 (2009). source
The citation identifies integrated quantum photonics as the technology used, rather than attributing the citing authors’ QPU implementation to this review. The “Integrated quantum optical circuits” section (p. 6) describes on-chip waveguide circuits performing quantum logic gates and a compiled quantum factoring algorithm. (LLM, conf=0.87)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The time the quantum computer must remain coherent is determined by the necessity of O(p−1) successive applications of , each of which can require on the order of millions or billions of quantum gates for practical applications1719, as compared to the tens to hundreds of gates achievable in the short term.”
§ A variational eigenvalue solver on a photonic quantum processor > Abstract
What the sources say
- Partly supportedcites [17] Whitfield, J. D., Biamonte, J. & Aspuru-Guzik, A. Simulation of electronic structure hamiltonians using quantum computers. Mol. Phys. 109, 735–750 (2011). sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [19] Jones, N. C. et al. Faster quantum chemistry simulation on fault-tolerant quantum computers. New J. Phys. 14, 115023 (2012). sourceExperimental — accuracy not yet measured
Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+.”
§ A variational eigenvalue solver on a photonic quantum processor > Abstract
boostedstates a causeSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
31 more claims
Create a free account to see all 81 claims and to verify the 4 references still open.
- It may state two separate claims as one. 28
- Probably not a substantial claim. 24
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“Leveraging quantum resources, the UCC ansatz was instead realized as a PQC on a photonic processor (Peruzzo et al. , 2014).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Peruzzo et al., 2014
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe cited source doesn’t support the claim as written.
In the citing paper
“The first on-chip GMM of four-qubit cluster state was realised in a laser-writing chip ( Fig.4e ), by manipulating both the polarisation and path DoFs of two photons [85].”
From Integrated photonic quantum technologies (2020) · cites this paper as [85]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe cited source doesn’t support the claim as written.
In the citing paper
“four-qubit linear- and box-cluster states are generated in a laser-writing photonic chip. This is enabled by on-chip manipulating the two-photon four-qubit hyperentangled state and cluster state, that are encoded in photon's path and polarisation DoFs. The Grover's search algorithm on a four-element database was implemented by controlling the device.”
From Integrated photonic quantum technologies (2020) · cites this paper as [85]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Due to its versatility, the variational Hamiltonian ansatz has been implemented for quantum chemistry [21, 29], optimization [24], and for quantum simulation problems [30].”
From Variational quantum algorithms (2021) · cites this paper as [29]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“For the original VQE (Peruzzo et al. , 2014) and QAOA (Farhi et al. , 2014) it can, for example, be described as a single expectation value min θ ⟨ H ⟩ U ( θ ) , where the differences solely appear in the specific form and construction of the qubit Hamiltonian.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Peruzzo et al., 2014
Experimental — accuracy not yet measured
12 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
(1999) · Cited by 12,854
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605 · cited 3×
“[12] S.”
BackgroundMethodPractical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981 · cited 3×
“[14] D.”
MethodInfluential�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597
Molecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
Self-citation
Research works printed but not linked: 3
- Helgaker, T., Jorgensen, P. & Olsen, J. Mol. Electronic Struct. Theory Wiley, Sussex (2002).
- Saad, Y. Numerical Methods for Large Eigenvalue Problems Vol. 158, (SIAM (1992).
- Rayleigh, J. W. In finding the correction for the open end of an organ-pipe. Phil. Trans. 161, 77 (1870).
Cited by
Items 1,801–1,900 of 4,573
Quantum computing for space applications: a selective review and perspectives
Torta, P., Casati, R., Bruni, S., Mandarino, A., & Prati, E. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00369-8 · Cited by 20
Taghavi, M., & Farnoosh, R. (2025) · Iran Journal of Computer Science · doi:10.1007/s42044-025-00306-z · Cited by 19
“Variational quantum algorithms, particularly the Quantum Approximate Optimization Algorithm (QAOA) [13] and Variational Quantum Eigensolver (VQE) [14], have demonstrated promising applications in reinforcement learning, including control policy learning and value function approximation.”
Opportunities and challenges of quantum computing for climate modeling
Schwabe, M., Pastori, L., de Vega, I., Gentine, P., Iapichino, L., Lahtinen, V., Leib, M., Lorenz, J. M., & Eyring, V. (2025) · Environmental Data Science · doi:10.1017/eds.2025.10010 · Cited by 23
“As quantum circuits become more complex, the classical component in PQCs and thus the required computing resources will grow as well, to the scale of an HPC problem.”
Quantum computing quantum Monte Carlo algorithm
Zhang, Y., Huang, Y., Sun, J., Lv, D., & Yuan, X. (2025) · Physical Review A · doi:10.1103/jt8s-hzhd · Cited by 35
“Although various variational quantum algorithms have been developed for this task [38–40], the answer is not straightforward due to several challenges.”
Variational quantum state preparation via quantum data buses
Kuzmin, V. V., & Silvi, P. (2020) · Quantum · doi:10.22331/q-2020-07-06-290 · Cited by 18
“An alternative, promising pathway towards quantum ground state preparation is given by feedback-loop quantum algorithms, and especially by the Variational Quantum Eigensolver [15–21] (VQE).”
MethodLi, C., & Evangelista, F. A. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0008353 · Cited by 12
Incoherent quantum algorithm dynamics of an open system with near-term devices
Mahdian, M., & Yeganeh, H. D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02800-8 · Cited by 14
“These algorithms and their applications are progressing in various fields such as variations quantum eigensolver (VQE) which is a hybrid algorithm to approximate the ground state eigenvalues for quantum simulations [16, 4], quantum approximate optimization algorithm (QAOA) for finding an approximate solution of an opt…”
MethodEliminating Redundant Computation in Noisy Quantum Computing Simulation
Li, G., Ding, Y., & Xie, Y. (2020) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218666 · Cited by 17
“Quantum Computing (QC) has attracted great interest from both academia and industry in the last decades due to its great potential in accelerating various important applications, such as integer factorization [1], database search [2], and molecule simulation [3].”
BackgroundExperimental quantum learning of a spectral decomposition
Geller, M. R., Holmes, Z., Coles, P. J., & Sornborger, A. T. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033200 · Cited by 19
“nian of a simulated model [29] or some other optimization objective [30–32].”
BackgroundSimulating a ring-like Hubbard system with a quantum computer
Suchsland, P., Barkoutsos, P. K., Tavernelli, I., Fischer, M. H., & Neupert, T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013165 · Cited by 16
Improved Approximation Algorithms for Bounded-Degree Local Hamiltonians
Anshu, A., Gosset, D., Korol, K. J. M., & Soleimanifar, M. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.250502 · Cited by 32
“In this vein, heuristic algorithms for ground state preparation have been proposed based on variationally minimizing the energy over the output states of shallow (low-depth) quantum circuits [2–4].”
MethodControllable entangled-state distribution in a dual-rail reconfigurable optical network
Osawa, S., Simon, D. S., Malinovsky, V. S., & Sergienko, A. V. (2021) · Physical Review A · doi:10.1103/physreva.104.012617 · Cited by 13
Hybrid quantum-classical algorithms: Foundation, design and applications
Chen, R.-Y.-L., Zhao, B., Song, Z., Zhao, X., Wang, K., & Wang, X. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210985 · Cited by 16
Mitigating Crosstalk in Quantum Computers through Commutativity-Based Instruction Reordering
Xie, L., Zhai, J., & Zheng, W. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586145 · Cited by 21
“Methodology Benchmarks We select 117 representative quantum programs from diverse applications such as reversible circuits [28], hidden group problems [19], quantum Fourier transform [12], phase estimation [1], and optimization [2].”
MethodVariational Algorithms for Workflow Scheduling Problem in Gate-Based Quantum Devices
Plewa, J., Sieńko, J., & Rycerz, K. (2021) · Computing and Informatics · doi:10.31577/cai_2021_4_897 · Cited by 18
“We focus on the two most popular algorithms: Variational Quantum Eigensolver (VQE) [20] and Quantum Approximate Optimization Algorithm (QAOA) [6].”
MethodSearch space pruning for quantum architecture search
He, Z., Su, J., Chen, C., Pan, M., & Situ, H. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-02714-7 · Cited by 16
“VQAs have achieved great success in many applications including finding ground and excited states [19,32,33,36], error correction [21,42], dynamical quantum simulation [8,9,17,30,43] and quantum compiling [16,22,25,39].”
BackgroundQuantum algorithm for electronic band structures with local tight-binding orbitals
Sherbert, K., Jayaraj, A., & Nardelli, M. B. (2022) · Scientific Reports · doi:10.1038/s41598-022-13627-x · Cited by 23
Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm
Ville, J.-L., Morvan, A., Hashim, A., Naik, R., Lu, M., Mitchell, B., Kreikebaum, J. M., O’Brien, K. P., Wallman, J. J., Hincks, I., et al. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033140 · Cited by 37
Jena, A., Genin, S. N., & Mosca, M. (2022) · Physical Review A · doi:10.1103/physreva.106.042443 · Cited by 17
Estimating the randomness of quantum circuit ensembles up to 50 qubits
Liu, M., Liu, J., Alexeev, Y., & Jiang, L. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00648-7 · Cited by 19
Variational quantum simulation of thermal statistical states on a superconducting quantum processer
Guo, X., Li, S.-S., Xiao, X., Xiang, Z., Ge, Z.-Y., Li, H., Song, P., Peng, Y., Wang, Z., Xu, K., et al. (2022) · Chinese Physics B · doi:10.1088/1674-1056/aca7f3 · Cited by 24
Accelerating Noisy VQE Optimization with Gaussian Processes
Müller, J., Lavrijsen, W., Iancu, C., & de Jong, W. A. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00041 · Cited by 26
“Hybrid quantum-classical algorithms [4], [21] such as the Variational Quantum Eigensolver (VQE) [28], [37] and QAOA [5], [39] combine a classical optimizer with evaluations on a quantum chip and fit both these criteria: they allow for control over circuit depth and their iterative nature provides a…”
MethodProbing Phases of Quantum Matter with an Ion-Trap Tensor-Network Quantum Eigensolver
Meth, M., Kuzmin, V., van Bijnen, R., Postler, L., Stricker, R., Blatt, R., Ringbauer, M., Monz, T., Silvi, P., & Schindler, P. (2022) · Physical Review X · doi:10.1103/physrevx.12.041035 · Cited by 22
Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
de Andoin, M. G., Oregi, I., Villar-Rodríguez, E., Osaba, E., & Sanz, M. (2022) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci51031.2022.10022156 · Cited by 24
“(VQE [4]) or the quantum approximate optimization algorithm”
BackgroundKernel-based quantum regressor models learning non-Markovianity
Tancara, D., Dinani, H. T., Norambuena, A., Fanchini, F. F., & Coto, R. (2023) · Physical Review A · doi:10.1103/physreva.107.022402 · Cited by 15
“[13] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J.”
BackgroundExcited-state molecular dynamics simulation based on variational quantum algorithms
Hirai, H. (2023) · Chemical Physics Letters · doi:10.1016/j.cplett.2023.140404 · Cited by 14
“In addition to the algorithms for a fault-tolerant quantum computer (FTQC), such as quantum phase estimation (QPE) [7], those for a noisy intermediate-scale quantum (NISQ) device [8], such as variational quantum algorithms (VQAs), including the variational quantum eigensolver (VQE) method [9, 10], have been developed.”
MethodExpressivity of Variational Quantum Machine Learning on the Boolean Cube
Herman, D., Raymond, R., Li, M., Robles, N., Mezzacapo, A., & Pistoia, M. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3255206 · Cited by 20
“[3] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien.”
BackgroundAvkhadiev, A., Shanahan, P. E., & Young, R. D. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054507 · Cited by 14
Lee, J.-M., Baldazzi, A., Sanna, M., Azzini, S., Ahn, J. T., Lee, M., Sohn, Y.-I., & Pavesi, L. (2023) · Photonics Research · doi:10.1364/prj.489869 · Cited by 12
“One example is the Variational Quantum Eigensolver [49,50], where what matters is the degree of indistinguishability and not the purity parameter.”
BackgroundQuantum data learning for quantum simulations in high-energy physics
Nagano, L., Miessen, A., Onodera, T., Tavernelli, I., Tacchino, F., & Terashi, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043250 · Cited by 24
“1, including a VQE ansatz [39] approximating the ground state of a Hamiltonian H(x), a circuit implementing a time-evolution U = e−iH(x)t [2], or another phenomenological quantum simulation circuit.”
MethodAnalyzing variational quantum landscapes with information content
Pérez-Salinas, A., Wang, H., & Bonet-Monroig, X. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00819-8 · Cited by 24
“Adrián Pérez-Salinas 1,2 , Hao Wang 1,3 & Xavier Bonet-Monroig 1,2 The parameters of the quantum circuit in a variational quantum algorithm induce a landscape that contains the relevant information regarding its optimization hardness.”
Preti, F., Schilling, M., Jerbi, S., Trenkwalder, L. M., Nautrup, H. P., Motzoi, F., & Briegel, H. J. (2024) · Quantum · doi:10.22331/q-2024-05-14-1343 · Cited by 23
“In particular, variational algorithms [4, 5], where most of the operations depend on several continuous parameters, have emerged as a suitable class of methods that could potentially achieve quantum speed-up on NISQ devices.”
BackgroundFast variational quantum algorithms for training neural networks and solving convex optimizations
Shao, C. (2019) · Physical Review A · doi:10.1103/physreva.99.042325 · Cited by 13
Near-term quantum-classical associative adversarial networks
Anschuetz, E. R., & Zanoci, C. (2019) · Physical Review A · doi:10.1103/physreva.100.052327 · Cited by 18
Jašek, J., Jiráková, K., Bartkiewicz, K., Černoch, A., Fürst, T., & Lemr, K. (2019) · Optics Express · doi:10.1364/oe.27.032454 · Cited by 15
A continuous variable Born machine
Čepaitė, I., Coyle, B., & Kashefi, E. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00063-3 · Cited by 22
“One type of framework which can utilise the restricted architectures of NISQ devices is that of hybrid quantum-classical (HQC) methods, which have found many applications recently in fields like quantum chemistry [2] and quantum machine learning (QML) [3].”
MethodSugisaki, K., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2020) · Chemical Science · doi:10.1039/d0sc04847j · Cited by 16
The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
Allcock, J., Vangone, A., Meyder, A., Adaszewski, S., Strahm, M., Hsieh, C.-Y., & Zhang, S. (2022) · Frontiers in Drug Discovery · doi:10.3389/fddsv.2022.908870 · Cited by 12
“In particular, the works of (Perdomo et al., 2008; Babbush et al., 2012; Perdomo-Ortiz et al., 2012; Babej et al., 2018; Outeiral et al., 2021a) investigate simulating lattice-based models of proteins using analog quantum computers such as quantum annealers; For gate-based quantum computing, lattice-models of proteins…”
BackgroundExactly solving the Kitaev chain and generating Majorana-zero-modes out of noisy qubits
Rančić, M. J. (2022) · Scientific Reports · doi:10.1038/s41598-022-24341-z · Cited by 16
Characterizing Error Mitigation by Symmetry Verification in QAOA
Kakkar, A., Larson, J. M., Galda, A., & Shaydulin, R. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00086 · Cited by 20
“The methods we use in this work can be easily adapted to develop a similar understanding of error mitigation by symmetry verification in other classes of variational quantum algorithms, including the variational quantum eigensolver [36] and quantum alternating operator ansatz [37].”
MethodEver more optimized simulations of fermionic systems on a quantum computer
Wang, Q., Cian, Z.-P., Li, M., Markov, I. L., & Nam, Y. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247693 · Cited by 14
“In Table I, we show the CNOT gate counts of the optimized VQE circuits, simulating a variety of molecules.”
BackgroundInfluentialSolving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum AlgorithmsPreprint
Oh, Y.-H., Mohammadbagherpoor, H., Dreher, P., Singh, A., Yu, X., & Rindos, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.00595 · Cited by 33
“Variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA) [11, 12] are the state-of-the-art algorithms for using NISQ devices and classical computing resources.”
InfluentialError mitigation by training with fermionic linear opticsPreprint
Montanaro, A., & Stanisic, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.02120 · Cited by 48
“One prominent method for achieving this goal is the variational quantum eigensolver (VQE) algorithm [1, 2], which aims to produce the ground state of a quantum system, allowing measurements to be made to determine properties of this state.”
MethodAvoiding local minima in Variational Quantum Algorithms with Neural NetworksPreprint
Rivera-Dean, J., Huembeli, P., Acín, A., & Bowles, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.02955 · Cited by 43
Variational quantum algorithms for trace distance and fidelity estimation
Chen, R., Song, Z., Zhao, X., & Wang, X. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac38ba · Cited by 86
“Such idea was applied to many key areas including Hamiltonian ground and excited states preparation [7, 8], quantum compiling [9], quantum classification [10–12], Gibbs state preparation [13–16], entanglement manipulation [17], and quantum linear algebra [18–22].”
Agent-Q: Fine-Tuning Large Language Models for Quantum Circuit Generation and Optimization
Jern, L., Uotila, V., Yu, C., & Zhao, B. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00179 · Cited by 40
“2) VQE: The VQE optimization routines require ansatzes [47].”
A Backend-agnostic, Quantum-classical Framework for Simulations of Chemistry in C ++
Claudino, D., McCaskey, A., & Lyakh, D. I. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3523285 · Cited by 16
“The variational quantum eigensolver (VQE) [35] has risen as the quintessential example of hybrid quantum-classical algorithm.”
MethodWang, Y., Ren, J., Li, W., & Shuai, Z. (2022) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.2c01475 · Cited by 13
Resource estimations for the Hamiltonian simulation in correlated electron materials
Kanno, S., Endo, S., Utsumi, T., & Tada, T. (2022) · Physical Review A · doi:10.1103/physreva.106.012612 · Cited by 11
Evaluation of vibrational energies and wave functions of CO2 on a quantum computer
Lötstedt, E., Yamanouchi, K., & Tachikawa, Y. (2022) · AVS Quantum Science · doi:10.1116/5.0091144 · Cited by 12
Adaptive Problem Solving Dynamics in Gate-Model Quantum Computers
Gyöngyösi, L. (2022) · Entropy · doi:10.3390/e24091196 · Cited by 14
“Particularly, our system model utilizes the quantum approximate optimization algorithm (QAOA) [6,7], which is a variational quantum algorithm, such as [31,34,35].”
MethodQuantum Computing Meets Artificial Intelligence: Innovations and Challenges
Metawei, M. A., ElDeeb, H. E., Nassar, S. M., & Taher, M. (2022) · Artificial intelligence-enhanced software and systems engineering · doi:10.1007/978-3-031-08202-3_12 · Cited by 13
Training Variational Quantum Circuits through Genetic Algorithms
Acampora, G., Chiatto, A., & Vitiello, A. (2022) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec55065.2022.9870242 · Cited by 19
“For example, in chemistry and physics the variational quantum eigensolver (VQE) [3] is used for searching the ground state of a specific Hamiltonian describing a quantum system, such as atoms and molecules.”
MethodPathak, S., Russo, A., Seritan, S., & Baczewski, A. (2023) · Physical Review A · doi:10.1103/physreva.107.l040601 · Cited by 19
Shirai, S., Iwakiri, H., Kanno, K., Horiba, T., Omiya, K., Hirai, H., & Koh, S. (2023) · ACS Omega · doi:10.1021/acsomega.3c01875 · Cited by 14
Quantum algorithms for generator coordinate methods
Zheng, M., Peng, B., Wiebe, N., Li, A., Yang, X., & Kowalski, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023200 · Cited by 16
Li, Z., Yu, G.-F., Wang, Y., Xing, Z.-Y., Kong, L.-W., & Zhou, X. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-023-2130-9 · Cited by 12
Self-citationMatsuo, A., Suzuki, Y., Hamamura, I., & Yamashita, S. (2023) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2023edp7071 · Cited by 26
Fermionic simulators for enhanced scalability of variational quantum simulation
Li, Q., Mukhopadhyay, C., & Bayat, A. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043175 · Cited by 13
Benchmarking the Variational Quantum Eigensolver using different quantum hardware
Bentellis, A., Matic-Flierl, A., Mendl, C. B., & Lorenz, J. M. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00065 · Cited by 15
“The Variational Quantum Eigen-solver (VQE) [5] is an exemplary VQA, which estimates the eigenvalues and low-lying eigenstates of a given Hamiltonian.”
BackgroundMethodLarge-scale error-tolerant programmable interferometer fabricated by femtosecond laser writing
Kondratyev, I. V., Ivanova, V., Fldzhyan, S. A., Argenchiev, A. S., Kostyuchenko, N. S., Zhuravitskii, S. A., Skryabin, N. N., Dyakonov, I. V., Saygin, M. Y., Straupe, S. S., et al. (2024) · Photonics Research · doi:10.1364/prj.504588 · Cited by 14
Scaling adaptive quantum simulation algorithms via operator pool tiling
Dyke, J. S. V., Shirali, K., Barron, G. S., Mayhall, N. J., Barnes, E., & Economou, S. E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l012030 · Cited by 27
On the need for effective tools for debugging quantum programs
Matteo, O. D. (2024) · doi:10.1145/3643667.3648226 · Cited by 23
“The following bugs were identified (i.e., caused) by the author while implementing a variational quantum eigensolver (VQE) [33] and running it on hardware [37].”
Experimental demonstration of a high-fidelity virtual two-qubit gate
Singh, A. P., Mitarai, K., Suzuki, Y., Heya, K., Tabuchi, Y., Fujii, K., & Nakamura, Y. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013235 · Cited by 20
Evaluating the Impact of Noise on Variational Quantum Circuits in NISQ Era Devices
Khanal, B., & Rivas, P. (2023) · Congress in Computer Science, Computer Engineering, and Applied Computing (CSCE) · doi:10.1109/csce60160.2023.00272 · Cited by 18
“Hybrid quantum-classical algorithms, such as the Variational Quantum Eigensolver (VQE) [5] and the Quantum Approximate Optimization Algorithm (QAOA) [6], exemplify this approach by leveraging the advantages of quantum computation and mitigating potential losses through classical optimization…”
MethodHybrid Quantum Systems with Artificial Atoms in Solid State
Chia, C., Huang, D., Leong, V., Kong, J. F., & Goh, K. E. J. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300461 · Cited by 17
Sequential optimal selections of single-qubit gates in parameterized quantum circuits
Wada, K., Raymond, R., Sato, Y., & Watanabe, H. C. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad4583 · Cited by 32
“As the global cost we employed the infidelity in equation (E.2) with randomly-generated states as described in the previous section, while the local cost is the Hamiltonian of the mixed-field Ising model in equation (E.1).”
MethodInfluentialAdaptive projected variational quantum dynamics
Linteau, D., Barison, S., Lindner, N. H., & Carleo, G. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023130 · Cited by 17
Measurement-Based Infused Circuits for Variational Quantum Eigensolvers
Chan, A., Shi, Z., Dellantonio, L., Dür, W., & Muschik, C. A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.240601 · Cited by 34
Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic
Gu, A., Hu, H.-Y., Luo, D., Patti, T. L., Rubin, N. C., & Yelin, S. F. (2024) · Quantum · doi:10.22331/q-2024-07-23-1422 · Cited by 19
Zheng, Q., Yu, M., Zhu, P., Wang, Y., Luo, W., & Xu, P. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2385-7 · Cited by 11
Materia, D., Ratini, L., Angeli, C., & Guidoni, L. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c03756 · Cited by 18
“A widely known method for near-term applications in quantum chemistry is the Variational Quantum Eigensolver (VQE) 7;8;9 , used to variationally approximate the groundstate of a molecular Hamiltonian by routinely measuring on the Quantum Processing Unit (QPU) the energy of a parameterized quantum…”
Energy-dependent barren plateau in bosonic variational quantum circuits
Zhang, B., & Zhuang, Q. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad80bf · Cited by 22
“VQCs utilize classical control to optimize a quantum circuit to solve computation problems, including optimization [3], eigen-system problem [4–10], partial-differential equations [11], quantum simulation [12–14] and machine learning [15–24].”
On proving the robustness of algorithms for early fault-tolerant quantum computers
Kshirsagar, R., Katabarwa, A., & Johnson, P. (2024) · Quantum · doi:10.22331/q-2024-11-20-1531 · Cited by 29
“We have used acronyms to abbreviate following algorithms quantum alternating operator ansatz (QAOA) [6], variational quantum eigensolver (VQE) [5], quantum neural networks (QNN) [32], robust amplitude estimation (RAE) [19], low-depth ground state energy estimation (GSEE)[23, 25], ground state property estimation (GSPE…”
Hardware-tailored diagonalization circuits
Miller, D., Fischer, L. E., Levi, K., Kuehnke, E. J., Sokolov, I. O., Barkoutsos, P. K., Eisert, J., & Tavernelli, I. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00901-1 · Cited by 40
“For example, in the variational quantum eigensolver (VQE) algorithm 12 – 14 , a classical computer optimizes the parameters of a trial quantum state vector ∣ ψ (cid:1) to accurately approximate the minimal eigenvalue of an observable O , e.g., the Hamiltonian of a molecule.”
Nonlinear transformation of complex amplitudes via quantum singular value transformation
Guo, N., Mitarai, K., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043227 · Cited by 49
Jet discrimination with a quantum complete graph neural network
Chen, Y. A., & Chen, K. F. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.016020 · Cited by 22
Avoiding barren plateaus with entanglement
Yao, Y., & Hasegawa, Y. (2025) · Physical Review A · doi:10.1103/physreva.111.022426 · Cited by 21
“The implementation of quantum algorithms can be hindered by barren plateaus, which is especially problematic for quantum machine learning algorithms and variable quantum algorithms (VQAs) [5, 11–14].”
Chawla, P., Shweta, Swain, K. R., Patel, T., Bala, R., Shetty, D., Sugisaki, K., Mandal, S. B., Riu, J., Nogué, J., et al. (2025) · Physical Review A · doi:10.1103/physreva.111.022817 · Cited by 16
Algorithm-oriented qubit mapping for variational quantum algorithms
Ji, Y., Chen, X., Polian, I., & Ban, Y. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034022 · Cited by 19
Photonic parameter-shift rule: Enabling gradient computation for photonic quantum computers
Pappalardo, A., Emeriau, P.-E., de Felice, G., Ventura, B., Jaunin, H., Yeung, R. W. K., Coecke, B., & Mansfield, S. (2025) · Physical Review A · doi:10.1103/physreva.111.032429 · Cited by 20
“We use the 2-qubit circuit used in [3] for the quantum state preparation and the measurements with 8 tunable parameters.”
Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
Kiss, O., Azad, U., Requena, B., Roggero, A., Wakeham, D., & Arrazola, J. M. (2025) · Quantum · doi:10.22331/q-2025-04-01-1682 · Cited by 31
“Additionally, VQE [6], quantum imaginary time evolution [60], dissipative .”
Belaloui, N. E., Tounsi, A., Khamadja, A. R., Louamri, M. M., Benslama, A., Bernal, D. E., & Rouabah, M. T. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01657 · Cited by 34
VanQver: the variational and adiabatically navigated quantum eigensolver
Matsuura, S., Yamazaki, T., Senicourt, V., Huntington, L., & Zaribafiyan, A. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8080 · Cited by 20
A Systematic Methodology to Compute the Quantum Vulnerability Factors for Quantum Circuits
Oliveira, D., Giusto, E., Baheri, B., Guan, Q., Montrucchio, B., & Rech, P. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3313934 · Cited by 24
“Q UANTUM computing is quickly moving from being a conceptual solution to physics problems to an extremely efficient and promising computing architecture for critical applications, such as Big Data [1], machine learning [2], chemistry [3], and drug development [4], just to name a few.”
BackgroundNormalized Gradient Descent for Variational Quantum Algorithms
Suzuki, Y., Yano, H., Raymond, R., & Yamamoto, N. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00015 · Cited by 23
“To date, a variety of VQAs has been proposed; the variational quantum eigensolver (VQE) for quantum chemistry [5]–[7], the quantum approximate optimization algorithm (QAOA) for combinatorial optimizations [8]–[10], and quantum circuit learning algorithms for machine learning problems [11]–[13].”
BackgroundVariational Quantum Circuit-Based Reinforcement Learning for POMDP and Experimental Implementation
Kimura, T., Shiba, K., Chen, C.-C., Sogabe, M., Sakamoto, K., & Sogabe, T. (2021) · Mathematical Problems in Engineering · doi:10.1155/2021/3511029 · Cited by 12
A quantum genetic algorithm for optimization problems on the Bloch sphere
Amal, R. S., & Ivan, J. S. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03368-7 · Cited by 15
“[22,51] using the polarization degree of freedom.”
Operator Relationship between Conventional Coupled Cluster and Unitary Coupled Cluster
Freericks, J. K. (2022) · Symmetry · doi:10.3390/sym14030494 · Cited by 13
Communication Trade Offs in Intermediate Qudit Circuits
Litteken, A., Baker, J. M., & Chong, F. T. (2022) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl52857.2022.00014 · Cited by 11
“In the near-term, however, there are many promising applications, like variational algorithms such as VQE and QAOA [7] [8], which aim to solve classical optimization problems using the quantum computer as a sort of accelerator in a classical-quantum optimization loop.”
MethodKumar, A., DeGregorio, N., Ricard, T. C., & Iyengar, S. S. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00484 · Cited by 14
Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization
Hao, T., Shaydulin, R., Pistoia, M., & Larson, J. M. (2022) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs56647.2022.00017 · Cited by 17
“The variational quantum eigensolver (VQE) was the first VQA proposed, originally designed for finding the ground state of a given molecule [7].”
BackgroundNguyen, M. T., Lee, Y., Alfonso, D. R., Shao, Q., & Duan, Y. (2023) · AVS Quantum Science · doi:10.1116/5.0137750 · Cited by 15
A Pulse Generation Framework with Augmented Program-aware Basis Gates and Criticality Analysis
Chen, Y., Jin, Y., Hua, F., Hayes, A. B., Li, A., Shi, Y., & Zhang, E. Z. (2023) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca56546.2023.10070990 · Cited by 18
“[20] applies QOC for a specific type of quantum algorithms that have an iterative nature, such as VQE [33], [41] and QAOA [17].”
MethodToward a quantum simulation of nonlinear sigma models with a topological term
Araz, J. Y., Schenk, S., & Spannowsky, M. (2023) · Physical Review A · doi:10.1103/physreva.107.032619 · Cited by 20
Bai, Q., & Hu, X. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03929-y · Cited by 12
“There are also some quantum-classical hybrid algorithms for quantum chemistry called variational quantum eigenvalue(VQE) solver [8–10].”
BackgroundConvex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor
Lau, J. W. Z., Lim, K. H., Bharti, K., Kwek, L. C., & Vinjanampathy, S. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.240601 · Cited by 16
Halder, S., Patra, C., Mondal, D., & Maitra, R. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0155009 · Cited by 13
Kosugi, T., Nishi, H., & Matsushita, Y. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00778-6 · Cited by 26
“Their approach, which we refer to as the variational ITE (VITE) in what follows, is a kind of the variational quantum eigensolver (VQE) [18, 19].”
BackgroundMethodQuantum Natural Language Generation on Near-Term Devices
Karamlou, A., Wootton, J. R., & Pfaffhauser, M. (2022) · International Conference on Natural Language Generation · doi:10.18653/v1/2022.inlg-main.22 · Cited by 22
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.