Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchComunicații cuantice

analiza aiqbench

This paper establishes the exact asymptotic winning probability bounds for classical strategies in repeated CHSH games, confirming long-standing conjectures regarding quantum-classical gaps in XOR protocols. By rigorously defining these limits, the work provides a foundational reference point for analyzing non-local correlations and their implications for future quantum communication architectures.
Surse care acoperăarXiv, LessWrong, Quantum Zeitgeist
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Optimal bounds on the classical value of the repeated CHSH game

arXiv1 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2608.16439v1 Announce Type: new Abstract: We show that the maximum winning probability in the repeated CHSH game for classical strategies is at most $\left(\frac{1+\sqrt{5}}{4}\right)^n$. Together with a matching lower bound by Barak et al. (FOCS'2008), this determines the asymptotic value of the repeated CHSH game exactly. We also show that, if an XOR game has a gap between classical and quantum values, there is also a gap between the asymptotic values for the repeated game.

Abstract:We show that the maximum winning probability in the repeated CHSH game for classical strategies is at most $\left(\frac{1+\sqrt{5}}{4}\right)^n$. Together with a matching lower bound by Barak et al. (FOCS'2008), this determines the asymptotic value of the repeated CHSH game exactly. We also show that, if an XOR game has a gap between classical and quantum values, there is also a gap between the asymptotic values for the repeated game.

arXiv:2608.16439 [quant-ph]

(or arXiv:2608.16439v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.16439 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 161 cuvinte

Subiecte conexe