arXiv (All)
open access
Stronger Welch Bounds and Optimal Approximate $k$-Designs
The question of how well a finite ensemble of quantum states can approximate Haar randomness is relevant in many areas of quantum physics. Here we consider this problem from a geometrical perspective, via the notion of Welch bounds. The latter are a set of inequalities, originally derived in the con
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
- Centralised multi link measurement compression with side information#1011934
- Analytic Maximal Violation of Extended MABK Inequalities for Generalized GHZ States#822452
- Time-space lower bounds for breaking quantum cryptography#1160915
- Time-space lower bounds for breaking quantum cryptography#1157449
- On the Nazarov--Shcheglova Conjecture for Sharp Sobolev Inequalities: The Case (n,p)=(3,2)#1128782
Record · ID 1141487
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