arXiv (All)
open access
Learning Sparse Quantum States
We study the problem of tomography for $k$-sparse quantum states. In contrast to classical distribution learning, where tight sample and time complexity bounds in terms of support size are well understood, no non-trivial bounds were previously shown for this problem. We give the first near optimal a
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
- Identifiability in Quantum State, Process, and Network Tomography#1071361
- Quantum tomography at the Electron-Ion Collider#1117131
- Randomized Jacobi-Davidson method#1077579
- Constructive Tchakaloff results and well-conditioned quadrature through randomized least squares#987247
- Inverse spectral problems for positive Hankel operators#147074
Record · ID 1000182
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