arXiv:2104.05122quant-ph
Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem
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.
The 1779 Euler puzzle: "Six army regiments each have six officers of six different ranks. Can the 36 officers be arranged in a 6-by-6 square so that no row or column repeats a rank or regiment?" Euler said it's impossible. The 1960 proof by mathematicians and computers: "It's…
emptybitsView on HNParent context
“So what is the goddamn solution???” It’s on page four: https://arxiv.org/pdf/2104.05122.pdf It might not mean much to you unless you take a deep excursion into rigorous math with Dirac notation and Hilbert spaces and God-knows-what. The quanta magazine article is there for you…
ehvatumView on HNParent context