9 $\times$ 4 = 6 $\times$ 6: Understanding the quantum solution to the Euler's problem of 36 officers

Karol Życzkowski, Wojciech Bruzda, Grzegorz Rajchel-Mieldzioć +3

The famous combinatorial problem of Euler concerns an arrangement of $36$ officers from six different regiments in a $6\times 6$ square array. Each regiment consists of six office…