arXiv (All)
open access
Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems
We develop quantum algorithms that construct block-encodings of solution matrices for continuous- and discrete-time algebraic Riccati equations (CAREs and DAREs), differential Riccati equations (DREs), and finite Riccati recursions. The Quantum Weighted Riesz Method, unifying four kinds of Riccati p
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
- Quantum Algorithms for Computational Fluid Dynamics#1145129
- Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints#1131911
- Linear combination of Schrödingerization for quantum linear systems with optimal matrix-query complexity#1014264
- Voxel-based block variational quantum linear solver: a hybrid quantum-classical method for static analysis of solids#1078279
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
Record · ID 1132408
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