Computing a Sparse Approximate Inverse on Quantum Annealing Machines
Journal of Computing and Information Science in Engineering · 01.01.2026 · 26 (1)
DOI: 10.1115/1.4070578 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computing and Information Science in Engineering, online erschienen am 24.12.2025. Verfasst von Sanjay Suresh und 1 weiteren Autor:innen. Die Arbeit nennt 52 Literaturangaben.
Abstract (Originalsprache)
Many engineering problems involve solving large linear systems of equations. Conjugate gradient (CG) is one of the most popular iterative methods for solving such systems. CG typically requires a good preconditioner to speed up convergence, and computing these preconditioners can be challenging. In this article, we demonstrate that a particular preconditioner, namely, sparse approximate inverse (SPAI), can be computed efficiently using quantum annealing machines. Specifically, we provide an extension of the box algorithm for computing the SPAI of large matrices on D-Wave Advantage machines. The computation of an SPAI reduces to solving a series of quadratic unconstrained binary optimization (QUBO) problems. This is demonstrated using several poorly conditioned linear systems arising from a 2D finite-difference formulation of the Poisson problem.
Zitieren
APA
Suresh, S., & Suresh, K. (2026). Computing a Sparse Approximate Inverse on Quantum Annealing Machines. Journal of Computing and Information Science in Engineering, 26(1). https://doi.org/10.1115/1.4070578
Vancouver
Suresh S, Suresh K. Computing a Sparse Approximate Inverse on Quantum Annealing Machines. Journal of Computing and Information Science in Engineering. 2026;26(1). doi:10.1115/1.4070578
BibTeX
@article{Suresh2026,
author = {Suresh, Sanjay and Suresh, Krishnan},
title = {Computing a Sparse Approximate Inverse on Quantum Annealing Machines},
journal = {Journal of Computing and Information Science in Engineering},
year = {2026},
volume = {26},
number = {1},
doi = {10.1115/1.4070578}
}
EUVIMED