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 3,301–3,400 of 4,572
Quantum sparse coding and decoding based on quantum network
Ji, X., Liu, Q., Huang, S., Chen, A., & Wu, S. (2024) · Applied Physics Letters · doi:10.1063/5.0226021 · Cited by 4
Quff: A Dynamically Typed Hybrid Quantum-Classical Programming Language
Wright, C. J., Luján, M., Petoumenos, P., & Goodacre, J. (2024) · ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes (MPLR) · doi:10.1145/3679007.3685063 · Cited by 2
Classification and transformations of quantum circuit decompositions for permutation operations
Khandelwal, A., Kurniawan, H., Aangiras, S., Salehi, Ö., & Glos, A. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04508-5 · Cited by 1
Resource-efficient quantum algorithm for linear systems of equations
Ghisoni, F., Scala, F., Bajoni, D., & Gerace, D. (2026) · Physical Review A · doi:10.1103/gwzg-4pls · Cited by 6
“VQAs have been proposed to solve a wide range of problems, such as classification [32], chemical simulation [33–36] entanglement witness [37], solving non-linear differential equations [38, 39].”
Efficient large-scale quantum optimization via counterdiabatic ansatz
Liu, J., & Wang, X. (2025) · Physical Review A · doi:10.1103/physreva.111.052628 · Cited by 3
Neural networks with quantum states of light
Labay-Mora, A., García‐Beni, J., Giorgi, G. L., Soriano, M. C., & Zambrini, R. (2024) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2023.0346 · Cited by 9
“Furthermore, photonic quantum processing units were used to efficiently solve the quantum phase estimation algorithm through a variational eigensolver algorithm [78].”
Quantum kernel t-distributed stochastic neighbor embedding
Kawase, Y., Mitarai, K., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043234 · Cited by 1
Short-time simulation of quantum dynamics by Pauli measurements
Faehrmann, P. K., Eisert, J., Kieferová, M., & Kueng, R. (2025) · Physical Review A · doi:10.1103/6ggs-y392 · Cited by 7
“Besides estimating the energy of some trial states necessary for the variational quantum eigensolver and most other variational quantum algorithms [14–16], such methods can also be used to estimate expectation values of observables with small Frobe-∗ nius norms, such as overlaps with pure states…”
Hakim, D. F., Prayitno, T. B., & Sarwono, Y. P. (2024) · SPEKTRA Jurnal Fisika dan Aplikasinya · doi:10.21009/spektra.093.03 · Cited by 3
Approximate Compilation with Error Mitigation
Ezekiel, J., Wang, D. S., & Nam, Y. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10418 · Cited by 1
“Consider a matrix exponentiation of a double-excitation operator minus its hermitian conjugate [1], as is typically used in the simulation of quantum systems [2].”
He, Z., Re, L. D., Kemper, A. F., & Freericks, J. K. (2025) · Physical review. B./Physical review. B · doi:10.1103/p1mq-8xbg · Cited by 2
Electronic structure theory with molecular point group symmetries on quantum annealers
Desroches, J., & Dong, S. S. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0261736 · Cited by 3
Zeng, Y., He, J. L., Huang, Q., Wang, H., & Chang, S. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400395 · Cited by 2
Chachkarova, E., Tse, T., Yordanov, Y. S., Wei, Y., & Weber, C. (2025) · International Journal of Molecular Sciences · doi:10.3390/ijms26041550 · Cited by 2
Sheng, Z., Li, W., & Shuai, Z. (2025) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/tb-2024-1150 · Cited by 1
Britant, & Tiwari, A. S. (2025) · doi:10.1109/comsnets63942.2025.10885679 · Cited by 1
“It builds upon the principles of the Variational Quantum Eigensolver (VQE) [13], which is primarily used to find the ground state energy.”
Efficient particle-conserving symmetric quantum circuits
Ayeni, B. M. (2025) · Physical Review A · doi:10.1103/physreva.111.022629 · Cited by 7
Neutral atom quantum computers for the applications in condensed matter physics
Shweta, Kaur, I., Singh, N., Kanjilal, S., & Santra, B. (2025) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/adbb9b · Cited by 3
“It combines and utilizes the resources both from classical and quantum framework [319, 330–332].”
Quantum spiking neural networks for image classification
Liu, S., & Gu, Y. (2025) · International Conference on Algorithms, Network, and Communication Technology (ICANCT) · doi:10.1117/12.3059865 · Cited by 4
“Ansatz consists of a PQC with multiple trainable quantum gate parameters 24 .”
Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
Agrawal, A. A., Getelina, J. C., Francis, A., & Kemper, A. F. (2025) · Physical Review A · doi:10.1103/physreva.111.032607 · Cited by 3
Saha, D., Richerme, P., & Iyengar, S. S. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01343 · Cited by 1
Zhou, X., Wang, Y., Tao, W., Zhou, Z., & Luo, L. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500067 · Cited by 1
Self-citationPerformance analysis of a filtering variational quantum algorithm
Marin-Sanchez, G., & Amaro, D. (2025) · New Journal of Physics · doi:10.1088/1367-2630/add365 · Cited by 4
“One promising example of VQA for combinatorial optimization is the filtering variational quantum eigensolver (F-VQE) [20, 21], which showed improved performance compared to other quantum algorithms like the VQE [22] and the quantum approximate optimization algorithm (QAOA) [23].”
Topical issue on quantum computing in low-energy nuclear theory
Ayral, T., Duguet, T., Lacroix, D., & Somà, V. (2025) · The European Physical Journal A · doi:10.1140/epja/s10050-025-01575-9 · Cited by 1
Efficient estimation and sequential optimization of cost functions in variational quantum algorithms
Umer, M., Mastorakis, E., & Angelakis, D. G. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/add55e · Cited by 7
“…adopted cost function in VQAs is the expectation value of an observable, which is considered for various problems across diverse domains, including quantum chemistry [11, 12, 14], quantum approximate optimization algorithm (QAOA) [27], and quadratic un-constrained binary optimization (QUBO) [29].”
InfluentialVariational quantum Hamiltonian engineering
Zhao, B., & Fujii, K. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023123 · Cited by 3
High-fidelity initialization of a logical qubit with multiple injections
He, Z., & Xue, Z. (2025) · Physical Review A · doi:10.1103/physreva.111.052419 · Cited by 4
The Symmetry‐Based Expressive QAOA for the MaxCut Problem
Xiumei, Z., Li, Y., Li, G., Shi, Y., Qin, S., & Gao, F. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500199 · Cited by 2
Self-attention U-Net decoder for toric codes
Zhang, W., Xia, Z., Zhao, W., Pan, W., & Shi, H. (2025) · Physical Review Applied · doi:10.1103/xmp9-bh84 · Cited by 3
“…computers possess parallel computing capabilities that classical computers lack and have demonstrated their advantage in various fields including cryptography [2, 3], database searches [4–6], combinatorial optimization [7, 8], molecular dynamics simulations [9, 10], and machine learning [11–13].”
Adaptive Variational Quantum Simulations of Periodic Materials Using Qubit-Encoded Wave Functions
Li, X., Fan, Y., Liu, J., Li, Z., & Yang, J. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00412 · Cited by 3
Ha, H., Shon, S., & Lee, S. (2025) · Biomimetics · doi:10.3390/biomimetics10060407 · Cited by 2
“This concept was first introduced through the variational quantum eigenvalue (VQE) proposed by Pe-ruzzo et al. in 2014 [33], and it has since expanded into various applications, such as the quantum approximate optimization algorithm (QAOA) and variational quantum classifier (VQC).”
Optimization of the Qubit Coupled Cluster Ansatz on Classical Computers
Ryabinkin, I. G., Jenab, S. M. H., & Genin, S. N. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00345 · Cited by 2
Trusted execution environments for quantum computers
Trochatos, T., Xu, C., Deshpande, S. R., Lu, Y., Ding, Y., & Szefer, J. M. (2025) · Frontiers in Computer Science · doi:10.3389/fcomp.2025.1521059 · Cited by 2
QR-Map: A Map-Based Approach to Quantum Circuit Abstraction for Qubit Reuse Optimization
Kim, H. J., Jang, E., Choi, S., Kim, Y., & Ro, W. W. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731020 · Cited by 5
Huang, D., Dai, W., Gao, F., Yang, M., Pan, Y., Ju, J., & Ma, Y. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500241 · Cited by 1
Masum, A. K. M., Moghadam, M. S., Kouhalvandi, L., Najafi, M. H., & Aygün, S. (2025) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3716368.3735286 · Cited by 4
Variational Quantum Algorithm for Solving the Liouvillian Gap
Xie, X.-D., Xue, Z., & Zhang, D.-B. (2025) · Chinese Physics Letters · doi:10.1088/0256-307x/42/8/080605 · Cited by 4
Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation
Teranishi, Y., Hiraoka, S., Mizukami, W., Okita, M., & Ino, F. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3748261 · Cited by 4
ATTAQ: Adversarial Robustness of Quantum Machine Learning
Marchiori, F., & Conti, M. (2025) · International Conference on Dependable Systems and Networks workshops · doi:10.1109/dsn-w65791.2025.00062 · Cited by 3
“Although at its nascent stages of development, QML has already found implications in different domains such as chemistry [5] and high-energy physics [6].”
Shi, H. J., 韩, C. 成. H., 王, P. 鹏. W., & Zhang, M. (2025) · Chinese Physics B · doi:10.1088/1674-1056/adefd7 · Cited by 1
Polynomial Scaling Localized Active Space Unitary Selective Coupled Cluster Singles and Doubles
Verma, S., D’Cunha, R., Mitra, A., Hermes, M. R., Gray, S. K., Otten, M., & Gagliardi, L. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00745 · Cited by 2
Gresch, A., Tepe, U., & Kliesch, M. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00370 · Cited by 4
“Furthermore, this includes, as one immediate use-case, the optimization and final read-out of hybrid quantum algorithms such as the variational quantum eigensolver (VQE) [32–34].”
Quick design of feasible tensor networks for constrained combinatorial optimization
Nakada, H., Tanahashi, K., & Tanaka, S. (2025) · Quantum · doi:10.22331/q-2025-07-21-1799 · Cited by 9
“By encoding our feasible MPSs into variational quantum circuits [45], such as Variational Quantum Eigen-solver (VQE) [46] or QAOA [47], a new gate-based method for constrained combinatorial optimization will be realized.”
Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
Kuroiwa, K., & Nakagawa, Y. O. (2025) · Quantum · doi:10.22331/q-2025-07-21-1800 · Cited by 10
“It is then natural to consider using early FTQC with a smaller number of T -gates, such as the variational quantum eigensolver [44] with an ansatz with a deep quantum circuit, at some point in time.”
Proposed Five-Electron Charge Quadrupole Qubit
Caporaletti, J. H., & Kestner, J. P. (2025) · Physical Review Letters · doi:10.1103/l1x2-n2w9 · Cited by 2
Concurrent processing of VQE-UCCSD calculations with the FMO scheme
Doi, H., Sugisaki, K., Nakano, T., Katagiri, T., & Mochizuki, Y. (2025) · Chemistry Letters · doi:10.1093/chemle/upaf145 · Cited by 1
AQUA: Hardware-Agnostic Qubit Allocation for Quantum Multi-Programming
Piao, X., Shim, J., Kim, J., & Kim, J. (2025) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps64566.2025.00022 · Cited by 4
Flat optics produces quantum graphs
Shcherbakov, M. R. (2025) · Science · doi:10.1126/science.adz5392 · Cited by 1
Variational quantum eigensolver toward non-bonded interaction system with hardware-efficient ansatz
Yan, B., & Li, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04861-z · Cited by 1
“In order to facilitate electronic structure computations under limited quantum computing resources, a quantum–classical hybrid algorithm, the variational quantum eigensolver (VQE) was proposed [6].”
Investigating Techniques to Optimise the Layout of Turbines in a Windfarm Using a Quantum Computer
Hancock, J., Craven, M. J., McNeile, C., & Vadacchino, D. (2025) · Journal of quantum computing · doi:10.32604/jqc.2025.068127 · Cited by 4
“The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the lowest eigenvalue of a Hamiltonian that is in the form of a Pauli string [36].”
A Variational Quantum Algorithm for the Permutation Flow Shop Scheduling Problem
Baioletti, M., Fagiolo, F., Oddi, A., & Rasconi, R. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3734312 · Cited by 3
Conditional diffusion-based parameter generation for quantum approximate optimization algorithm
Meng, F., Zhou, X., Zhu, P., & Luo, Y. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00397-4 · Cited by 12
“…transformative technologies and presents an entirely new computational paradigm that has the potential to achieve an exponential or polynomial advantage for classically intractable problems that encompass machine learning [1–4], molecular dynamics [5–8], and combinatorial optimization [9–13], etc.”
Self-citationHigh-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Weiden, M., Kalloor, J., Kubiatowicz, J. D., Younis, E., & Iancu, C. (2025) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.426.8 · Cited by 11
“This suite of algorithms includes Shor’s Algorithm [39], TFIM, Heisenberg, and Hubbard model quantum chemistry simulation circuits [4], trained VQE [32] and QAOA [14] circuits, and QPE circuits [22].”
Towards ML- and QML-Accelerated Discovery of Catalytic Materials and Mechanisms—A Progress Review
Salahub, D. R., Barrios-Herrera, L., Naseri, M., Ghosh, S., Shahmohamadi, H., Simon, C., Zadeh‐Haghighi, H., Gour, D., Bellinger, C., Gusarov, S., et al. (2025) · Progress in theoretical chemistry and physics · doi:10.1007/978-3-031-85167-4_10 · Cited by 1
Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
Nádori, J., Morse, G., Villám, B. F., Majnay-Takács, Z., Zimborás, Z., & Rakyta, P. (2025) · Quantum · doi:10.22331/q-2025-08-29-1841 · Cited by 12
“The Variational Quantum Eigensolver (VQE) originally formulated by Peruzzo et al. [1] and Mc-CLean et al. [2], has garnered considerable attention within the research community over the past two decades [3].”
Automated Bone Fracture Classification Using a Hybrid Quantum-Classical Neural Network Approach
Praveen, S., Maharajan, K., Yuktesh, P., Guptha, P. Y., & Kumar, R. V. (2025) · International Conference for Emerging Technology (INCET) · doi:10.1109/incet64471.2025.11140367 · Cited by 1
“…using quantum circuits 3) Classical Post-processing: Final classification using dense neural layers [30] This architecture leverages classical components for computationally intensive tasks while utilizing quantum processing for operations that benefit most from quantum advantages [31].”
Tiny Quantum, Giant Revolution
Chang, C., & Wang, M. (2025) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2025.3586000 · Cited by 1
Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition
Wan, L., Liu, J., & Yang, J. (2025) · Chemical Research in Chinese Universities · doi:10.1007/s40242-025-5149-y · Cited by 1
Automatic Molecule Fragmentation for Density Matrix Embedding Theory
Imamura, S., Iijima, N., Kasagi, A., & Yoshida, E. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c06027 · Cited by 1
Iterative qubit coupled cluster using only clifford circuits
Brown, J. C., Coons, M. P., Lloyd, E., Fleury, A., Bieniasz, K., Senicourt, V., & Zaribafiyan, A. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae0b08 · Cited by 4
Mai, N.-D., Nando, Y. A., Lee, Y., & Chung, W. (2025) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2025.3614819 · Cited by 4
“Quantum-classical CNNs (QC-CNNs) combine classical machine learning with QC principles—such as superposition and entanglement—to model nonlinear patterns in EEG data more e ff ectively [30], [31].”
Zade, A. A., Sugisaki, K., Werner, M., Palacios, A., Riu, J., Nogué, J., García-Sáez, A., Riera, A., & Prasannaa, V. S. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06858-0 · Cited by 7
Multi-emitter solid state quantum optics
Grim, J. Q., Bracker, A. S., Reinecke, T. L., Lekavicius, I., & Yeats, A. L. (2025) · Materials for Quantum Technology · doi:10.1088/2633-4356/ae0dd9 · Cited by 1
Optimized quantum sensor networks for ultralight dark matter detection
Santoso, A. I., & Ho, L. B. (2025) · Physical review. D/Physical review. D. · doi:10.1103/rv43-54zq · Cited by 2
“This hybrid framework enables adaptive learning of optimal sensing strategies and has been experimentally demonstrated on various quantum platforms [30, 31].”
( 2 + 1 ) D quantum electrodynamics at finite density on a quantum computer
Rosanowski, E. O., Crippa, A., Funcke, L., Itaboraí, P. V., Jansen, K., & Singh, S. (2026) · Physical review. D/Physical review. D. · doi:10.1103/3ntp-l3s7 · Cited by 2
“To this end, we employ the variational quantum eigensolver (VQE) [29], a resource-efficient alternative to quantum phase estimation [30] that is well-suited for noisy intermediate-scale quantum (NISQ) devices [31].”
A Review of Quantum Scientific Computing Algorithms Relevant to Computational Mechanics
Raisuddin, O. M., & De, S. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10321-9 · Cited by 6
“The most notable variational quantum algorithm is the variational quantum eigensolver (VQE), which was introduced by [148] to prepare the groundstate of the helium hydride ion.”
Multi‐Channel Convolutional Neural Quantum Embedding
Kim, Y., Im, C., Kim, T., Hur, T., & Park, D. K. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500575 · Cited by 6
Neural-Network-Assisted Monte Carlo Sampling Trained by Quantum Approximate Optimization Algorithm
Nakano, Y., Okada, K. N., & Fujii, K. (2026) · PRX Quantum · doi:10.1103/9nhx-5pym · Cited by 8
Mooney, G. J., Villanueva, J., Bardhan, B. R., Ghosh, J., Hill, C. D., & Hollenberg, L. C. L. (2026) · Physical Review Research · doi:10.1103/xv79-w3rs · Cited by 4
“1, is a form of variational quantum eigensolver (VQE) [32] based on the variational principle of quantum mechanics.”
AccelerQ: Accelerating Quantum Eigensolvers with Machine Learning on Quantum Simulators
Bensoussan, A., Chachkarova, E., Even-Mendoza, K., Fortz, S., & Lenihan, C. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763132 · Cited by 1
Li, Z.-L., & Zhang, S. (2026) · Physical Review Research · doi:10.1103/4kyq-n8jb · Cited by 14
Multiclass portfolio optimization via variational quantum Eigensolver with Dicke state ansatz
Scursulim, J. V. S., Langeloh, G. M., Beltran, V. L., & Brito, S. (2026) · Scientific Reports · doi:10.1038/s41598-026-36333-4 · Cited by 5
Efficient Quantum Chemistry Calculations on Noisy Quantum Hardware
Bauer, N. M., Aydeniz, K. Y., & Siopsis, G. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500248 · Cited by 9
“…of our SQDOpt algorithm to the state-of-the-art algorithms and techniques, i.e., Self-consistent Field (SCF) [20], Full Configuration Interaction (FCI) [21], Density Matrix Renormalization Group (DMRG) [22], VQE [1, 2], QITE [23], that are commonly used for quantum chemistry is presented in Fig.”
Improved strategies for fermionic quantum simulation with global interactions
Kaldenbach, T. N., Schultheis, E., Stewen, N., & Breuil, G. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01223-0
“We have verified that for both fermionic-and qubit excitations, the truncated ans¨atze can achieve chemical accuracy of 10 − 3 Ha [31] on an ideal device.”
Nirmal, M. R., Khandelwal, A., Nambiar, M. K., & Yamijala, S. S. R. K. C. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c04605 · Cited by 9
“Some of the prominent examples include the Quantum Phase Estimation (QPE) 9,10 , Quantum Subspace Expansion (QSE) 11,12 , Variational Quantum Eigensolver (VQE) 13,14 , and Imaginary Time Evolution 15 .”
da Silva, W. P., Vieira, D., Maziero, J., et al. (2025) · Brazilian Journal of Physics · doi:10.1007/s13538-025-01935-2 · Cited by 1
“Quantum Monte Carlo studies (e.g., Chen and Anderson [16], Corongiu and Clementi [17], Prayitno et al. [18]) and quantum eigensolver demonstrations on actual quantum processors [19, 20] illustrate how the HL ansatz continues to inspire both classical and quantum computational methods.”
Approximate quadratization of high-order Hamiltonians for combinatorial quantum optimization
Drăgoi, S., Baiardi, A., & Egger, D. J. (2026) · Physical Review Research · doi:10.1103/9rc4-vj11 · Cited by 9
Weighted approximate quantum natural gradient for variational quantum eigensolver
Shi, C., Dunjko, V., & Wang, H. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae3fc8 · Cited by 6
“The goal of the VQE, initially introduced by [7], is to approximately seek the ground state ρ GS with respect to a Hamiltonian H .”
Quantum Advantage via Efficient Postprocessing on Qudit Classical Shadow Tomography
Wang, Y. (2025) · Physical Review Letters · doi:10.1103/92ky-ln8f · Cited by 1
Notable Variational Algorithms: VQE, QAOA, and VQLS
Raisuddin, O. M., & De, S. (2025) · Springer eBooks · doi:10.1007/978-3-032-03325-3_36 · Cited by 1
Wavefunction Optimization at the Complete Basis Set Limit with Multiwavelets and DMRG
Nibbi, M., Frediani, L., Dinvay, E., & Mendl, C. B. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c05836 · Cited by 4
“The idea is to construct a “scaffolding” of creation and annihilation operator strings, then the Hamiltonian terms by connecting these strings with appropriate local operators.”
Zhao, L., Goings, J. J., Aboumrad, W., Arrasmith, A., Calderín, L., Churchill, S., Gabay, D., Harvey-Brown, T., Hiles, M. L., Kaja, M., et al. (2026) · Physical Review Research · doi:10.1103/n1tf-8kr7 · Cited by 24
Quantum Computing in Healthcare: Exploring Mathematical Aspects, Algorithms and Applications
Singh, R., Nishad, D. K., Chaudhary, A., & Kumar, V. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10461-y · Cited by 1
Ejima, S., Seki, K., Fauseweh, B., & Yunoki, S. (2025) · Physical Review Research · doi:10.1103/2s2p-kvcx · Cited by 5
Chi, Y., Shi, H., Zheng, W., Cai, H., Zhang, Y., Tan, X., Li, S., Wang, J., Cui, J., Yung, M., et al. (2025) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-025-2779-x · Cited by 3
Self-citationHardware-efficient quantum annealing with error mitigation via classical shadow
Yoshida, T., Shingu, Y., Shimada, C., Nikuni, T., Hakoshima, H., & Matsuzaki, Y. (2026) · Physical Review A · doi:10.1103/stb4-wms8
Inference of Maximum Parsimony Phylogenetic Trees with Model‐Based Classical and Quantum Methods
Zhang, J., Chen, Y., Zhou, Y., & Huang, J.-H. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.202500695 · Cited by 4
Mitarai, H., Tadokoro, Y., & Tanaka, H. (2026) · Physical Review Applied · doi:10.1103/fmqf-w6ht · Cited by 5
Quantum circuit for non-unitary linear transformation of basis sets
Zhu, G., Bierman, J., Lu, J., & Li, Y. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01145-3 · Cited by 3
“…algorithms that could be applied to solve the many-body Schrödinger equation include, but not limited to, variational quantum algorithms (VQAs) 1 – 4 , quantum phase estimation (QPE) 5 – 8 , quantum simulation 9 , etc. — including fi rst-quantization schemes and more analog evolution methods —…”
Classical Algorithms for Measurement-Adaptive Gaussian Circuits
Oh, C., & Lim, Y. (2026) · PRX Quantum · doi:10.1103/rpl7-ylg8 · Cited by 9
“…k -local observables, for example, local Hamiltonian terms, correlation functions, witnesses, or other figures of merit used as quantum-advantage benchmarks, whose Hilbert-Schmidt norms grow at most polynomially with the system size (e.g., photonic variational quantum algorithms (VQAs) [55– 60]).”
Phase estimation with compressed controlled time evolution
Karacan, E. (2026) · Physical Review A · doi:10.1103/j26w-w48j · Cited by 3
“We set the target spectral norm error of the decomposition to ϵ D ≤ 10 − 5 , and observe that this corresponds to γ D ∈ [2 , 9] depending on the specific two-qubit unitary to control.”
On the Mitigability of Probabilistic Photonics CNOT Failures of Variational Quantum Classifiers
Hosam, M., Ahmed, M., Amer, N. E., Abuelfadl, T. M., & El-Mahdy, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00164 · Cited by 1
“Peruzzo et al. [4] have created the first variational eigen solver, based on the variational principle [9], using a linear photonics circuit.”
Fernandez, B. O., Bloot, R., & Moret, M. A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00215 · Cited by 1
“Quantum algorithms of the variational type, also known as Variational Quantum Algorithms (VQA’s), emerge as tools of possible use for solving such problems, which include study of molecules, general optimization, and machine learning (see, e.g., [1]–[4]).”
Analyzing Common Electronic Structure Theory Algorithms for Distributed Quantum Computing
Jones, G. M., & Jacobsen, H. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10351 · Cited by 2
“Alternatively, methods based on the variational principle, such as the variational quantum eigensolver (VQE) [9–12], have been proposed as a quantum-classical hybrid approach, capable of running on noisy, near-term quantum devices.”
Learning to Program Quantum Measurements for Machine Learning
Chen, S. Y.-C., Tseng, H.-H., Lin, H.-Y., & Yoo, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00200 · Cited by 5
“VQAs have demonstrated effectiveness in applications such as quantum chemistry [6] and combinatorial optimization [7].”
Comparing Performance of Variational Quantum Algorithm Simulations on HPC Systems
Pascale, M. D., Bauer, T. V., Gambo, Y. J., Vera, M. H., Huber, S., Mete, B., Jamadagni, A., Bentellis, A., Oliv, M., Iapichino, L., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10287 · Cited by 2
“In this work we made use of two algorithms: the Variational Quantum Eigensolver (VQE) [18], and the Quantum Approximate Optimization Algorithm (QAOA) [19] [20].”
An Adaptive Weighted Qite-Vqe Algorithm for Combinatorial Optimization Problems
Xie, N., Lee, X., Chen, T., Saito, Y., Asai, N., & Cail, D. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00032 · Cited by 1
“In this context, variational quantum eigensolver (VQE) [5] has emerged as a leading candidate for demonstrating quantum advantage due to its flexibility in quantum resources, allowing adjustable circuit depth.”
Qracle: A Graph-Neural-Network-Based Parameter Initializer for Variational Quantum Eigensolvers
Zhang, C., Jiang, L., & Chen, F. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00031 · Cited by 8
“The Variational Quantum Eigensolver (VQE) [1], [2] is one of the most prominent algorithms developed for noisy intermediate-scale quantum (NISQ) devices.”
Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive
Bentellis, A., Poggel, B., & Lorenz, J. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00207 · Cited by 2
“In the case of the variational quantum eigensolver [6], the cost function of the optimization is given by some Hamiltonian whose expectation value in the state produced by the ansatz is estimated with the aid of a quantum computer.”
Quantum imaginary-time evolution with polynomial resources in evolution time
Zhang, L., Lai, J., Wu, X., & Wang, X. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae7b7f · Cited by 6
“Normalization is standard in quantum algorithms [34, 37–39] for Hamiltonian-related problems.”
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.