Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZX6F7XLGrecord.jsonopen to challenge →
read the original abstract
The negative solution to the famous problem of $36$ officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution, provided the officers are entangled, and construct orthogonal quantum Latin squares of this size. As a consequence, we find an example of the long-elusive Absolutely Maximally Entangled state AME$(4,6)$ of four subsystems with six levels each, equivalently a $2$-unitary matrix of size $36$, which maximizes the entangling power among all bipartite unitary gates of this dimension, or a perfect tensor with four indices, each running from one to six. This special state deserves the appellation golden AME state as the golden ratio appears prominently in its elements. This result allows us to construct a pure nonadditive quhex quantum error detection code $(\!(3,6,2)\!)_6$, which saturates the Singleton bound and allows one to encode a $6$-level state into a triplet of such states.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.