arXiv:2609.20746
Mermin-Peres magic rectangles modulo odd primes
Josse van Dobben de Bruyn, Remy van Dobben de Bruyn, Peter Zeman
Abstract
The Mermin-Peres magic square provides a simple example of a system of linear equations over $\mathbb{Z}/2\mathbb{Z}$ which has no classical solutions but does have a finite-dimensional operator solution. For a long time, it was not known how to construct similar examples over $\mathbb{Z}/d\mathbb{Z}$ with $d$ odd. In this paper, we construct, for every integer $d \geq 2$, a linear system over $\mathbb{Z}/d\mathbb{Z}$ that has a finite-dimensional operator solution but no classical solution. For an odd prime $p$, our operators act on two $p$-dimensional qudits and generate a finite $p$-group obtained by adjoining diagonal polynomial phase operators to the generalized Pauli group, thereby forming a natural analogue of the Mermin--Peres magic square. Classical inconsistency follows from an elementary linearity argument comparing assignments on abelian subgroups. Furthermore, we prove a sharp threshold for the required degree of the added polynomial phase operators: our construction uses polynomials up to degree $p - 1$, and we show that the group formed by polynomials up to degree $p - 2$ is noncontextual.
AI Summary
The paper studies whether linear constraint systems over $\mathbb Z/d\mathbb Z$ can have finite-dimensional operator solutions but no classical solutions when $d$ is odd—an analogue of Mermin–Peres magic-square pseudotelepathy. It constructs such systems for every integer $d\geq2$, extending previously known finite-dimensional examples for small odd primes. For each odd prime $p$, the construction uses two $p$-dimensional qudits, with Hilbert-space dimension $p^2$. The operator group is $G_{p,p-1}$, obtained by adjoining diagonal phases $D_f|z\rangle=\omega^{f(z)}|z\rangle$ for bivariate polynomials of total degree at most $p-1$ to the generalized Pauli group. A universal linear system encodes multiplication of commuting order-$p$ elements. Classical inconsistency follows by showing that any assignment additive on commuting pairs must assign zero to the central phase representing one. The proof compares assignments on polynomially parametrized abelian subgroups using finite differences and a linearity lemma. Composite moduli follow by lifting a system from a prime divisor. A matching noncontextuality result shows that degree at most $p-2$ cannot yield pseudotelepathy within this group family, for any number of qudits, via an explicit assignment additive on commuting pairs. This threshold is specific to the stated polynomial-phase construction, not a general bound on operator solutions. Independent proofs of existence for all moduli are noted; their reported dimensions, $2p$ and $p$, are smaller than $p^2$ here. The general construction encodes the finite group rather than giving a comparably small rectangle for every prime.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 15 pages. v2: added Section 6, added citation of Frembs paper, minor improvements to the exposition