Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. We illustrate that the resulting Riemannian gradient-flow algorithm has favorable optimization properties for deep circuits and that an approximate version of this algorithm can be performed on near-term hardware. We highlight the connections of our work with previously proposed heuristics like ADAPT-VQE and show that they can be understood as variants of our algorithm.
Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. We illustrate that the resulting Riemannian gradient-flow algorithm has favorable optimization properties for deep circuits and that an approximate version of this algorithm can be performed on near-term hardware. We highlight the connections of our work with previously proposed heuristics like ADAPT-VQE and show that they can be understood as variants of our algorithm.
Designing quantum circuits for ground state preparation is a fundamental task in quantum information science. However, standard Variational Quantum Algorithms (VQAs) are often constrained by limited ansatz expressivity and difficult optimization landscapes. To address these issues, we adopt a geometric perspective, formulating the problem as the minimization of an energy cost function directly over the unitary group. We establish a retraction-based Riemannian optimization framework for this setting, ensuring that all algorithmic procedures are implementable on quantum hardware. Within this framework, we unify existing randomized gradient approaches under a Riemannian Random Subspace Gradient Projection (RRSGP) method. While recent geometric approaches have predominantly focused on such first-order gradient descent techniques, efficient second-order methods remain unexplored. To bridge this gap, we derive explicit expressions for the Riemannian Hessian and show that it can be estimated directly on quantum hardware via parameter-shift rules. Building on this, we propose the Riemannian Random Subspace Newton (RRSN) method, a scalable second-order algorithm that constructs a Newton system from measurement data. Numerical simulations indicate that RRSN achieves quadratic convergence, yielding high-precision ground states in significantly fewer iterations compared to both existing first-order approaches and standard VQA baselines. Ultimately, this work provides a systematic foundation for applying a broader class of efficient Riemannian algorithms to quantum circuit design.
Variational quantum algorithms use non-convex optimization methods to find the optimal parameters for a parametrized quantum circuit in order to solve a computational problem. The choice of the circuit ansatz, which consists of parameterized gates, is crucial to the success of these algorithms. Here, we propose a gate which fully parameterizes the special unitary group SU(N) . This gate is generated by a sum of non-commuting operators, and we provide a method for calculating its gradient on quantum hardware. In addition, we provide a theorem for the computational complexity of calculating these gradients by using results from Lie algebra theory. In doing so, we further generalize previous parameter-shift methods. We show that the proposed gate and its optimization satisfy the quantum speed limit, resulting in geodesics on the unitary group. Finally, we give numerical evidence to support the feasibility of our approach and show the advantage of our gate over a standard gate decomposition scheme. In doing so, we show that not only the expressibility of an ansatz matters, but also how it's explicitly parameterized.
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.
Many challenges in quantum information and quantum control root in constrained optimization problems on finite-dimensional quantum systems. The constraints often arise from two facts: (i) quantum dynamic state spaces are naturally smooth manifolds (orbits of the respective initial states) rather than being Hilbert spaces; (ii) the dynamics of the respective quantum system may be restricted to a proper subset of the entire state space. Mathematically, either case can be treated by constrained optimization over the reachable set of an underlying control system. Thus, whenever the reachable set takes the form a smooth manifold, Riemannian optimization methods apply. Here, we give a comprehensive account on the foundations of gradient flows on Riemannian manifolds including new applications in quantum information and quantum dynamics. Yet, we do not pursue the problem of designing explicit controls for the underlying control systems. The framework is sufficiently general for setting up gradient flows on (sub)manifolds, Lie (sub)groups, and (reductive) homogeneous spaces. Relevant convergence conditions are discussed, in particular for gradient flows on compact and analytic manifolds. This is meant to serve as foundation for new achievements and further research. Illustrative examples and new applications are given: we extend former results on unitary groups to closed subgroups with tensor-product structure, where the finest product partitioning relates to SUloc(2n) := SU(2) ⊗ ⋯ ⊗ SU(2) — known as (qubit-wise) local unitary operations. Such applications include, e.g., optimizing figures of merit on SUloc(2n) relating to distance measures of pure-state entanglement as well as to best rank-1 approximations of higher-order tensors. In quantum information, our gradient flows provide a numerically favorable alternative to standard tensor-SVD techniques.
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian optimization methods -- specifically the Riemannian trust-region algorithm -- which involves second derivative calculations with respect to the gates. Our key technical contribution is a matrix-free algorithmic framework that avoids the explicit construction and storage of large unitary matrices acting on the whole Hilbert space. Instead, we evaluate all quantities as sums over state vectors, assuming that these vectors can be stored in memory. We develop HPC-optimized kernels for applying gates to state vectors and for the gradient and Hessian computation. Further improvements are achieved by exploiting sparsity structures due to Hamiltonian conservation laws, such as parity conservation, and lattice translation invariance. We benchmark our implementation on the Fermi-Hubbard model with up to 16 sites, demonstrating a nearly linear parallelization speed-up with up to 112 CPU threads. Finally, we compare our implementation with an alternative matrix product operator-based approach.
We identify quantum imaginary time evolution as a Riemannian gradient flow on the unitary group. We develop an upper bound for the error between the two evolutions that can be controlled through the step size of the Riemannian gradient descent that minimizes the energy of the system. We discuss implementations through adaptive quantum algorithms and present a stochastic Riemannian gradient descent algorithm in which each step is efficiently implementable on a quantum computer. We prove that for a sufficiently small step size, the stochastic evolution concentrates around the imaginary time evolution, thereby providing performance guarantees for cooling the system through stochastic Riemannian gradient descent. Finally, we show that Riemannian gradient descent can be understood as an approximation to quantum imaginary time evolution that does not employ classical optimization.