arXiv (OAI Expanded)
open access
Quantum channel discrimination against jammers
We study the problem of quantum channel discrimination between two channels with an adversary input party (a.k.a. a jammer). This setup interpolates between the best-case channel discrimination as studied by (Wang & Wilde, 2019) and the worst-case channel discrimination as studied by (Fang, Fawzi, &
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 channel discrimination against jammers#924461
- Minimax games for quantum channel discrimination#996657
- Algebraic Kolmogorov--Arnold representation theorem for quantum measurement#1083111
- Static and dynamic jamming games over wireless channels with mobile strategic players#987354
- Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model#1116934
Record · ID 920230
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