Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Variational quantum algorithms and geometry

John C. Napp

Published Jun 4, 2020• 5 citations
Publisher
DOI
10.22331/qv-2020-06-04-37

Related papers

Undecidable problems associated with variational quantum algorithms

Georgios Korpas, Vyacheslav Kungurtsev, Jakub Mareček

Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are widely studied as candidates for near-term quantum advantage. Recent work has shown that training VQAs is NP-hard in general. In this paper, we present a conditional result suggesting that the training of VQAs is undecidable, even in idealized, noiseless settings. We reduce the decision version of the digitized VQA training problem-where circuit parameters are drawn from a discrete set-to the question of whether a universal Diophantine equation (UDE) has a root. This reduction relies on encoding the UDE into the structure of a variational quantum circuit via the matrix exponentials. The central step involves establishing a correspondence between the objective function of the VQA and a known UDE of 58 variables and degree 4. Our main result is conditional on a natural conjecture: that a certain system of structured complex polynomial equations-arising from the inner product of a VQA circuit output and a fixed observable-has at least one solution. We argue this conjecture is plausible based on dimension-counting arguments (degrees of freedom in the Hamiltonians, state vector, and observable), and the generic solvability of such systems in algebraic geometry over the complex numbers. Under this assumption, we suggest that deciding whether a digitized VQA achieves a given energy threshold is undecidable. This links the limitations of variational quantum algorithms to foundational questions in mathematics and logic, extending the known landscape of quantum computational hardness to include uncomputability. Additionally, we establish an unconditional undecidability result for VQA convergence in open quantum systems.

arXiv:2503.23723•Mar 31, 2025•3 citations

Variational quantum algorithms

Marco Cerezo, Andrew Arrasmith, Ryan Babbush +8 more

arXiv:2012.09265•Nature Reviews Physics•Aug 12, 2021•4,270 citations

On the geometry of Variational Quantum Algorithms: Hopf fibrations, entanglement and the natural gradient descent

Gustavo Schranck Habermann

Variational quantum algorithms were proposed as a strategy to obtain quantum advantage using the current state of the art quantum devices, the so called noisy intermediate scale quantum (NISQ) devices, by combining low-depth parameterized quantum circuits and classical optimization methods, such as the natural gradient descent. In this work we investigate geometrical aspects of variational quantum algorithms and the natural gradient descent in one and two qubits settings using tools of Riemannian geometry and information geometry, exploring the geometry of quantum states and the associated Hopf fibration structure as well as the behaviour of the natural gradient descent on statistical models contained in Riemannian manifolds. In addittion, recent results connecting entanglement, scalar curvature and two qubits parameterized quantum circuit performance are discussed and compared to our own calculations.

•Jul 11, 2024•0 citations

Variational Quantum Algorithms for A System of Linear Equations

D. (Dildora) Muhamediyeva

•Dec 1, 2023•0 citations

Variational quantum algorithm for molecular geometry optimization

Alain Delgado, Juan Miguel Arrazola, Soran Jahangiri +4 more

Classical algorithms for predicting the equilibrium geometry of strongly correlated molecules require expensive wave function methods that become impractical already for few-atom systems. In this work, we introduce a variational quantum algorithm for finding the most stable structure of a molecule by explicitly considering the parametric dependence of the electronic Hamiltonian on the nuclear coordinates. The equilibrium geometry of the molecule is obtained by minimizing a more general cost function that depends on both the quantum circuit and the Hamiltonian parameters, which are simultaneously optimized at each step. The algorithm is applied to find the equilibrium geometries of the ${\mathrm{H}}_{2},$ ${\mathrm{H}}_{3}{}^{+},$ ${\mathrm{BeH}}_{2},$ and ${\mathrm{H}}_{2}\mathrm{O}$ molecules. The quantum circuits used to prepare the electronic ground state for each molecule were designed using an adaptive algorithm where excitation gates in the form of Givens rotations are selected according to the norm of their gradient. All quantum simulations are performed using the PennyLane library for quantum differentiable programming. The optimized geometrical parameters for the simulated molecules show an excellent agreement with their counterparts computed using classical quantum chemistry methods.

arXiv:2106.13840•Physical Review A•Nov 2, 2021•47 citations

Variational quantum algorithms: fundamental concepts, applications and challenges

Han Qi, Sihui Xiao, Zhuo Liu +2 more

Quantum Information Processing•Jun 3, 2024•51 citations
Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are widely studied as candidates for near-term quantum advantage. Recent work has shown that training VQAs is NP-hard in general. In this paper, we present a conditional result suggesting that the training of VQAs is undecidable, even in idealized, noiseless settings. We reduce the decision version of the digitized VQA training problem-where circuit parameters are drawn from a discrete set-to the question of whether a universal Diophantine equation (UDE) has a root. This reduction relies on encoding the UDE into the structure of a variational quantum circuit via the matrix exponentials. The central step involves establishing a correspondence between the objective function of the VQA and a known UDE of 58 variables and degree 4. Our main result is conditional on a natural conjecture: that a certain system of structured complex polynomial equations-arising from the inner product of a VQA circuit output and a fixed observable-has at least one solution. We argue this conjecture is plausible based on dimension-counting arguments (degrees of freedom in the Hamiltonians, state vector, and observable), and the generic solvability of such systems in algebraic geometry over the complex numbers. Under this assumption, we suggest that deciding whether a digitized VQA achieves a given energy threshold is undecidable. This links the limitations of variational quantum algorithms to foundational questions in mathematics and logic, extending the known landscape of quantum computational hardness to include uncomputability. Additionally, we establish an unconditional undecidability result for VQA convergence in open quantum systems.
Variational quantum algorithms were proposed as a strategy to obtain quantum advantage using the current state of the art quantum devices, the so called noisy intermediate scale quantum (NISQ) devices, by combining low-depth parameterized quantum circuits and classical optimization methods, such as the natural gradient descent. In this work we investigate geometrical aspects of variational quantum algorithms and the natural gradient descent in one and two qubits settings using tools of Riemannian geometry and information geometry, exploring the geometry of quantum states and the associated Hopf fibration structure as well as the behaviour of the natural gradient descent on statistical models contained in Riemannian manifolds. In addittion, recent results connecting entanglement, scalar curvature and two qubits parameterized quantum circuit performance are discussed and compared to our own calculations.
Classical algorithms for predicting the equilibrium geometry of strongly correlated molecules require expensive wave function methods that become impractical already for few-atom systems. In this work, we introduce a variational quantum algorithm for finding the most stable structure of a molecule by explicitly considering the parametric dependence of the electronic Hamiltonian on the nuclear coordinates. The equilibrium geometry of the molecule is obtained by minimizing a more general cost function that depends on both the quantum circuit and the Hamiltonian parameters, which are simultaneously optimized at each step. The algorithm is applied to find the equilibrium geometries of the H2,{\mathrm{H}}_{2},H2​, H3+,{\mathrm{H}}_{3}{}^{+},H3​+, BeH2,{\mathrm{BeH}}_{2},BeH2​, and H2O{\mathrm{H}}_{2}\mathrm{O}H2​O molecules. The quantum circuits used to prepare the electronic ground state for each molecule were designed using an adaptive algorithm where excitation gates in the form of Givens rotations are selected according to the norm of their gradient. All quantum simulations are performed using the PennyLane library for quantum differentiable programming. The optimized geometrical parameters for the simulated molecules show an excellent agreement with their counterparts computed using classical quantum chemistry methods.