arXiv (All)
open access
A mixing time method for estimating the sample complexity of quantum state discrimination
We develop a mixing time method for estimating the sample complexity of quantum state discrimination. We start with considering the minimum-error discrimination of geometrically uniform pure state ensembles, and prove that its sample complexity has a tight estimate given by a quantum homogeneous mix
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
- Criteria for unbiased estimation: applications to noise-agnostic sensing and quantum channel estimation#1116089
- Distinct Feedback-Strength Requirements for Quantum-State Ensemble Preparation under Channel-Equivalent Monitoring#1105779
- Correlations, spectra, and entanglement transitions in ensembles of matrix product states#218275
- Accessible Quantum Correlations Under Complexity Constraints#1144784
- When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis#366309
Record · ID 1154447
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