The gradient flow is commonly used to numerically solve the problem of maximizing quantum observables for finite dimensional closed quantum systems. In this note, we analyze the asymptotic behavior of the gradient flow. We show that, under a regularity assumption on the controls, the flow almost always converges to a solution of the maximization problem.
The gradient flow is commonly used to numerically solve the problem of maximizing quantum observables for finite dimensional closed quantum systems. In this note, we analyze the asymptotic behavior of the gradient flow. We show that, under a regularity assumption on the controls, the flow almost always converges to a solution of the maximization problem.
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.
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.
We investigate and ascertain the ideal inputs to any finite-time physical process. We demonstrate that the expectation values of entropy flow, heat, and work can all be determined via Hermitian observables of the initial state. These Hermitian operators encapsulate the breadth of behavior and the ideal inputs for common thermodynamic objectives. We show how to construct these Hermitian operators from measurements of thermodynamic output from a finite number of effectively arbitrary inputs. The behavior of a small number of test inputs thus determines the full range of thermodynamic behavior from all inputs. For any process, entropy flow, heat, and work can all be extremized by pure input states—eigenstates of the respective operators. In contrast, the input states that minimize entropy production or maximize the change in free energy are nonpure mixed states obtained from the operators as the solution of a convex-optimization problem. To attain these, we provide an easily implementable gradient-descent method on the manifold of density matrices, where an analytic solution yields a valid direction of descent at each iterative step. Ideal inputs within a limited domain, and their associated thermodynamic operators, are obtained with less effort. This allows analysis of ideal thermodynamic inputs within quantum subspaces of infinite-dimensional quantum systems; it also allows analysis of ideal inputs in the classical limit. Our examples illustrate the diversity of “ideal” inputs: distinct initial states minimize entropy production, extremize the change in free energy, and maximize work extraction. Published by the American Physical Society 2024
In this study, we propose the Quantum Gradient Flow Algorithm (QGFA), a novel quantum algorithm for solving symmetric positive definite (SPD) linear systems based on the variational formulation and time-evolution dynamics. Conventional quantum linear solvers, such as the quantum matrix inverse algorithm (QMIA), focus on approximating the matrix inverse through quantum signal processing (QSP). However, QMIA suffers from a crucial drawback: its computational efficiency deteriorates as the condition number increases. In contrast, classical SPD linear solvers, such as the steepest descent and conjugate gradient methods, are known for their fast convergence, which stems from the variational optimization principle of SPD systems. Inspired by this, we develop QGFA, which obtains the solution vector through the gradient-flow process of the corresponding quadratic energy functional. To validate the proposed method, we apply QGFA to the displacement-based finite element method (FEM) for two-dimensional linear elastic problems under plane stress conditions. The algorithm demonstrates accurate convergence toward classical FEM solutions even with a moderate number of QSP phase factors. Compared with QMIA, QGFA achieves lower relative errors and faster convergence when initialized with suitable initial states, demonstrating its potential as an efficient preconditioned quantum linear solver. The proposed framework provides a physically interpretable connection between classical iterative solvers and quantum computational paradigms. These findings suggest that QGFA can serve as a foundation for future developments in Quantum Computer-Aided Engineering (Quantum CAE), including nonlinear and multiphysics simulations.
Abstract In this work, we adopt the gradient projection method (GPM) to problems of quantum control. For general N-level closed and open quantum systems, we derive the corresponding adjoint systems and gradients of the objective functionals and provide the projection versions of the Pontryagin maximum principle and the GPM, all directly in terms of quantum objects such as evolution operator, Hamiltonians, density matrices, etc. Various forms of the GPM, including one- and two-step, are provided and compared. We formulate the GPM both for closed and open quantum systems, latter for the general case with simultaneous coherent and incoherent controls. The GPM is designed to perform local gradient based optimization in the case when bounds are imposed on the controls. The main advantage of the method is that it allows to exactly satisfy the bounds, in difference to other approaches such as adding constraints as weight to an objective. We apply the GPM to several examples including generation of one- and two-qubit gates and two-qubit Bell and Werner states for models of superconducting qubits under the constraint when controls are zero at the initial and final times, steering an open quantum system to a target density matrix for simulating action of the Werner–Holevo channel, etc.