Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exact value and rigidity of the 2×32\times3 magic rectangle

Published 8 Oct 2026 in quant-ph | (2610.12001v1)

Abstract: The 2×32\times3 magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. We prove that its quantum value is (1+2/3)/2(1+\sqrt{2/3})/2 and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements. Every optimal strategy contains a maximally entangled pair of four-dimensional systems, with fixed measurements on the local state supports up to local isometries and ancillary systems. The attaining construction was previously known from quantum random access codes. An exact sum-of-squares identity gives the upper bound, and its equality relations determine the measurement algebra needed for the classification. The rectangle determines the largest magic-square score compatible with perfect prediction of Alice's first row by an adversary with quantum side information. We classify all finite-dimensional strategies attaining this score with perfect prediction and show that one minus the best compatible guessing probability has linear order in the score excess above it. The same rigidity theorem classifies all optimal three-bit random access codes that hide the full input parity.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.