arXiv (All)
open access
Linear combination of Schrödingerization for quantum linear systems with optimal matrix-query complexity
Quantum linear systems algorithms (QLSAs) aim to solve linear systems $A\bb{x}=\bb{b}$ exponentially faster than classical methods under certain conditions. In this work, we develop quantum algorithms for solving linear algebraic equations from an ODE-based perspective. Inspired by the linear combin
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
- Schrödingerization for quantum linear systems problems with near-optimal dependence on matrix queries#139229
- Quantum Eigenvalue Transformations for Arbitrary Matrices#820433
- Distributed Variational Quantum Linear Solver#819346
- Distributed Variational Quantum Linear Solver#809353
- A Quantum Bluestein's Algorithm for Arbitrary-Size Quantum Fourier Transform#1052063
Record · ID 1014264
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