Metraipolis › archive › dc_54ff805aea37
Multiplicative Semidefinite Programming Upper Bounds on Quantum No-Signalling-Assisted Zero-Error Capacity — arXiv:2610.21071
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21071
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:34:51.034Z
- SHA-256 of the archived text
918bdea34300d5f22ab076a3e7ca15959522fe2371400945a05bfb3153735d4c- Stable URL of this page
https://metraipolis.com/documento/dc_54ff805aea37
How to cite
Multiplicative Semidefinite Programming Upper Bounds on Quantum No-Signalling-Assisted Zero-Error Capacity — arXiv:2610.21071 — arXiv (en), https://arxiv.org/abs/2610.21071 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_54ff805aea37 (Metraipolis archive dc_54ff805aea37, sha256 918bdea34300d5f22ab076a3e7ca15959522fe2371400945a05bfb3153735d4c)
BibTeX
@misc{dc54ff805aea37,
title = {Multiplicative Semidefinite Programming Upper Bounds on Quantum No-Signalling-Assisted Zero-Error Capacity — arXiv:2610.21071},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21071},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_54ff805aea37; sha256 918bdea34300d5f22ab076a3e7ca15959522fe2371400945a05bfb3153735d4c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21071. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study zero-error communication and exact simulation of quantum channels assisted by quantum no-signalling correlations. For a channel with Kraus operator space $K$, we introduce a semidefinite programming parameter $\Gamma(K)$ that is exactly multiplicative under tensor products and upper-bounds $\Theta_{\rm NS}(K)$, where $\log_2\Theta_{\rm NS}(K)=C_{0,\rm NS}(K)$ and $C_{0,\rm NS}(K)$ denotes the asymptotic quantum no-signalling-assisted zero-error capacity. Among known upper bounds on $\Theta_{\rm NS}$ given by semidefinite programs, $\Gamma$ is the tightest. We also prove that the previously introduced simulation lower bound $\Sigma^{-}(K)$ is exactly multiplicative and satisfies $\Theta_{\rm NS}(K)\leq\Gamma(K)\leq\Sigma^{-}(K)\leq\Gamma(K)^2$. Using this multiplicativity, we show that neither $S_{0,\rm NS}(K)=\log_2\Sigma^{-}(K)$ nor its regularized extension $S_{0,\rm NS}(K)=\lim\nolimits_{n\to\infty}n^{-1}\log_2\Sigma^{-}(K^{\otimes n})$ holds in general. This answers an open question about the asymptotic simulation cost $S_{0,\rm NS}(K)$. For classical-quantum channels, we obtain sharp bounds. If $r$ is the effective output dimension, then $\Theta_{\rm NS}\leq\Gamma\leq(1+r^{1/2})\Theta_{\rm NS}/2$ and $\Gamma\leq\Sigma^{-}\leq(1+r^{1/2})\Gamma/2$. If $k$ is the minimum rank of the output support projections, then $\Sigma^{-}/\Theta_{\rm NS}\leq[(1+r^{1/2})/(1+k^{1/2})]^2$, and this bound is sharp for every $1\leq k\leq r$. Thus, we obtain the sharp bound $S_{0,\rm NS}-C_{0,\rm NS}\leq2\log_2[(1+r^{1/2})/(1+k^{1/2})]$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.21071 — 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-10-16T08:51:02.591Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).