Metraipolis › archive › dc_71d8a984399f
An Unbounded Separation of Almost-Quantum and Commuting-Operator Correlations in Zero-Error Communication — arXiv:2610.41448
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41448
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:08:17.170Z
- SHA-256 of the archived text
abd85d40db05edf88bf164b64c81208ecce60751d38ba454fc672546eaaa9127- Stable URL of this page
https://metraipolis.com/documento/dc_71d8a984399f
How to cite
An Unbounded Separation of Almost-Quantum and Commuting-Operator Correlations in Zero-Error Communication — arXiv:2610.41448 — arXiv (en), https://arxiv.org/abs/2610.41448 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71d8a984399f (Metraipolis archive dc_71d8a984399f, sha256 abd85d40db05edf88bf164b64c81208ecce60751d38ba454fc672546eaaa9127)
BibTeX
@misc{dc71d8a984399f,
title = {An Unbounded Separation of Almost-Quantum and Commuting-Operator Correlations in Zero-Error Communication — arXiv:2610.41448},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41448},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71d8a984399f; sha256 abd85d40db05edf88bf164b64c81208ecce60751d38ba454fc672546eaaa9127},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41448. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Almost-quantum correlations form the $\mathtt{1+AB}$ level of the Navascués--Pironio--Acín hierarchy. They strictly contain the quantum set, are characterized by a single semidefinite program, arise in Sorkin's quantum measure theory, and satisfy several principles proposed to single out quantum theory. We show that they are nevertheless unboundedly stronger than quantum correlations in a zero-error communication task. Alice and Bob receive labels $s,t\in[N]$, $N\ge3$; after one bit from Alice, Bob must decide whether $s=t$, never erring but allowed to abstain. For every model of quantum correlations, from finite-dimensional tensor products to commuting operators, the optimal worst-case probability of a conclusive answer is exactly $1/N$, the value attained with shared randomness, so the bound does not depend on the resolution of Tsirelson's problem. An explicit family of almost-quantum correlations attains $1/19$ for every $N$. For certificates of equality from binary-outcome boxes, we solve the underlying semidefinite programs in closed form. The almost-quantum optimum equals $N^2/(17N^2-80N+64)$ for $N\ge8$ and tends to $1/17$. The first level of the hierarchy, which coincides with the set singled out by macroscopic locality, attains $N/[8(N-2)]$, which tends to $1/8$; its optimal boxes lie outside the almost-quantum set for every $N\ge5$. For longer messages, entanglement saves at most one bit over shared randomness, whereas almost-quantum correlations reduce the one-way zero-error cost of deciding equality of $n$-bit strings from $n$ bits to at most $13$. The quantum bound also yields a linear witness of post-quantumness on a face of the nonsignalling polytope.
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/2610.41448 — 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-02T07:47:00.748Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).