Quantum Gradient Flow Algorithm for Symmetric Positive Definite Systems via Quantum Eigenvalue Transformation: Towards Quantum CAE

• URL: http://arxiv.org/abs/2512.09623v1
• Date: Wed, 10 Dec 2025 13:10:15 GMT
• Title: Quantum Gradient Flow Algorithm for Symmetric Positive Definite Systems via Quantum Eigenvalue Transformation: Towards Quantum CAE
• Authors: Yuto Lewis Terashima, Tadashi Kadowaki, Yohichi Suzuki, Mayu Muramatsu, Katsuhiro Endo,
• Abstract summary: We propose the Quantum Gradient Flow Algorithm (QGFA), a novel quantum algorithm for solving symmetric positive definite (SPD) linear systems.<n>QGFA achieves lower relative errors and faster convergence when with suitable initial states, demonstrating its potential as an efficient preconditioned quantum linear solver.<n>These findings suggest that QGFA can serve as a foundation for future developments in Quantum Computer-Aided Engineering (Quantum CAE)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Hybrid quantum-classical and quantum-inspired classical algorithms for solving banded circulant linear systems [0.8192907805418583]
  We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems. By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$. We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
  arXiv  Detail & Related papers  (2023-09-20T16:27:16Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Toward Neural Network Simulation of Variational Quantum Algorithms [1.9723551683930771]
  Variational quantum algorithms (VQAs) utilize a hybrid quantum-classical architecture to recast problems of high-dimensional linear algebra as ones of optimization. We ask if classical optimization algorithms can be constructed paralleling other VQAs, focusing on the example of the variational quantum linear solver (VQLS) We find that such a construction can be applied to the VQLS, yielding a paradigm that could theoretically extend to other VQAs of similar form.
  arXiv  Detail & Related papers  (2022-11-05T15:46:47Z)
• Near Term Algorithms for Linear Systems of Equations [0.0]
  This paper makes contributions that include: the first application of the Evolutionary Ansatz to the VQLS (EAVQLS), the first implementation of the Logical Ansatz VQLS (LAVQLS), and the first proof of principle demonstration of the CQS method on real quantum hardware.
  arXiv  Detail & Related papers  (2021-08-25T17:35:52Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Hybrid quantum variational algorithm for simulating open quantum systems with near-term devices [0.0]
  Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources. We develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics.
  arXiv  Detail & Related papers  (2020-08-12T13:49:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.