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 601–700 of 4,572
Quantum codes for quantum simulation of fermions on a square lattice of qubits
Steudtner, M., & Wehner, S. (2019) · Physical Review A · doi:10.1103/physreva.99.022308 · Cited by 69
“[10] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien.”
BackgroundMethodBuilding quantum neural networks based on a swap test
Zhao, J., Zhang, Y.-H., Shao, C.-P., Wu, Y.-C., Guo, G.-C., & Guo, G.-P. (2019) · Physical Review A · doi:10.1103/physreva.100.012334 · Cited by 60
Smart, S. E., & Mazziotti, D. A. (2019) · Physical Review A · doi:10.1103/physreva.100.022517 · Cited by 59
Simulating Many-Body Systems with a Projective Quantum Eigensolver
Stair, N. H., & Evangelista, F. A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030301 · Cited by 60
Lipkin model on a quantum computer
Cervia, M. J., Balantekin, A. B., Coppersmith, S. N., Johnson, C. W., Love, P. J., Poole, C., Robbins, K., & Saffman, M. E. (2021) · Physical Review C · doi:10.1103/physrevc.104.024305 · Cited by 71
Self-citationQuantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 67
Deep-Neural-Network Discrimination of Multiplexed Superconducting-Qubit States
Lienhard, B., Vepsäläinen, A. P., Govia, L. C. G., Hoffer, C. R., Qiu, J. Y., Ristè, D., Ware, M., Kim, D. K., Winik, R., Melville, A. J., et al. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014024 · Cited by 84
Simulating two-dimensional lattice gauge theories on a qudit quantum computer
Meth, M., Zhang, J., Haase, J. F., Edmunds, C., Postler, L., Jena, A., Steiner, A., Dellantonio, L., Blatt, R., Zoller, P., et al. (2025) · Nature Physics · doi:10.1038/s41567-025-02797-w · Cited by 180
Measurement error mitigation in quantum computers through classical bit-flip correction
Funcke, L., Hartung, T., Jansen, K., Kühn, S., Stornati, P., & Wang, X. (2022) · Physical Review A · doi:10.1103/physreva.105.062404 · Cited by 111
“In the context of quantum many-body systems, a promising approach for exploiting the power of NISQ devices is variational quantum simulation (VQS), a class of hybrid quantum-classical algorithms for solving optimization problems [3, 4].”
MethodGao, Q., Jones, G. O., Motta, M., Sugawara, M., Watanabe, H. C., Kobayashi, T., Watanabe, E., Ohnishi, Y., Nakamura, H., & Yamamoto, N. (2021) · npj Computational Materials · doi:10.1038/s41524-021-00540-6 · Cited by 67
“C1ðθÞ 1⁄4 EðθÞ þ β0jhΨðθÞjΨ0ij(2) ; (4)”
Non-Abelian Floquet Spin Liquids in a Digital Rydberg Simulator
Kalinowski, M., Maskara, N., & Lukin, M. D. (2023) · Physical Review X · doi:10.1103/physrevx.13.031008 · Cited by 91
A semi-agnostic ansatz with variable structure for variational quantum algorithms
Bilkis, M., Cerezo, M., Verdon, G., Coles, P. J., & Cincio, L. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00132-1 · Cited by 58
“Variational quantum algorithms (VQAs) [2–4] train such circuits to minimize a cost function and consequently accomplish a task of interest.”
Naik, A. S., Yeniaras, E., Hellstern, G., Prasad, G., & Vishwakarma, S. (2025) · Financial Innovation · doi:10.1186/s40854-025-00751-6 · Cited by 106
Neural Error Mitigation of Near-Term Quantum Simulations
Bennewitz, E. R., Hopfmueller, F., Kulchytskyy, B., Carrasquilla, J., & Ronagh, P. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00509-0 · Cited by 93
“A prominent example is the variational quantum eigensolver (VQE) [12], a hybrid quantum–classical algorithm that iteratively approximates the lowest-energy eigenvalues of a target Hamiltonian through the variational optimization of a family of parameterized quantum circuits.”
BackgroundQuantum Embedding Method for the Simulation of Strongly Correlated Systems on Quantum Computers
Rossmannek, M., Pavošević, F., Rubio, Á., & Tavernelli, I. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c00330 · Cited by 83
TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze
Anastasiou, P. G., Chen, Y., Mayhall, N. J., Barnes, E., & Economou, S. E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013254 · Cited by 117
Quantum machine learning algorithms for anomaly detection: A review
Corli, S., Moro, L., Dragoni, D., Dispenza, M., & Prati, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107632 · Cited by 105
Variational learning of Grover's quantum search algorithm
Morales, M. E. S., Tlyachev, T., & Biamonte, J. (2018) · Physical Review A · doi:10.1103/physreva.98.062333 · Cited by 57
Reconfigurable Photonics on a Glass Chip
Dyakonov, I. V., Pogorelov, I., Bobrov, I. B., Kalinkin, A. A., Straupe, S. S., Kulik, S. P., Dyakonov, P. V., & Evlashin, S. A. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.044048 · Cited by 62
Multilevel Combinatorial Optimization across Quantum Architectures
Ushijima-Mwesigwa, H., Shaydulin, R., Negre, C. F. A., Mniszewski, S. M., Alexeev, Y., & Safro, I. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3425607 · Cited by 57
“he state: |ψ(β,γ)⟩= e−iβ pH M e−iγ H C ...e−iβ 1H M e−iγ 1H C |+⟩⊗n =U(β,γ)|+⟩⊗n . (9) An alternative implementation was proposed, inspired by the success of the Variational Quantum Eigensolver (VQE) [71, 104]. A variational implementation of QAOA combines an ansatz U(β,γ)(that can be different from the alternating op…”
MethodEvent Classification with Quantum Machine Learning in High-Energy Physics
Terashi, K., Kaneda, M., Kishimoto, T., Saito, M., Sawada, R., & Tanaka, J. (2021) · Computing and Software for Big Science · doi:10.1007/s41781-020-00047-7 · Cited by 72
Solving quantum statistical mechanics with variational autoregressive networks and quantum circuits
Liu, J.-G., Mao, L., Zhang, P., & Wang, L. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/aba19d · Cited by 57
Adaptive pruning-based optimization of parameterized quantum circuits
Sim, S., Romero, J., Gonthier, J. F., & Kunitsa, A. A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe107 · Cited by 56
Quantum circuit cutting with maximum-likelihood tomography
Perlin, M. A., Saleem, Z. H., Suchara, M., & Osborn, J. C. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00390-6 · Cited by 92
Feniou, C., Hassan, M., Traoré, D., Giner, E., Maday, Y., & Piquemal, J. (2023) · Communications Physics · doi:10.1038/s42005-023-01312-y · Cited by 100
“Indeed, implementing the tUCCSD algorithm on quantum architectures through the JordanWigner mapping (4) requires O(N(3)n(2)) quantum gates(7) (recall that N is the number of spin-orbitals being considered and n is the number of electrons in the system so that if N is proportional to n, then the number of quantum gates…”
BackgroundMethodInfluentialPartial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
Gokhale, P., Ding, Y.-S., Propson, T., Winkler, C., Leung, N., Shi, Y., Schuster, D., Hoffmann, H., & Chong, F. (2019) · Micro · doi:10.1145/3352460.3358313 · Cited by 90
“particular, variational algorithms have innate error resilience, due to the hybrid alternation with a noise-robust classical optimizer [32, 41].”
BackgroundClassical algorithms for quantum mean values
Bravyi, S., Gosset, D., & Movassagh, R. (2021) · Nature Physics · doi:10.1038/s41567-020-01109-8 · Cited by 56
Heisenberg-Limited Noisy Atomic Clock Using a Hybrid Coherent and Squeezed State Protocol
Pezzè, L., & Smerzi, A. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.210503 · Cited by 68
Efficient Encoding of the Weighted MAX $$k$$-CUT on a Quantum Computer Using QAOA
Fuchs, F. G., Kolden, H. Ø., Aase, N. H., & Sartor, G. (2021) · SN Computer Science · doi:10.1007/s42979-020-00437-z · Cited by 56
Quantum Variational Learning of the Entanglement Hamiltonian
Kokail, C., Sundar, B., Zache, T. V., Elben, A., Vermersch, B., Dalmonte, M., van Bijnen, R., & Zoller, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.170501 · Cited by 79
Subspace variational quantum simulator
Heya, K., Nakanishi, K. M., Mitarai, K., Yan, Z., Zuo, K., Suzuki, Y., Sugiyama, T., Tamate, S., Tabuchi, Y., Fujii, K., et al. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023078 · Cited by 56
“These algorithms, such as variational quantum eigen-solvers [21–24], generally do not guarantee the accuracy of solutions but can be feasibly implemented on NISQ devices.”
Subspace Variational Quantum Simulator
Heya, K., Nakanishi, K. M., Mitarai, K., Yan, Z., Zuo, K., Suzuki, Y., Sugiyama, T., Tamate, S., Tabuchi, Y., Fujii, K., et al. (2019) · arXiv · doi:10.48550/arxiv.1904.08566 · Cited by 56
Sugisaki, K., Yamamoto, S., Nakazawa, S., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2016) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.6b04932 · Cited by 55
Veis, L., Višňák, J., Nishizawa, H., Nakai, H., & Pittner, J. (2016) · International Journal of Quantum Chemistry · doi:10.1002/qua.25176 · Cited by 55
Recent Advances in Quantum Computing for Drug Discovery and Development
Wang, P.-H., Chen, J.-H., Yang, Y.-Y., Lee, C., & Tseng, Y. J. (2023) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2023.3249499 · Cited by 58
“…configuration interaction (Fci), which considers all the sys-tem's electrons, still requires exponential resources [20] in classical computing. vQe [21] is a variational method that varies the state vector ansatz to obtain the minimum eigenvalue of a given Hamiltonian. its hybrid nature, iterative…”
MethodSymmetry-Assisted Preparation of Entangled Many-Body States on a Quantum Computer
Lacroix, D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.230502 · Cited by 70
Dimensional Expressivity Analysis of Parametric Quantum Circuits
Funcke, L., Hartung, T., Jansen, K., Kühn, S., & Stornati, P. (2021) · Quantum · doi:10.22331/q-2021-03-29-422 · Cited by 104
“ormed on a classical computer in a feedback loop based on the measurement outcome obtained from the quantum device. VQS has been successfully applied to quantum many-body systems in quantum chemistry [9,13,15,16] and even quantum mechanics and quantum eld theory [17{21]. The design of the parametrized quantum circuit…”
BackgroundMethodVariational Quantum-Neural Hybrid Eigensolver
Zhang, S., Wan, Z., Lee, C., Hsieh, C., Zhang, S., & Yao, H. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120502 · Cited by 77
Error mitigation for variational quantum algorithms through mid-circuit measurements
Botelho, L., Glos, A., Kundu, A., Miszczak, J. A., Salehi, Ö., & Zimborás, Z. (2022) · Physical Review A · doi:10.1103/physreva.105.022441 · Cited by 79
“Variational Quantum Eigensolver (VQE) [5] and Quantum Approximate Optimization Algorithms (QAOAs) [6] are among the most prominent examples of VQAs.”
BackgroundMethodKosugi, T., Nishiya, Y., Nishi, H., & Matsushita, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033121 · Cited by 97
Exact electronic states with shallow quantum circuits from global optimisation
Burton, H. G. A., Marti-Dafcik, D., Tew, D. P., & Wales, D. J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00744-2 · Cited by 88
Scalable Fault-Tolerant Quantum Technologies with Silicon Color Centers
Simmons, S. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010102 · Cited by 90
“However, today’s noisy intermediate-scale quantum (NISQ) devices cannot be trusted to execute practical-scale networking and computational instructions beyond small instances of a few specific problems [19–21].”
BackgroundA Perspective on Protein Structure Prediction Using Quantum Computers
Doğa, H., Raubenolt, B. A., Cumbo, F., Joshi, J., DiFilippo, F. P., Qin, J., Blankenberg, D. J., & Shehab, O. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00067 · Cited by 79
Initial State Preparation for Quantum Chemistry on Quantum Computers
Fomichev, S., Hejazi, K., Zini, M. S., Kiser, M., Fraxanet, J., Casares, P. A. M., Delgado, A., Huh, J., Voigt, A.-C., Mueller, J. E., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040339 · Cited by 155
Variational Quantum Simulation for Quantum Chemistry
Li, Y., Hu, J., Zhang, X., Song, Z., & Yung, M. (2019) · Advanced Theory and Simulations · doi:10.1002/adts.201800182 · Cited by 65
Self-citationQuantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0239-7 · Cited by 86
“23 They rely on term-by-term energy measurement for the prepared trial quantum state (ansatz) with consequent classical optimization, and are referred to as Variational Quantum Eigensolvers (VQE).”
MethodA path towards quantum advantage in training deep generative models with quantum annealers
Vinci, W., Buffoni, L., Sadeghi, H., Khoshaman, A. H., Andriyash, E., & Amin, M. H. S. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aba220 · Cited by 75
Correlating AGP on a quantum computer
Khamoshi, A., Evangelista, F. A., & Scuseria, G. E. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abc1bb · Cited by 73
Lang, R. A., Ryabinkin, I. G., & Izmaylov, A. F. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00170 · Cited by 69
Variational quantum algorithm for nonequilibrium steady states
Yoshioka, N., Nakagawa, Y. O., Mitarai, K., & Fujii, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043289 · Cited by 54
Optimizing quantum phase estimation for the simulation of Hamiltonian eigenstates
Cruz, P. M. Q., Catarina, G., Gautier, R., & Fernández-Rossier, J. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abaa2c · Cited by 82
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Gambella, C., & Simonetto, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3033139 · Cited by 60
“Research directed to apply the resulting algorithms to early generation of universal quantum computers has mainly focused on quantum variational approaches [6], which have been applied to chemistry [11], [12], machine learning [13], [14], and mathematical optimization [7], [15], [16].”
BackgroundMethodInfluentialOn applications of quantum computing to plasma simulations
Dodin, I. Y., & Startsev, E. A. (2021) · Physics of Plasmas · doi:10.1063/5.0056974 · Cited by 81
“The quantum computer is used as a co-processor whose role is to efficiently calculate the matrix elements H n , in which it can significantly outperform a classical computer [72, 73].”
BackgroundMethodDimensional Expressivity Analysis of Parametric Quantum Circuits
Funcke, L., Hartung, T., Jansen, K., Kühn, S., & Stornati, P. (2021) · Desy Publications Database (Deutsches Elektronen-Synchrotron DESY) · Cited by 57
Izmaylov, A. F., Lang, R. A., & Yen, T.-C. (2021) · Physical Review A · doi:10.1103/physreva.104.062443 · Cited by 82
Iterative quantum-assisted eigensolver
Bharti, K., & Haug, T. (2021) · Physical Review A · doi:10.1103/physreva.104.l050401 · Cited by 54
Probabilistic simulation of quantum circuits using a deep-learning architecture
Carrasquilla, J., Luo, D., Pérez, F., Milsted, A., Clark, B. K., Volkovs, M., & Aolita, L. (2021) · Physical Review A · doi:10.1103/physreva.104.032610 · Cited by 53
Statistical complexity of quantum circuits
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2022) · Physical Review A · doi:10.1103/physreva.105.062431 · Cited by 82
Benchmarking Quantum Coprocessors in an Application-Centric, Hardware-Agnostic, and Scalable Way
Martiel, S., Ayral, T., & Allouche, C. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3090207 · Cited by 100
Overlapped grouping measurement: A unified framework for measuring quantum states
Wu, B., Sun, J., Huang, Q. J., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-01-13-896 · Cited by 103
Variational quantum solutions to the advection–diffusion equation for applications in fluid dynamics
Demirdjian, R., Gunlycke, D., Reynolds, C. A., Doyle, J. D., & Tafur, S. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03667-7 · Cited by 71
“This algorithm uses the popular quantum-classical variational hybrid method [29] to solve for |𝑥⟩ leveraging the fact that a quantum computer can efficiently determine the expectation value of some observable while the classical computer can use this expectation value to calculate a cost function.”
BackgroundMethodMotta, M., Sung, K. J., Whaley, K. B., Head‐Gordon, M., & Shee, J. (2023) · Chemical Science · doi:10.1039/d3sc02516k · Cited by 139
Moll, N., Fuhrer, A., Staar, P., & Tavernelli, I. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/29/295301 · Cited by 75
“For example, the hydrogen molecule in a minimal basis was calculated with a photonic quantum computer [4, 8] and a variational eigenvalue solver was demonstrated [16].”
BackgroundMethodApplication of Quantum Computing to Biochemical Systems: A Look to the Future
Cheng, H.-P., Deumens, E., Freericks, J. K., Li, C., & Sanders, B. A. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.587143 · Cited by 53
“The first is the variational quantum eigensolver (Peruzzo et al., 2014; McArdle et al., 2020), which is viewed today as the best candidate for performing chemistry on so-called noisy intermediate-scale quantum (NISQ) hardware.”
BackgroundNoise-Assisted Quantum Autoencoder
Cao, C., & Wang, X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.054012 · Cited by 80
Tilly, J., Sriluckshmy, P. V., Patel, A., Fontana, E., Rungger, I., Grant, E., Anderson, R., Tennyson, J., & Booth, G. H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033230 · Cited by 56
“In section III we consider the CASSCF optimization of carbon monoxide on IBM Quantum services (IBMQ) machines, where active space wave function are optimized on the QPU within the variational quantum eigensolver (VQE) [25].”
BackgroundMethodElfving, V. E., Broer, B. W., Webber, M., Gavartin, J. L., Halls, M. D., Lorton, K. P., & Bochevarov, A. D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.12472 · Cited by 51
“Peruzzo et al.(20) 2013 2 HeH Silicon Photonic VQE-UCC”
BackgroundMethodOperator Sampling for Shot-frugal Optimization in Variational Algorithms
Arrasmith, A., Cincio, L., Somma, R. D., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2004.06252 · Cited by 53
“The variational quantum eigensolver (VQE) is a potential tool for elucidating the electronic structure of molecules and materials [1].”
MethodMutual information-assisted adaptive variational quantum eigensolver
Zhang, Z.-J., Kyaw, T. H., Kottmann, J. S., Degroote, M., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdca4 · Cited by 52
“There exists a number of quantum algorithms [11–16] for solving the electronic structure problem; and the variational quantum eigensolver (VQE) [13, 14] is one of them which requires a feasible number of quantum gates for near-term devices and has noise resilient feature.”
BackgroundSelf-citationMeasurement Cost of Metric-Aware Variational Quantum Algorithms
van Straaten, B., & Koczor, B. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030324 · Cited by 55
Optimal control for the quantum simulation of nuclear dynamics
Holland, E. T., Wendt, K., Kravvaris, K., Wu, X., Ormand, W. E., DuBois, J. L., Quaglioni, S., & Pederiva, F. (2020) · Physical Review A · doi:10.1103/physreva.101.062307 · Cited by 59
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 94
“The first application of such class of methods is the Variational Quantum Eigensolver (VQE) [104, 142, 191], initially proposed to find the lowest energy state (the ground state) of a The Quantum Approximate Optimization Algorithm (QAOA) [69] is a famous variational algorithm that defines an ansatz…”
BackgroundMethodIntegrated photonics in quantum technologies
Giordani, T., Hoch, F., Carvacho, G., Spagnolo, N., & Sciarrino, F. (2023) · Rivista Del Nuovo Cimento · doi:10.1007/s40766-023-00040-x · Cited by 71
“SoS platforms were also one of the first instances of re-programmable optical circuits [53, 54], including the first universal 5-”
BackgroundOpportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 65
Scalable Photonic Platform for Real-Time Quantum Reservoir Computing
García‐Beni, J., Giorgi, G. L., Soriano, M. C., & Zambrini, R. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.014051 · Cited by 80
“Variational eigensolvers implemented in photonic quantum processors [7] have achieved much more efficient use of quantum resources than alternative algorithms, such as quantum phase estimation.”
A Hybrid Quantum-Classical Approach to Mitigating Measurement Errors in Quantum Algorithms
Kwon, H., & Bae, J. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3009664 · Cited by 54
“ally work as expected as true quantum devices, e.g., [10], [11]. Recently, quantum algorithms that are better fitted with NISQ devices have been devised. For instance, variational quantum eigensolvers [12] and quantum approximate optimization algorithms [13] have been proposed, which are designed in such a way that err…”
Quantum simulation of open quantum systems in heavy-ion collisions
de Jong, W. A., Metcalf, M., Mulligan, J. D., Ploskon, M. A., Ringer, F., & Yao, X. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.l051501 · Cited by 78
“[6] A.”
MethodSimulating Periodic Systems on a Quantum Computer Using Molecular Orbitals
Liu, J., Wan, L., Li, Z., & Yang, J. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00881 · Cited by 58
Kreshchuk, M., Jia, S., Kirby, W. M., Goldstein, G. R., Vary, J. P., & Love, P. J. (2021) · Physical Review A · doi:10.1103/physreva.103.062601 · Cited by 69
“Each of those can be measured with precision using O( −2) samples [53, 68].”
BackgroundMethodInfluentialSelf-citationA single inverse-designed photonic structure that performs parallel computing
Camacho, M., Edwards, B. E., & Engheta, N. (2021) · RePEc: Research Papers in Economics · Cited by 51
Benchmarking Adaptive Variational Quantum Eigensolvers
Claudino, D., Wright, J., McCaskey, A. J., & Humble, T. S. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.606863 · Cited by 52
Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
Karamlou, A. H., Simon, W. A., Katabarwa, A., Scholten, T. L., Peropadre, B., & Cao, Y. (2020) · arXiv · doi:10.48550/arxiv.2012.07825 · Cited by 52
Scaling of variational quantum circuit depth for condensed matter systems
Bravo Prieto, C., Lumbreras Zarapico, J., Tagliacozzo, L., & Latorre, J. I. (2020) · Dipòsit Digital de la Universitat de Barcelona (Universitat de Barcelona) · Cited by 59
Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era
Niu, S., & Todri‐Sanial, A. (2023) · Quantum · doi:10.22331/q-2023-02-16-925 · Cited by 92
“Based on our experiment, we have shown that the overhead of VQE can be further improved by executing several sets of Pauli operators at the same time using multi-programming mechanism.”
BackgroundMethodInfluentialVariational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
Kattemölle, J., & van Wezel, J. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.214429 · Cited by 83
Edlbauer, H., Wang, J., Crozes, T., Perrier, P., Ouacel, S., Geffroy, C., Georgiou, G., Chatzikyriakou, E., Lacerda-Santos, A., Waintal, X., et al. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00139-w · Cited by 69
“Nature nanotechnology 8(3), 213–217 (2013).”
InfluentialMultiparticle quantum plasmonics
You, C., Chaitanya, N. A., Leon, I. D., & Magaña‐Loaiza, O. S. (2020) · Nanophotonics · doi:10.1515/nanoph-2019-0517 · Cited by 61
Calculating transition amplitudes by variational quantum deflation
Ibe, Y., Nakagawa, Y. O., Earnest, N., Yamamoto, T., Mitarai, K., Gao, Q., & Kobayashi, T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013173 · Cited by 68
Singh, H., Majumder, S., & Mishra, S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0161057 · Cited by 51
Fast Multiqubit Gates through Simultaneous Two-Qubit Gates
Gu, X. Q., Fernández-Pendás, J., Vikstål, P., Abad, T., Warren, C., Bengtsson, A., Tancredi, G., Shumeiko, V. S., Bylander, J., Johansson, G., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040348 · Cited by 63
Efficient quantum computation of molecular forces and other energy gradients
O’Brien, T. E., Streif, M., Rubin, N. C., Santagati, R., Su, Y., Huggins, W. J., Goings, J. J., Moll, N., Kyoseva, E. S., Degroote, M., et al. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043210 · Cited by 87
Linear-depth quantum circuits for multiqubit controlled gates
da Silva, A. J., & Park, D. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042602 · Cited by 51
Quantum natural gradient generalized to noisy and nonunitary circuits
Koczor, B., & Benjamin, S. C. (2022) · Physical Review A · doi:10.1103/physreva.106.062416 · Cited by 126
Epitaxial quantum dots: a semiconductor launchpad for photonic quantum technologies
Zhou, X., Zhai, L., & Liu, J. (2022) · Photonics Insights · doi:10.3788/pi.2022.r07 · Cited by 63
“By exploiting reconfigurable photonic circuits, a variational quantum eigensolver that is designed to solve molecular ground-state energy has also been experimentally realized using SPDC probabilistic single photons [331] .”
MethodSelf-citationLiu, P., Wang, R., Zhang, J.-N., Zhang, Y., Cai, X., Xu, H., Li, Z., Han, J., Li, X., Xue, G., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.021028 · Cited by 79
qTorch: The quantum tensor contraction handler
Fried, E. S., Sawaya, N. P. D., Cao, Y., Kivlichan, I. D., Romero, J., & Aspuru-Guzik, A. (2018) · PLOS ONE · doi:10.1371/journal.pone.0208510 · Cited by 48
“Among all the algorithms proposed for quantum simulation of fermions, the quantum variational algorithm (VQE) and related approaches [PMS + 14, WHT15, YCM + 14, MRBAG16] hold greater appeal for near-term quantum devices due to their ability to correct certain types of errors and their lower…”
BackgroundMethodSelf-citationMajorana-Based Fermionic Quantum Computation
O’Brien, T. E., Rożek, P., & Akhmerov, A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.220504 · Cited by 62
“parameters θ⃗, which are then tuned to minimize the energy hψðθ⃗ÞjHjψðθ⃗Þi [29].”
A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
Marsh, S., & Wang, J. B. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2171-3 · Cited by 50
Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
Tranter, A., Love, P. J., Mintert, F., Wiebe, N., & Coveney, P. V. (2019) · Entropy · doi:10.3390/e21121218 · Cited by 87
“The expectation value of the qubit Hamiltonian with this state is measured, and a classical optimizer used to vary the Ansatz parameters until the expectation value is variationally minimized [22,23].”
MethodSelf-citationKoczor, B., & Benjamin, S. C. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023017 · Cited by 67
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.