Evaluation of block encoding for sparse matrix inversion using QSVT
Leigh Lapworth

TL;DR
This paper evaluates three block encoding methods for quantum matrix inversion using QSVT, analyzing their performance on various test cases and their implications for quantum CFD solvers, highlighting stability and cost considerations.
Contribution
It provides a comparative analysis of ARCSIN, FABLE, and PREPARE-SELECT encodings for QSVT in solving linear systems, with insights into their performance and classical preprocessing costs.
Findings
QSVT performance is resilient to polynomial approximation errors.
Error tolerances of 10^{-2} are generally sufficient for CFD applications.
ARCSIN and FABLE have lower classical costs than PREPARE-SELECT.
Abstract
Three block encoding methods are evaluated for solving linear systems of equations using QSVT (Quantum Singular Value Transformation). These are ARCSIN, FABLE and PREPARE-SELECT. The performance of the encoders is evaluated using a suite of 30 test cases including 1D, 2D and 3D Laplacians and 2D CFD matrices. A subset of cases is used to characterise how the degree of the polynomial approximation to influences the performance of QSVT. The results are used to guide the evaluation of QSVT as the linear solver in hybrid non-linear pressure correction and coupled implicit CFD solvers. The performance of QSVT is shown to be resilient to polynomial approximation errors. For both CFD solvers, error tolerances of are more than sufficient in most cases and in some cases is sufficient. The pressure correction solver allows subnormalised condition numbers, , as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlind Source Separation Techniques · Sparse and Compressive Sensing Techniques · CCD and CMOS Imaging Sensors
