Presenter: Adam Hunt, College of Science, Engineering, and Technology, Computing and Design
Authors: Adam Hunt, Jesse Hicks, McKay Sullivan
Faculty Advisors: Jesse Hicks, College of Science, Engineering, and Technology, Mathematics
Institution: Dixie State University
The Rubik’s Cube is a puzzle toy that has garnered significant interest from the computing and mathematics communities. Analyses of the cube often view it in terms of a mathematical group. The Rubik’s Cube group has been extensively explored, leading to efficient search algorithms for Rubik’s Cube solving. When limited to classical computation, finding a solution is relatively easy, but it has been shown that finding optimal solutions can be difficult and even non-optimal solution searching can become infeasible for similar groups of larger magnitudes. This presentation shares the results of an inquiry into the utility of quantum computing in the search for solutions in the Rubik’s Cube and related groups.