arXiv (All)
open access
An analysis of iterative refinement for quantum linear system solvers
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 quantu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unified formalism and adaptive algorithms for optimal quantum state, detector and process tomography#998009
- Classical-Quantum Algorithm for Solving Stochastic Programs#631401
- Oracle Synthesis Based on X-Map Decision Diagrams#1034831
- A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code#183143
- A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code#183093
Record · ID 997149
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive