arXiv:2602.22888

Existence of Quantum Splines via Fourth-Order Gradient Flows

Chun-Chi Lin, Yang-Kai Lue, Dung The Tran

Published Feb 26, 2026• 0 citations

Abstract

We establish a rigorous existence theory for the quantum splines introduced by Brody, Holm, and Meier in Physical Review Letters (2012). These curves arise as solutions of a variational problem on the unitary group describing optimally controlled quantum evolutions. By formulating the problem within a geometric gradient flow framework for Riemannian spline interpolation, we construct a well-posed fourth order evolution whose asymptotic limits realize the desired quantum splines. The analysis requires adapting the variational structure to boundary conditions dictated by the physical model, which are not directly amenable to the setting in our recently developed framework for gradient flows of Riemannian spline interpolation. We show that, despite these difficulties, the modified system admits a rigorous analytical treatment, yielding both existence and a constructive procedure for generating quantum splines. Our results provide a mathematical foundation for the variational description of smooth quantum control trajectories and clarify the analytical structure underlying their formation.

DOI: 10.48550/arxiv.2602.22888

Related papers

A general framework for quantum splines

Lígia Abrunheiro, Margarida Camarinha, Jesús Clemente-Gallardo +2 more

Quantum splines are curves in a Hilbert space or, equivalently, in the corresponding Hilbert projective space, which generalize the notion of Riemannian cubic splines to the quantum domain. In this paper, we present a generalization of this concept to general density matrices with a Hamiltonian approach and using a geometrical formulation of quantum mechanics. Our main goal is to formulate an optimal control problem for a nonlinear system on the dual of the Lie algebra of the unitary group which corresponds to the variational problem of quantum splines. The corresponding Hamiltonian equations and interpolation conditions are derived. The results are illustrated with some examples and the corresponding quantum splines are computed with the implementation of a suitable iterative algorithm.

Nov 20, 20182 citations

A general framework for quantum splines

L. Abrunheiro, M. Camarinha, Jesús Clemente-Gallardo +2 more

Quantum splines are curves in a Hilbert space or, equivalently, in the corresponding Hilbert projective space, which generalize the notion of Riemannian cubic splines to the quantum domain. In this paper, we present a generalization of this concept to general density matrices with a Hamiltonian approach and using a geometrical formulation of quantum mechanics. Our main goal is to formulate an optimal control problem for a nonlinear system on [Formula: see text] which corresponds to the variational problem of quantum splines. The corresponding Hamiltonian equations and interpolation conditions are derived. The results are illustrated with some examples and the corresponding quantum splines are computed with the implementation of a suitable iterative algorithm.

arXiv:1811.08141International Journal of Geometric Methods in Modern PhysicsMay 3, 20184 citations

GRADIENT FLOWS FOR OPTIMIZATION IN QUANTUM INFORMATION AND QUANTUM DYNAMICS: FOUNDATIONS AND APPLICATIONS

THOMAS SCHULTE-HERBRÜGGEN, Steffen J. Glaser, Gunther Dirr +1 more

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.

arXiv:0802.4195Reviews in Mathematical PhysicsJul 1, 201049 citations

Optimizing quantum circuits with Riemannian gradient flow

Roeland Wiersema, Nathan Killoran

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.

arXiv:2202.06976Physical Review AJun 27, 202333 citations

Quantum circuit design from a retraction-based Riemannian optimization framework

Zhijian Lai, Hantao Nie, Jiayuan Wu +1 more

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.

quant-pharXiv:2602.20605Feb 25, 20260 citations

Time-Optimal Control of Quantum Systems: Numerical Techniques and Singular Trajectories

Tyler Holden

As technological advances allow us to peer into and beyond microscopic phenomena, new theoretical developments are necessary to facilitate this exploration. In particular, the potential afforded by utilizing quantum resources promises to dramatically affect scientific research, communications, computation, and material science. \n \nControl theory is the field dedicated to the manipulation of systems, and quantum control theory pertains to the manoeuvring of quantum systems. Due to the inherent sensitivity of quantum ensembles to their environment, time-optimal solutions should be found in order to minimize exposure to external sources. Furthermore, the complexity of the Schr\\"odinger equation in describing the evolution of a unitary operator makes the analytical discovery of time-optimal solutions rare, motivating the development of numerical algorithms. \n \nThe seminal result of classical control is the Pontryagin Maximum Principle, which implies that a restriction to bounded control amplitudes admits two classifications of trajectories: bang-bang and singular. Extensions of this result to generalized control problems yield the same classification and hence arise in the study of quantum dynamics. While singular trajectories are often avoided in both classical and quantum literature, a full optimal synthesis requires that we analyze the possibility of their existence. \n \nWith this in mind, this treatise will examine the issue of time-optimal quantum control. In particular, we examine the results of existing numerical algorithms, including Gradient Ascent Pulse Engineering and the Kaya-Huneault method. We elaborate on the ideas of the Kaya-Huneault algorithm and present an alternative algorithm that we title the Real-Embedding algorithm. These methods are then compared when used to simulate unitary evolution. \n \nThis is followed by a brief examination on the conditions for the existence of singular controls, as well possible ideas and developments in creating geometry based numerical algorithms.

Jun 21, 20111 citation