Magic Square Enumeration: a Quantum Approach

Abstract

In this paper, a simplified version of the magic square is used to explore the use of quantum algorithms
in relation to their construction and enumeration. Grover’s algorithm is used for their construction,
and is found to be a reasonably good alternative to similar classical alternatives. For enumeration,
the quantum counting algorithm is successfully implemented for the simple square, but their use in
counting solutions for higher order squares is questioned. The full paper is available on GitHub.