Preconditioned Block Encodings for Quantum Linear Systems
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917043718062080 |
|---|---|
| author | Lapworth, Leigh Sünderhauf, Christoph |
| author_facet | Lapworth, Leigh Sünderhauf, Christoph |
| contents | 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 $κ$, affecting the efficiency of solvers. Matrix preconditioning is a well-established classical technique to reduce $κ$ 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 $κ$ are analysed using practical matrices from Computational Fluid Dynamics (CFD). Our results show that (a) quantum multiplication introduces excessive subnormalisation factors, negating improvements in $κ$. We introduce preamplified quantum multiplication to reduce subnormalisation, which is of independent interest. 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_20908 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Preconditioned Block Encodings for Quantum Linear Systems Lapworth, Leigh Sünderhauf, Christoph Quantum Physics 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 $κ$, affecting the efficiency of solvers. Matrix preconditioning is a well-established classical technique to reduce $κ$ 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 $κ$ are analysed using practical matrices from Computational Fluid Dynamics (CFD). Our results show that (a) quantum multiplication introduces excessive subnormalisation factors, negating improvements in $κ$. We introduce preamplified quantum multiplication to reduce subnormalisation, which is of independent interest. 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. |
| title | Preconditioned Block Encodings for Quantum Linear Systems |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.20908 |