Metraipolis › archive › dc_67af957dced3

Simultaneously Query-Optimal Quantum Linear-System Algorithm — arXiv:2609.33686

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33686
License (as archived)
CC0-1.0
Archived
2026-10-08T00:45:13.000Z
SHA-256 of the archived text
7559253dc1725a16ef9c8fb85c68f694d24d756d2f8f1919cd6fca0185efc67f
Stable URL of this page
https://metraipolis.com/documento/dc_67af957dced3

How to cite

Simultaneously Query-Optimal Quantum Linear-System Algorithm — arXiv:2609.33686 — arXiv (en), https://arxiv.org/abs/2609.33686 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_67af957dced3 (Metraipolis archive dc_67af957dced3, sha256 7559253dc1725a16ef9c8fb85c68f694d24d756d2f8f1919cd6fca0185efc67f)
BibTeX
@misc{dc67af957dced3,
  title = {Simultaneously Query-Optimal Quantum Linear-System Algorithm — arXiv:2609.33686},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33686},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_67af957dced3; sha256 7559253dc1725a16ef9c8fb85c68f694d24d756d2f8f1919cd6fca0185efc67f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33686. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum linear-system algorithms access the coefficient matrix through a block-encoding oracle $U_A$ and the right-hand side through a state-preparation oracle $U_b$. The optimal query complexities of these two oracles are known separately: $O(\kappa\log(1/\varepsilon))$ queries to $U_A$ and $O(\kappa/s)$ queries to $U_b$, where $s=\alpha\|A^{-1}b\|$. Whether a single algorithm can achieve both bounds simultaneously has remained open. We resolve this question affirmatively. Given a constant-factor estimate of $s$, we give a quantum linear-system algorithm that prepares the normalized solution to error $\varepsilon$ using simultaneously $ O\left(\kappa\log\frac1\varepsilon\right)$ queries to $U_A$ and $O\left({\kappa}/{s}\right)$ queries to $U_b$. The algorithm separates state preparation from precision refinement, so only the matrix-query count depends on the target accuracy. We also prove a matching same-instance worst-case lower bound: for every quantum linear-system algorithm and every solution-norm scale, there exists a single Hermitian instance on which that algorithm requires both $\Omega(\kappa\log(1/\varepsilon))$ matrix queries and $\Omega(\kappa/s)$ state-preparation queries. Thus the two oracle complexities can be optimized simultaneously, and the resulting bounds are jointly optimal.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-29 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.33686 — 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-08T00:19:23.392Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).