Quantum Gradient Flow Algorithm for Symmetric Positive Definite Systems via Quantum Eigenvalue Transformation: Towards Quantum CAE
Yuto Lewis Terashima, Tadashi Kadowaki, Yohichi Suzuki, Mayu Muramatsu, Katsuhiro Endo
TL;DR
The paper addresses SPD linear systems arising in computational engineering, where large condition numbers hinder conventional quantum inverse methods. It proposes the Quantum Gradient Flow Algorithm (QGFA), which solves $K\mathbf{u}=\mathbf{f}$ by simulating the gradient-flow dynamics of the quadratic energy $\Pi(\mathbf{u})$ and approximating the necessary matrix functions with Quantum Signal Processing implemented via Quantum Eigenvalue Transformation and Linear Combination of Unitaries. Key contributions include a variational formulation of SPD solvers in the quantum setting, a soft-absolute regularization to enable stable QSP polynomial approximations of exponential-type functions, and a circuit design that achieves the gradient-flow solution with cost scaling primarily with the polynomial degree $d$ rather than the condition number. Demonstrations on 2D FEM problems show QGFA converges to classical FEM solutions with modest phase factors and well-chosen initial states, often outperforming QMIA in relative error, signaling potential as a preconditioned quantum solver and a stepping stone toward Quantum CAE for nonlinear and multiphysics simulations.
Abstract
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.
