arXiv (All)
open access
An Optimal Quantum Linear Systems Algorithm
In the quantum linear systems problem (QLSP), we are given query access to a $d$-sparse $N\times N$ matrix $A$ with condition number $κ$, and the ability to prepare a quantum state proportional to a vector $\vec b$. The goal is to output an $ε$-approximation to the quantum state proportional to the
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
- Simultaneously Query-Optimal Quantum Linear-System Algorithm#1118759
- Fundamental Limits on QBER and Distance in Quantum Key Distribution#998113
- 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
- A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code#183043
Record · ID 1130314
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