AUTHOR=Ishikawa Yuto , Yoshihara Takuma , Okamura Keita , Ohzeki Masayuki TITLE=Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing JOURNAL=Frontiers in Computer Science VOLUME=5 YEAR=2023 URL=https://www.frontiersin.org/journals/computer-science/articles/10.3389/fcomp.2023.1285962 DOI=10.3389/fcomp.2023.1285962 ISSN=2624-9898 ABSTRACT=

In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficulty mazes, we introduce an additional cost function Qupdate to increase the difficulty. The difficulty of the mazes was evaluated by the time to solve the maze of 12 human subjects. To check the efficiency of our scheme to create the maze, we investigated the time-to-solution of a quantum processing unit, classical computer, and hybrid solver. The results show that Qupdate generates difficult mazes tailored to the individual. Furthermore, it show that the quantum processing unit is more efficient at generating mazes than other solvers. Finally, we also present applications how our results could be used in the future.