Approximate Quantum Linear Solvers for Hybrid CFD: End-to-End Analysis with a Chebyshev-LCU Approach

• URL: http://arxiv.org/abs/2606.01067v1
• Date: Sun, 31 May 2026 07:20:42 GMT
• Title: Approximate Quantum Linear Solvers for Hybrid CFD: End-to-End Analysis with a Chebyshev-LCU Approach
• Abstract summary: We analyze how an approximate quantum linear solver affects the convergence of the overall CFD iteration.<n>We develop an approximate qubitization-based solver (Cheb-LCU) that can reduce quantum resource requirements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum linear solvers are well studied as standalone quantum algorithms; however, in hybrid classical-quantum routines, their practical value must be evaluated at the level of the full non-linear application. A central issue is whether the approximation error of the quantum linear solver remains controlled once embedded in a full iterative workflow. We study this question in the context of a hybrid computational fluid dynamics (CFD) scheme. Through numerical simulations, we analyze how an approximate quantum linear solver affects the convergence of the overall CFD iteration. We show that convergence can be preserved for a non-exact quantum solver with only a moderate overhead in iteration count, provided that the high-frequency components of the linear system are resolved with sufficient accuracy. In addition, we develop an approximate qubitization-based solver (Cheb-LCU) that can reduce quantum resource requirements relative to a Quantum Singular Value Transformation (QSVT)-based solver while inducing only a small loss in convergence performance. This claim is demonstrated through explicit implementation and compilation of the quantum algorithms and by examining their impact on the convergence of the full CFD scheme. We find that our approximate approach reduces the required number of single-qubit rotations by over an order of magnitude relative to the QSVT-based solver, while requiring only a modest increase in CFD iteration count.

Related papers

• An analysis of iterative refinement for quantum linear system solvers [0.06157382820537719]
  We present an iterative refinement (IR) framework for improving the precision dependence of algorithms that combine a quantum linear system algorithm (QLSA) with quantum state tomography.<n>We evaluate the proposed scheme through numerical experiments on both quantum simulators and real quantum hardware.
  arXiv  Detail & Related papers  (2026-09-09T14:38:28Z)
• An HHL-Based Quantum-Classical Solver for the Incompressible Navier-Stokes Equations with Approximate QST [0.0]
  Harrow-Hassidim-Lloyd (HHL) offer the potential for exponential speedups for solving incompressible Navier-Stokes equations.<n>We demonstrate both accurate lid-driven cavity flow simulations as a fully integrated benchmark problem, and accurate flow of the Taylor-Green vortex.<n>We implement the solver using IBM's Qiskit framework and validate the hybrid quantum-classical simulation against standard classical numerical methods.
  arXiv  Detail & Related papers  (2026-03-18T19:13:06Z)
• A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms [41.15017547767954]
  We introduce an a posteriori certification viewpoint for the generalized quantum Arimoto-Blahut (QAB) algorithm.<n>We prove a global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer.<n>As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels.
  arXiv  Detail & Related papers  (2026-01-14T09:10:41Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Tradeoffs between quantum and classical resources in linear combination of unitaries [0.07388859384645262]
  The linear combination of unitaries (LCU) algorithm is a building block of many quantum algorithms.<n>We propose a quantum algorithm that manages the tradeoff between sampling cost and the circuit size.
  arXiv  Detail & Related papers  (2025-12-06T03:10:22Z)
• Quantum-Classical Hybrid Quantized Neural Network [8.382617481718643]
  We present a novel Quadratic Binary Optimization (QBO) model for quantized neural network training, enabling the use of arbitrary activation and loss functions.<n>We employ the Quantum Gradient Conditional Descent (QCGD) algorithm, which leverages quantum computing to directly solve the QCBO problem.
  arXiv  Detail & Related papers  (2025-06-23T02:12:36Z)
• i-QLS: Quantum-supported Algorithm for Least Squares Optimization in Non-Linear Regression [4.737806718785056]
  We propose an iterative quantum-assisted least squares (i-QLS) optimization method.<n>We overcome the scalability and precision limitations of prior quantum least squares approaches.<n> Experiments confirm that i-QLS enables near-term quantum hardware to perform regression tasks with improved precision and scalability.
  arXiv  Detail & Related papers  (2025-05-05T17:02:35Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Demonstration of Scalability and Accuracy of Variational Quantum Linear Solver for Computational Fluid Dynamics [0.0]
  This paper presents an exploration of quantum methodologies aimed at achieving high accuracy in solving such a large system of equations. We consider the 2D, transient, incompressible, viscous, non-linear coupled Burgers equation as a test problem. Our findings demonstrate that our quantum methods yield results comparable in accuracy to traditional approaches.
  arXiv  Detail & Related papers  (2024-09-05T04:42:24Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• 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)

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.