Metraipolis › archive › dc_e5f0135fdfe0
An analysis of iterative refinement for quantum linear system solvers — arXiv:2609.10250
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10250
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:13:27.504Z
- SHA-256 of the archived text
e571a7987c31171e974283ef2c2935734994a5aaf4c7fe61d2b3307e972034f9- Stable URL of this page
https://metraipolis.com/documento/dc_e5f0135fdfe0
How to cite
An analysis of iterative refinement for quantum linear system solvers — arXiv:2609.10250 — arXiv (en), https://arxiv.org/abs/2609.10250 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e5f0135fdfe0 (Metraipolis archive dc_e5f0135fdfe0, sha256 e571a7987c31171e974283ef2c2935734994a5aaf4c7fe61d2b3307e972034f9)
BibTeX
@misc{dce5f0135fdfe0,
title = {An analysis of iterative refinement for quantum linear system solvers — arXiv:2609.10250},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10250},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e5f0135fdfe0; sha256 e571a7987c31171e974283ef2c2935734994a5aaf4c7fe61d2b3307e972034f9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10250. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present and analyze an iterative refinement (IR) framework for improving the precision dependence of algorithms that combine a quantum linear system algorithm (QLSA) with quantum state tomography. Existing QLSAs achieve polylogarithmic dependence on the inverse error tolerance to prepare a quantum state encoding the solution, but extracting a classical description of such a state via tomography typically introduces a polynomial dependence on the target precision. To retain polylogarithmic dependence in the inverse error tolerance throughout the entire process, we develop an IR scheme that solves a sequence of related linear systems to progressively refine the solution while requiring only fixed-precision quantum subroutines, finally obtaining a classical description of a high-precision solution. We analyze the proposed framework under three input models: quantum-read/classical-write RAM (QRAM), linear combinations of unitaries (LCU), and sparse-access oracles. We evaluate the proposed scheme through numerical experiments on both quantum simulators and real quantum hardware. The results demonstrate that iterative refinement efficiently improves the precision of the solution and exhibits robustness to hardware noise. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.NA). Categorie arXiv: Quantum Physics (quant-ph) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.10250 — 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-16T08:46:35.725Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).