Preconditioned block encodings for quantum linear systems

L. Lapworth, C. Sünderhauf · 2025 · Quantum Sci. Technol. 10, 045064

| 编号 QC021 | 主题 量子算法工具箱 | 链接 10.1088/2058-9565/ae0f4b |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Quantum linear system solvers like the Quantum Singular Value Transformation (QSVT) require a block encoding of the system matrix $A$ within a unitary operator $U_A$ . Unfortunately, block encoding often results in significant subnormalisation and increase in the matrix’s effective condition number $\kappa$ , affecting the efficiency of solvers. Matrix preconditioning is a well-established classical technique to reduce $\kappa$ by multiplying $A$ by a preconditioner $P$ . Here, we study quantum preconditioning for block encodings. We consider four preconditioners and two encoding approaches: (a) separately encoding $A$ and its preconditioner $P$ , followed by quantum multiplication, and (b) classically multiplying $A$ and $P$ before encoding the product in $U_{PA}$ . Their impact on subnormalisation factors and condition number $\kappa$ are analysed using practical matrices from Computational Fluid Dynamics (CFD). Our results show that (a) quantum multiplication introduces excessive subnormalisation factors, negating improvements in $\kappa$ . We study preamplified quantum multiplication to reduce subnormalisation. Conversely, we see that (b) encoding of the classical product can significantly improve the effective condition number using the Sparse Approximate Inverse preconditioner with infill. Further, we introduce a new matrix filtering technique that reduces the circuit depth without adversely affecting the matrix solution. We apply these methods to reduce the number of QSVT phase factors by a factor of 25 for an example CFD matrix of size 1024x1024.

本站词条在引用该文献时，会以 wikilink（sources/QC021）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。