arXiv:2610.12001
Exact value and rigidity of the $2\times3$ magic rectangle
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
Abstract
The $2\times3$ magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. Its quantum value was suggested by numerical bounds and known quantum random access codes. We prove that this value is $(1+\sqrt{2/3})/2$ and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements: up to local isometries and ancillary systems, each contains a maximally entangled pair of four-dimensional systems with fixed measurements on the local state supports. The same value holds for commuting-operator strategies and for the almost-quantum relaxation, confirming the Adamson--Wallden conjecture for this rectangle. For finite-dimensional magic-square strategies, the largest score compatible with perfect prediction of Alice's complete first row by an adversary with quantum side information is one third plus two thirds of the rectangle value. We classify the strategies attaining this threshold with perfect prediction and give linear-order upper and lower bounds on one minus the best compatible guessing probability above it. The rectangle value is also the optimal average success probability of finite-dimensional three-bit random access codes that hide the full input parity, and we classify all optimal codes.
AI Summary
The paper determines the quantum value and optimal-strategy structure of the uniform $2\times3$ magic-rectangle game, whose classical value is $5/6$ and whose conjectured quantum value was supported by numerical bounds and random-access-code constructions. It proves $\omega_Q=(1+\sqrt{2/3})/2\approx0.908248$, also for commuting-operator strategies and the almost-quantum relaxation. An explicit sum-of-squares identity establishes the dimension-independent upper bound. Its equality conditions classify every optimal finite-dimensional strategy, including arbitrary POVMs: local isometries extract $|\Phi_4\rangle$, decoupled from adversarial side information, and fix the measurements on occupied local supports. Thus optimal strategies require local dimension at least four and certify two private bits in either Alice row. For the magic square, the largest score allowing perfect adversarial prediction of Alice’s complete first row is $\beta_0=(2+\sqrt{2/3})/3\approx0.938832$. This follows by reducing the remaining rows to a rectangle; equality strategies are also classified. Above threshold, $p_{\mathrm{guess}}\leq1-\frac92(w-\beta_0)$. Flagged mixtures establish that the optimal predictability deficit and minimum compatible conditional min-entropy and von Neumann entropy all scale linearly with score excess near threshold. Remote preparation transfers the value and classification to three-bit random access codes hiding only the full input parity, in arbitrary finite encoding dimension. Approximate parity hiding admits dimension-independent success bounds. The classifications are exact and finite-dimensional; robust extraction is left open. The full score–guessing-probability tradeoff, sharp threshold slope, and larger two-row rectangle conjecture remain unresolved. The entropy bound improves earlier numerical bounds only near threshold.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 25 pages, 1 figure