arXiv (All)
open access
Optimal Lower Bound on the Sample Complexity of Coherent Classical Shadows for Mixed States
We study coherent classical shadows protocols for an unknown $d$-dimensional quantum state of rank at most $r$, allowing an arbitrary joint measurement on all available copies. For observables with operator norm at most one and centered squared Frobenius norm at most $F$, we study the minumum number
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 incapacity from observable shadows#1202171
- Criteria for unbiased estimation: applications to noise-agnostic sensing and quantum channel estimation#1116089
- Fidelity Estimation to a Known Quantum State Is Nearly Quadratic in the Smaller Rank#1155277
- A pretty-tight converse on the classical capacity of generalized amplitude-damping channels#1084561
- Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback#1155375
Record · ID 1343228
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