← Back to Blogs
Peter Cameron

Quantum solutions to Euler’s 36 officers

Here is a 3-paragraph summary of the blog post:

Euler's 36 Officers Problem is a classic puzzle that has fascinated mathematicians for centuries. The challenge is to arrange 36 officers, drawn from six different ranks and six different regiments, in a 6x6 grid so that each row and column contains exactly one officer from each rank and one from each regiment. Euler himself conjectured in 1779 that no such arrangement was possible, and this was later confirmed in 1901. The problem is deeply connected to the concept of mutually orthogonal Latin squares, a fundamental idea in combinatorics.

Now, mathematicians Simeon Ball and Robin Simoens have taken the problem into the quantum realm, finding that a solution does exist when quantum mechanics is allowed to enter the picture. In their new paper, they demonstrate a quantum solution using the framework of quantum information theory, where officers can exist in superpositions of rank and regiment combinations. This builds on earlier work from 2021, which first established that a quantum solution was possible, and now provides a more complete and structured understanding of what those quantum solutions look like.

The result is a striking example of how quantum thinking can unlock possibilities that are strictly forbidden in classical mathematics. It highlights the growing intersection between quantum information theory and combinatorics, a trend that is opening up exciting new questions across both fields. For those interested in Latin squares, quantum entanglement, or the history of mathematical puzzles, this paper offers a fascinating glimpse into how ancient problems can find new life through a modern lens.

Read original →