A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation
quant-ph
Submitted: 2026-09-21
Updated: 2026-09-21
Comments: 15 pages, 6 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Many computational fluid dynamics (CFD) algorithms solve partial differential equations by discretization, resulting in large and sparse systems of linear equations.
Terminology
Abstract
Many computational fluid dynamics (CFD) algorithms solve partial differential equations by discretization, resulting in large and sparse systems of linear equations. While iterative methods are widely used to solve these systems classically, most existing quantum linear system solvers target the solution through matrix inversion rather than approximating it using an iterative procedure. In this work, we develop a quantum implementation of the Jacobi method based on quantum singular value transformation (QSVT). By reformulating the Jacobi iteration as a polynomial transformation of a block-encoded operator, the algorithm requires only a constant ancilla overhead with respect to the number of iterations while maintaining a circuit depth that scales linearly with the iteration number. We demonstrate the algorithm for one- and two-dimensional Poisson problems, including the pressure Poisson equation arising in Chorin's projection method for the lid-driven cavity flow. The proposed algorithm provides a promising building block for future quantum implementations of multigrid methods and preconditioning techniques, bringing quantum algorithms closer to established CFD solution strategies.
Sources
- Physics-Informed Quantum Machine Learning: Solving nonlinear differential equations in latent spaces without costly grid evaluations
- Quantum Linear System Solvers: A Survey of Algorithms and Applications
- Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations
- A shortcut to an optimal quantum linear system solver
- Evaluation of block encoding for sparse matrix inversion using QSVT
- Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian
- Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions
- Finding Angles for Quantum Signal Processing with Machine Precision
- Lecture Notes on Quantum Algorithms for Scientific Computation
- PennyLane: Automatic differentiation of hybrid quantum-classical computations
- A Hybrid Quantum-Classical CFD Methodology with Benchmark HHL Solutions
- Practical block encodings of matrix polynomials that can also be trivially controlled
- Quantum Eigenvalue Transformations for Arbitrary Matrices
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians