arXiv (All)
open access
On Information Propagation in Krylov Subspaces
Krylov subspace methods provide an efficient tool for modeling any quantum initial value problem as a one dimensional chain. A time ordered path formulation, in which the dynamical generator successively splits probability between paths, yields a speed limit within such dynamical subspaces. For powe
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
- Belavkin-Staszewski Quantum Markov Chains#464357
- An Application of neutrix calculus to quantum field theory#498723
- Time-energy uncertainty relation for noisy quantum metrology#254278
- Dissipation-Enabled Operator-Norm Locality Bounds for Bose-Hubbard Hamiltonians#1156940
- From Krylov complexity to observability: Capturing phase space dimension with applications in quantum reservoir computing#205180
Record · ID 1199157
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