arXiv (All)
open access
On State Distinguishing Without Inverse Queries
In the quantum state distinguishing problem, an algorithm is given copies of a state $|ψ\rangle$ or $|ϕ\rangle$ separated by trace distance $\varepsilon$, and tasked with deciding which is the case. It is a standard result that $Θ(\varepsilon^{-2})$ copies are required, while having access to a unit
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
- Sequential Semi-Device-Independent Quantum Randomness Certification#927182
- Certifying Measurement Incompatibility under Bounded Classical Communication#1215809
- Approximate cloning of structured pure states#1215810
- Testing bosonic and fermionic Gaussian states with a constant number of copies#1215880
- Optimal learning of covariant quantum states and channels#1144247
Record · ID 1201402
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