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 801–900 of 4,572
Quantum autoencoders with enhanced data encoding
Bravo-Prieto, C. (2021) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac0616 · Cited by 90
Variational Quantum Eigensolvers for Sparse Hamiltonians
Kirby, W. M., & Love, P. J. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.110503 · Cited by 60
“A VQE algorithm comprises two main components: a quantum subroutine for estimating the expectation value of a Hamiltonian of interest for some parametrized ansatz state, and a classical outer loop that updates the parameters of the ansatz in order to minimize the expected energy [1].”
MethodInfluentialSelf-citationVariational Learning for Quantum Artificial Neural Networks
Tacchino, F., Mangini, S., Barkoutsos, P. K., Macchiavello, C., Gerace, D., Tavernelli, I., & Bajoni, D. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3062494 · Cited by 67
“Inspired by the well-known variational quantum eigensolver (VQE) algorithm [40], and in line with a recently introduced unsampling protocol [41], we define the following optimization problem: given access to independent copies of | ψ w (cid:4) and to a variational quantum circuit, characterized by…”
MethodKottmann, J. S., & Aspuru‐Guzik, A. (2022) · Physical Review A · doi:10.1103/physreva.105.032449 · Cited by 57
Self-citationA quantum alternating operator ansatz with hard and soft constraints for lattice protein foldingPreprint
Fingerhuth, M., Babej, T., & Ing, C. E. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.13411 · Cited by 107
“The two cornerstones of variational algorithms are the quantum approximate optimization algorithm by Farhi et al. [11] and the variational quantum eigensolver by Peruzzo et al. [30].”
MethodThe Inductive Bias of Quantum KernelsPreprint
Kübler, J. M., Buchholz, S., & Schölkopf, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.03747 · Cited by 127
“Besides fundamental demonstrations [2], potential applications that have been discussed are in quantum chemistry [3], discrete optimization [4] and machine learning (ML) [5–12].”
BackgroundSimulating the Electronic Structure of Spin Defects on Quantum Computers
Huang, B., Govoni, M., & Galli, G. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010339 · Cited by 54
Resource-efficient high-dimensional subspace teleportation with a quantum autoencoder
Zhang, H., Wan, L., Haug, T., Mok, W., Paesani, S., Shi, Y., Cai, H. N., Chin, L. K., Karim, M. F., Xiao, L., et al. (2022) · Science Advances · doi:10.1126/sciadv.abn9783 · Cited by 51
“, variational quantum eigensolvers (59), where optimization is carried out by a classical optimizer and the cost function is evaluated on a parametrized quantum circuit and hybrid quantum computers (60, 61).”
BackgroundObservation of Wave-Packet Branching through an Engineered Conical Intersection
Wang, C. S., Frattini, N., Chapman, B. J., Puri, S., Girvin, S. M., Devoret, M., & Schoelkopf, R. J. (2023) · Physical Review X · doi:10.1103/physrevx.13.011008 · Cited by 61
Ab initio quantum simulation of strongly correlated materials with quantum embedding
Cao, C., Sun, J., Yuan, X., Hu, H., Pham, H. Q., & Lv, D. (2023) · npj Computational Materials · doi:10.1038/s41524-023-01045-0 · Cited by 55
Post-quantum distributed ledger technology: a systematic survey
Parida, N. K., Jatoth, C., Reddy, V. D., Hussain, M. M., & Faizi, J. (2023) · Scientific Reports · doi:10.1038/s41598-023-47331-1 · Cited by 68
Ultracompact and multifunctional integrated photonic platform
Du, Z., Liao, K., Dai, T., Wang, Y., Gao, J., Huang, H., Qi, H., Li, Y., Wang, X., Su, X., et al. (2024) · Science Advances · doi:10.1126/sciadv.adm7569 · Cited by 49
“…mixing ( 13 , 14 ), quantum simulations [Boson sampling; ( 15 – 18 )], quantum transport simulation ( 19 , 20 ), quantum walk simulation ( 21 – 23 ), molecular simulation ( 24 – 27 ), quantum gates ( 28 – 31 ), quantum information processing ( 32 – 35 ), optical neural networks ( 36 – 40 ), etc.”
Quantum Deep Reinforcement Learning for Robot Navigation Tasks
Hohenfeld, H., Heimann, D., Wiebe, F., & Kirchner, F. (2024) · IEEE Access · doi:10.1109/access.2024.3417808 · Cited by 88
“First introduced in the context of variational quantum eigensolvers [61], they became a major research area in quantum machine learning [59].”
BackgroundARQUIN: Architectures for Multinode Superconducting Quantum Computers
Ang, J., Carini, G. A., Chen, Y., Chuang, I. L., Demarco, M., Economou, S. E., Eickbusch, A., Faraon, A., Fu, K. C., Girvin, S. M., et al. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3674151 · Cited by 124
Bao, S. L., Kleer, S., Wang, R., & Rahmani, A. (2018) · Physical Review A · doi:10.1103/physreva.97.062343 · Cited by 45
Variational quantum algorithms for dimensionality reduction and classification
Liang, J., Shen, S., Li, M., & Li, L. (2020) · Physical Review A · doi:10.1103/physreva.101.032323 · Cited by 48
Gutzwiller hybrid quantum-classical computing approach for correlated materials
Yao, Y., Zhang, F., Wang, C.-Z., Ho, K.-M., & Orth, P. P. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013184 · Cited by 56
“To find the ground state energy and single-particle density matrix, we use VQE with an unitary coupled-cluster ansatz [6].”
BackgroundMethodHybrid Quantum-Classical Neural Network for Calculating Ground State Energies of Molecules
Xia, R., & Kais, S. (2020) · Entropy · doi:10.3390/e22080828 · Cited by 55
“A parameterized quantum circuit, also known as a variational quantum circuit [10,28], is a quantum circuit consisting of parameterized gates with fixed depth.”
BackgroundMicrocanonical and finite-temperature ab initio molecular dynamics simulations on quantum computers
Sokolov, I. O., Barkoutsos, P. K., Moeller, L., Suchsland, P., Mazzola, G., & Tavernelli, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013125 · Cited by 56
Quantum-Enhanced Grid of the Future: A Primer
Eskandarpour, R., Ghosh, K., Khodaei, A., Paaso, E. A., & Zhang, L. (2020) · IEEE Access · doi:10.1109/access.2020.3031595 · Cited by 56
“More recent types of quantum algorithms that are gaining attention for eigenvalue calculations and solving systems of linear equations are the Variational Quantum Eigensolver (VQE) [26] and Variational Quantum Linear Solver (VQLS) [27].”
Natural evolutionary strategies for variational quantum computation
Anand, A., Degroote, M., & Aspuru-Guzik, A. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/abf3ac · Cited by 40
Self-citationQuantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials
Sajjan, M., Sureshbabu, S. H., & Kais, S. (2021) · Journal of the American Chemical Society · doi:10.1021/jacs.1c06246 · Cited by 52
A proposal for using molecular spin qudits as quantum simulators of light–matter interactions
Tacchino, F., Chiesa, A., Sessoli, R., Tavernelli, I., & Carretta, S. (2021) · Journal of Materials Chemistry C · doi:10.1039/d1tc00851j · Cited by 50
Multi-class quantum classifiers with tensor network circuits for quantum phase recognition
Lazzarin, M., Galli, D. E., & Prati, E. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128056 · Cited by 47
Hybrid Programming for Near-Term Quantum Computing Systems
McCaskey, A., Dumitrescu, E., Lyakh, D. I., & Humble, T. S. (2018) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2018.8638598 · Cited by 63
“As described in the subsequent sections, many current demonstrations of hybrid variational quantum algorithms employ repeated program executions [15]–[18].”
BackgroundQDataSet, quantum datasets for machine learning
Perrier, E., Youssry, A., & Ferrie, C. (2022) · Scientific Data · doi:10.1038/s41597-022-01639-1 · Cited by 77
Streif, M., Yarkoni, S., Skolik, A., Neukart, F., & Leib, M. (2021) · Physical Review A · doi:10.1103/physreva.104.012403 · Cited by 41
Quantum computing in pharma: A multilayer embedding approach for near future applications
Izsák, R., Riplinger, C., Blunt, N. S., de Souza, B., Holzmann, N., Crawford, O., Camps, J., Neese, F., & Schöpf, P. (2022) · Journal of Computational Chemistry · doi:10.1002/jcc.26958 · Cited by 50
Quantum machine-learning phase prediction of high-entropy alloys
Brown, P., & Zhuang, H. L. (2023) · Materials Today · doi:10.1016/j.mattod.2023.02.014 · Cited by 44
The Quantum-Medical Nexus: Understanding the Impact of Quantum Technologies on Healthcare
Shams, M., Choudhari, J., Reyes, K., Prentzas, S., Gapizov, A., Shehryar, A., Affaf, M., Grezenko, H., Gasim, R. W., Mohsin, S. N., et al. (2023) · Cureus · doi:10.7759/cureus.48077 · Cited by 65
State Preparation on Quantum Computers via Quantum Steering
Volya, D., & Mishra, P. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3358193 · Cited by 56
Sack, S. H., & Egger, D. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013223 · Cited by 40
“For variational algorithms, like the variational eigen-solver applied in a chemistry setting [71, 72], error mitigating expectation values are often sufficient, e.g., to compute the energy spectrum of molecules [73, 74].”
MethodAbsence of Barren Plateaus in Finite Local-Depth Circuits with Long-Range Entanglement
Zhang, H.-K., Liu, S., & Zhang, S. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.150603 · Cited by 67
“One of the representatives is the variational quantum eigen-solver (VQE) [11–17], which trains a parameterized quantum circuit (PQC) using a classical optimizer to minimize the energy.”
BackgroundA Microarchitecture for a Superconducting Quantum Processor
Fu, X., Rol, M. A., Bultink, C. C., van Someren, J., Khammassi, N., Ashraf, I., Vermeulen, R. F. L., de Sterke, J. C., Vlothuizen, W., Schouten, R. N., et al. (2018) · IEEE Micro · doi:10.1109/mm.2018.032271060 · Cited by 37
“Some quantum algorithms for near-term devices ask for quantum-classical mixed computation, such as a variational eigenvalue solver [5].”
BackgroundHong–Ou–Mandel interference between independent III–V on silicon waveguide integrated lasers
Agnesi, C., Da Lio, B., Cozzolino, D., Cardi, L., Ben Bakir, B., Hassan, K., Della Frera, A., Ruggeri, A., Giudice, A., Vallone, G., et al. (2019) · Optics Letters · doi:10.1364/ol.44.000271 · Cited by 42
Learning nonlinear input–output maps with dissipative quantum systems
Chen, J., & Nurdin, H. I. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2311-9 · Cited by 55
Construction of Green's functions on a quantum computer: Quasiparticle spectra of molecules
Kosugi, T., & Matsushita, Y. (2020) · Physical Review A · doi:10.1103/physreva.101.012330 · Cited by 59
Quantum simulations of excited states with active-space downfolded Hamiltonians
Bauman, N. P., Low, G. H., & Kowalski, K. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5128103 · Cited by 49
Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer
Yen, T.-C., Lang, R. A., & Izmaylov, A. F. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5110682 · Cited by 40
Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
Tranter, A., Love, P., Mintert, F., Wiebe, N., & Coveney, P. V. (2019) · UCL Discovery (University College London) · Cited by 39
Self-citationQuantum Approximate Optimization Algorithm Based Maximum Likelihood Detection
Cui, J., Xiong, Y., Ng, S. X., & Hanzo, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3185287 · Cited by 56
“A family of hybrid quantum-classical algorithms, namely variational quantum eigensolvers (VQE), was developed in [17], which was implemented by combining a reconfigurable quantum device with a classical computer.”
MethodThe impact of hardware specifications on reaching quantum advantage in the fault tolerant regime
Webber, M., Elfving, V., Weidt, S., & Hensinger, W. K. (2022) · AVS Quantum Science · doi:10.1116/5.0073075 · Cited by 40
“Unlike the Variational Quantum Eigensolver (VQE) [35] which involves many iterations ( O (1 / 2 ) with accuracy (cid:15) ) of low depth circuits, the QPE algorithm requires O (1) iterations of a circuit with a depth scaling as O (1 /(cid:15) ).”
MethodLocalized Quantum Chemistry on Quantum Computers
Otten, M., Hermes, M. R., Pandharkar, R., Alexeev, Y., Gray, S. K., & Gagliardi, L. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00388 · Cited by 56
Solving hadron structures using the basis light-front quantization approach on quantum computers
Qian, W., Basili, R., Pal, S., Luecke, G. R., & Vary, J. P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043193 · Cited by 55
A Variational Quantum Algorithm for Preparing Quantum Gibbs States
Chowdhury, A. C. N., Low, G. H., & Wiebe, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.00055 · Cited by 40
“Our work builds upon and generalizes the variational quantum eigensolver (VQE) 18 , which has emerged as a popular approach for quantum simulation particularly on near-term devices 19–21 .”
BackgroundQASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and SimulationPreprint
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13018 · Cited by 46
The Useful Quantum Computing Techniques for Artificial Intelligence Engineers
Choi, J., Oh, S., & Kim, J. (2020) · 2020 International Conference on Information Networking (ICOIN) · doi:10.1109/icoin48656.2020.9016555 · Cited by 39
“Actually, VQE is used to find the energy state of the molecule and applied to various quantum simulation systems [2], [12], [13].”
MethodClassically Optimal Variational Quantum Algorithms
Wurtz, J., & Love, P. J. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3122568 · Cited by 60
Self-citationQuantum Phase Recognition via Quantum Kernel Methods
Wu, Y., Wu, B., Wang, J. B., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-04-17-981 · Cited by 74
“For a general family of Hamiltonian H(a), the explicitly mathematical expression of its ground state is hard to be characterized, and variational quantum circuit is a natural expression which characterizes the circuit complexity of these concerned ground states, but not change their properties [39, 44, 43, 45].”
BackgroundMethodQuantum computing for chemistry and physics applications from a Monte Carlo perspective
Mazzola, G. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0173591 · Cited by 64
“48,50,51 The N par variational parameters can be the angles θ ’s of rotation gates defined above.”
BackgroundGeneralized quantum assisted simulator
Haug, T., & Bharti, K. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac83e7 · Cited by 38
“Theleadingcanonical NISQ era algorithm for approximating the ground state and ground state energy of a Hamiltonian is variational quantum eigensolver (VQE) [5–12].”
Quantitative robustness analysis of quantum programs
S-H, H., Hietala, K., Zhu, S., Ying, M., Hicks, M., & Wu, X. (2019) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 39
Kowalski, K. (2021) · Physical Review A · doi:10.1103/physreva.104.032804 · Cited by 40
Variational quantum algorithm for molecular geometry optimization
Delgado, A., Arrazola, J. M., Jahangiri, S., Niu, Z., Izaac, J., Roberts, C., & Killoran, N. (2021) · Physical Review A · doi:10.1103/physreva.104.052402 · Cited by 65
Lattice renormalization of quantum simulations
Carena, M. S., Lamm, H., Li, Y.-Y., & Liu, W. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.094519 · Cited by 63
Progress toward favorable landscapes in quantum combinatorial optimization
Lee, J., Magann, A. B., RABITZ, H. A., & Arenz, C. (2021) · Physical Review A · doi:10.1103/physreva.104.032401 · Cited by 55
Large-Scale Quantum Approximate Optimization via Divide-and-Conquer
Li, J., Alam, M., & Ghosh, S. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3212196 · Cited by 73
“QUANTUM Computing (QC) can offer unique advantages over classical computing in many important areas, such as machine learning and optimization [1], [2], [3].”
BackgroundSymmetry enhanced variational quantum spin eigensolver
Lyu, C., Xu, X., Yung, M., & Bayat, A. (2023) · Quantum · doi:10.22331/q-2023-01-19-899 · Cited by 60
Self-citationMachine learning \& artificial intelligence in the quantum domainPreprint
Dunjko, V., & Briegel, H. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02779 · Cited by 54
Exploiting Symmetry Reduces the Cost of Training QAOA
Shaydulin, R., & Wild, S. M. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3066275 · Cited by 39
“An interesting future direction is exploring the applications of such generalizations to reducing the resource requirements of the variational quantum eigensolver [34].”
BackgroundThe Dilemma of Quantum Neural Networks
Yang, Q., Wang, X., Du, Y., Wu, X., & Tao, D. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3208313 · Cited by 73
“…experimental studies have implemented QNNs on different NISQ platforms to accomplish various learning tasks such as data classification [24], [29], [30], image generation [31], [32], [33], and electronic-structure problems in material science and condensed matter physics [34], [35], [36], [37].”
BackgroundMitigating barren plateaus with transfer-learning-inspired parameter initializations
Liu, H., Sun, T.-P., Wu, Y.-C., Han, Y., & Guo, G. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acb58e · Cited by 73
Future Potential of Quantum Computing and Simulations in Biological Science
Pal, S., Bhattacharya, M., Dash, S., Lee, S., & Chakraborty, C. (2023) · Molecular Biotechnology · doi:10.1007/s12033-023-00863-3 · Cited by 51
“AQC has previously been used to replicate the behavior of tiny molecules [95].”
Recent progress in the JARVIS infrastructure for next-generation data-driven materials design
Wines, D., Gurunathan, R. L., Garrity, K. F., DeCost, B., Biacchi, A. J., Tavazza, F., & Choudhary, K. K. (2023) · Applied Physics Reviews · doi:10.1063/5.0159299 · Cited by 46
Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer
Davoudi, Z., Hsieh, C.-C., & Kadam, S. V. (2024) · Quantum · doi:10.22331/q-2024-11-11-1520 · Cited by 103
“Here, quantum computers replace classical computers to compute the spectra, e.g., using hybrid classical-quantum schemes such as variational methods [104–106], see e.g., Ref.”
MethodThe effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices
Pellow-Jarman, A., McFarthing, S., Sinayskiy, I., Park, D. K., Pillay, A. W., & Petruccione, F. (2024) · Scientific Reports · doi:10.1038/s41598-024-66625-6 · Cited by 65
“Figures 9a–c show the probabilities of sampling the correct solution for the minimum vertex cover problem on graphs 4, 5 and 6, for the noise and state vector simulation respectively.”
BackgroundFeedback-Driven Quantum Reservoir Computing for Time-Series Analysis
Kobayashi, K., Fujii, K., & Yamamoto, N. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040325 · Cited by 99
“In VQAs, parameters for quantum variational circuits are iteratively trained based on feedback of a cost function calculated from measurement outcomes.”
ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction
Nakagawa, Y. O., Kamoshita, M., Mizukami, W., Sudo, S., & Ohnishi, Y. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00846 · Cited by 88
Quantum computing methods for electronic states of the water molecule
Bian, T., Murphy, D., Xia, R., Daskin, A., & Kais, S. (2019) · Molecular Physics · doi:10.1080/00268976.2019.1580392 · Cited by 54
“[19] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L Obrien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications 5, 4213 (2014).”
BackgroundMethodCalculation of Molecular Vibrational Spectra on a Quantum Annealer
Teplukhin, A., Kendrick, B. K., & Babikov, D. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00402 · Cited by 38
“Thus, we are dealing with two Hamiltonians: the initial problem Hamiltonian H and the fi nal QUBO Hamiltonian F Q .”
MethodInfluentialSpin-projection for quantum computation: A low-depth approach to strong correlation
Tsuchimochi, T., Mori, Y., & Ten‐no, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043142 · Cited by 39
Application-motivated, holistic benchmarking of a full quantum computing stack
Mills, D., Sivarajah, S., Scholten, T. L., & Duncan, R. (2021) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 40
Density Matrix Quantum Circuit Simulation via the BSP Machine on Modern GPU Clusters
Li, A., Subasi, O., Yang, X., & Krishnamoorthy, S. (2020) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41405.2020.00017 · Cited by 63
“However, practical quantum algorithms like variational algorithm [69] demand ultra-deep circuits with millions of gates (1014 [73], 1018 gates [65]).”
BackgroundImaginary-time propagation on a quantum chip
Turro, F., Roggero, A., Amitrano, V., Luchi, P., Wendt, K., DuBois, J. L., Quaglioni, S., & Pederiva, F. (2022) · Physical Review A · doi:10.1103/physreva.105.022440 · Cited by 47
Quantum self-supervised learning
Jaderberg, B., Anderson, L. W., Xie, W., Albanie, S., Kiffner, M., & Jaksch, D. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac6825 · Cited by 59
“While VQAs have been used to solve many types of optimisation problems [21–25], it is their application to supervised learning [26–28], unsupervised learning [29], generative models [30, 31] and reinforcement learning [32–34] which has led to them being referred to as quantum neural networks (QNNs)…”
MethodKoridon, E., Yalouz, S., Senjean, B., Buda, F., O’Brien, T. E., & Visscher, L. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033127 · Cited by 50
Multicomponent Unitary Coupled Cluster and Equation-of-Motion for Quantum Computation
Pavošević, F., & Hammes‐Schiffer, S. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00220 · Cited by 38
Extending C++ for Heterogeneous Quantum-Classical Computing
McCaskey, A., Nguyen, T., SANTANA, A., Claudino, D., Kharazi, T., & Finkel, H. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3462670 · Cited by 62
“We demonstrate how this library enables the integration of the VQE [39] and ADAPT [18] algorithms within existing C++ applications.”
BackgroundMethodInfluentialPractical distributed quantum information processing with LOCCNet
Zhao, X., Zhao, B., Wang, Z., Song, Z., & Wang, X. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00496-x · Cited by 57
“Previously, PQCs have been adapted to many research areas including quantum simulation [49], quantum optimization [1], and quantum error correction [50].”
MethodA Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
Rattew, A. G., Hu, S., Pistoia, M., Chen, R., & Wood, S. (2019) · arXiv · doi:10.48550/arxiv.1910.09694 · Cited by 59
“substantially reduced circuit depth at the cost of increasing the required number of circuit executions [26].”
BackgroundGeneralized Quantum Assisted Simulator
Haug, T., & Bharti, K. (2020) · arXiv · doi:10.48550/arxiv.2011.14737 · Cited by 38
Robust Implementation of Generative Modeling with Parametrized Quantum Circuits
Leyton-Ortega, V., Perdomo-Ortiz, A., & Perdomo, O. (2019) · arXiv · doi:10.48550/arxiv.1901.08047 · Cited by 38
Teaching quantum computing with an interactive textbook
Wootton, J. R., Harkins, F., Bronn, N. T., Vazquez, A. C., Phan, A., & Asfaw, A. T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00058 · Cited by 42
Yang, B., Raymond, R., & Uno, S. (2022) · Physical Review A · doi:10.1103/physreva.106.012423 · Cited by 66
“These error mitigation techniques are often combined with near-term quantum algorithms [23, 24].”
Quantum simulation of thermodynamics in an integrated quantum photonic processor
Somhorst, F. H. B., van der Meer, R., Anguita, M. C., Schadow, R., Snijders, H., de Goede, M., Kassenberg, B., Venderbosch, P., Taballione, C., Epping, J. P., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-38413-9 · Cited by 61
Mohanty, N., Behera, B. K., & Ferrie, C. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3303989 · Cited by 52
“Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical technique used to determine the eigenvalue of a large matrix or Hamiltonian H [33].”
MethodA Vision for the Future of Multiscale Modeling
Capone, M., Romanelli, M., Castaldo, D., Parolin, G., Bello, A., Gil, G., & Vanzan, M. (2024) · ACS Physical Chemistry Au · doi:10.1021/acsphyschemau.3c00080 · Cited by 46
Simulating Chemistry on Bosonic Quantum Devices
Dutta, R., Cabral, D. G. A., Lyu, N., Vu, N. P., Wang, Y., Allen, B., Dan, X., Cortiñas, R. G., Khazaei, P., Schäfer, M., et al. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00544 · Cited by 59
Fault-tolerant protection of near-term trapped-ion topological qubits under realistic noise sources
Bermúdez, A., Xu, X., Gutiérrez, M., Benjamin, S. C., & Müller, M. (2019) · Physical Review A · doi:10.1103/physreva.100.062307 · Cited by 44
An artificial spiking quantum neuron
Kristensen, L. B., Degroote, M., Wittek, P., Aspuru‐Guzik, A., & Zinner, N. T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00381-7 · Cited by 55
Self-citationOptical computation of a spin glass dynamics with tunable complexity
Leonetti, M., Hörmann, E., Leuzzi, L., Giorgio Parisi, A., & Ruocco, G. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2015207118 · Cited by 41
“Optical computation is an emerging scheme in quantum transport (1), quantum simulation (2), and machine learning (3), and can be implemented on different platforms including free space, photonic chips (4), and optical fibers (5).”
BackgroundA Variational Algorithm for Quantum Neural Networks
Macaluso, A., Clissa, L., Lodi, S., & Sartori, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50433-5_45 · Cited by 58
Electronic structure with direct diagonalization on a D-wave quantum annealer
Teplukhin, A., Kendrick, B. K., Tretiak, S., & Dub, P. A. (2020) · Scientific Reports · doi:10.1038/s41598-020-77315-4 · Cited by 51
Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing
Parekh, R., Ricciardi, A., Darwish, A., & DiAdamo, S. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00005 · Cited by 73
“Consequently, the Variational Quantum Eigensolver [30] (VQE) was proposed as a low-depth alternative, using a hybrid model containing classical optimization and quantum computing.”
BackgroundOptimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks
Chen, Y., Chen, Y., Lee, C., Zhang, S., & Hsieh, C. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00446-y · Cited by 57
“[30] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nat.”
BackgroundFast quantum algorithm for protein structure prediction in hydrophobic-hydrophilic model
Wong, R., & Chang, W.-L. (2022) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2022.03.011 · Cited by 44
Long-time simulations for fixed input states on quantum hardware
Gibbs, J., Gili, K., Holmes, Z., Commeau, B., Arrasmith, A., Cincio, Ł., Coles, P. J., & Sornborger, A. T. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00625-0 · Cited by 100
“Subsequently, a generalization of the variational quantum eigensolver 10 was developed for simulations in low lying energy subspaces 20 .”
MethodOn the Co-Design of Quantum Software and Hardware
Li, G., Wu, A., Shi, Y., Javadi-Abhari, A., Ding, Y., & Xie, Y. (2021) · Proceedings of the Eight Annual ACM International Conference on Nanoscale Computing and Communication · doi:10.1145/3477206.3477464 · Cited by 37
“Variational Quantum Eigensolver (VQE) [24] is the leading quantum algorithm with modest resource requirement and some noise-resilience.”
BackgroundMethodOptimized Quantum Phase Estimation for Simulating Electronic States in Various Energy Regimes
Kang, C., Bauman, N. P., Krishnamoorthy, S., & Kowalski, K. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00577 · Cited by 48
Urgelles, H., Picazo-Martínez, P., García‐Roger, D., & Monserrat, J. F. (2022) · Sensors · doi:10.3390/s22197570 · Cited by 44
“VQE was introduced in 2014 [17] for chemistry applications and quantum mechanics to estimate the ground state energy of a molecule using shallow depth circuits.”
Background
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.