Metraipolis › archive › dc_dad79f59f635

A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation — arXiv:2609.24266

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24266
License (as archived)
CC0-1.0
Archived
2026-10-09T22:46:57.614Z
SHA-256 of the archived text
5af5af058b7381badee3008869e418df47a7dd6e30f57517b24ce356c8770e49
Stable URL of this page
https://metraipolis.com/documento/dc_dad79f59f635

How to cite

A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation — arXiv:2609.24266 — arXiv (en), https://arxiv.org/abs/2609.24266 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dad79f59f635 (Metraipolis archive dc_dad79f59f635, sha256 5af5af058b7381badee3008869e418df47a7dd6e30f57517b24ce356c8770e49)
BibTeX
@misc{dcdad79f59f635,
  title = {A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation — arXiv:2609.24266},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24266},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dad79f59f635; sha256 5af5af058b7381badee3008869e418df47a7dd6e30f57517b24ce356c8770e49},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24266. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-22 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.24266 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:25:52.450Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).