Metraipolis › archive › dc_4ff22c4dc31a
Norm Bounds on Sums of Positive Operators with Applications to Monogamy Games and Quantum Key Distribution — arXiv:2611.05943
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05943
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:32:48.756Z
- SHA-256 of the archived text
85f7729042dfae7f965cc297e1fd8f7433fa1eb447ee3dca102fb21851dd6d5d- Stable URL of this page
https://metraipolis.com/documento/dc_4ff22c4dc31a
How to cite
Norm Bounds on Sums of Positive Operators with Applications to Monogamy Games and Quantum Key Distribution — arXiv:2611.05943 — arXiv (en), https://arxiv.org/abs/2611.05943 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ff22c4dc31a (Metraipolis archive dc_4ff22c4dc31a, sha256 85f7729042dfae7f965cc297e1fd8f7433fa1eb447ee3dca102fb21851dd6d5d)
BibTeX
@misc{dc4ff22c4dc31a,
title = {Norm Bounds on Sums of Positive Operators with Applications to Monogamy Games and Quantum Key Distribution — arXiv:2611.05943},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05943},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ff22c4dc31a; sha256 85f7729042dfae7f965cc297e1fd8f7433fa1eb447ee3dca102fb21851dd6d5d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05943. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Bounding the acceptance probabilities of quantum measurements is a recurring task in quantum information theory. An acceptance probability averaged over a random measurement setting can be bounded uniformly over the input state by the operator norm of an average of positive semidefinite operators. We prove a general inequality for such norms, valid for arbitrary finite families of positive semidefinite operators and averaging distributions. We give two applications of our operator-norm inequality. First, we determine the sharp robustness threshold for the parallel BB84 monogamy-of-entanglement game. For error thresholds $\beta,\gamma\in[0,1/2]$, when the two players may make at most $\beta n$ and $\gamma n$ errors, respectively, the optimal winning probability decays exponentially if $(1-2\beta)^2+(1-2\gamma)^2>1$, tends to one exponentially fast under the reverse strict inequality, and remains bounded away from zero on the boundary. Second, we establish the achievability of every asymptotic key rate $0<R<1- 2h_2(\gamma)$ for one-sided device-independent BB84 quantum key distribution with tolerated bit-error rate $\gamma$ and asymptotically optimal reconciliation, where $h_2(\cdot)$ is the binary entropy function. Alice's measurements are trusted, while Bob may perform an arbitrary joint measurement depending on the entire basis string, subject to the protocol's receipt and isolation requirements. This recovers the usual BB84 rate in this model. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2611.05943 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-05T18:22:49.016Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).