Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing

Abstract

In this paper, 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 difficult mazes, we introduce an additional cost function $Q_{update}$ 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.

20pages, 15figures

References in corpus (7)

• Quantum Annealing for Combinatorial Clustering
• Item Listing Optimization for E-commerce Websites based on Diversity
• Simulated quantum annealing as a simulator of non-equilibrium quantum dynamics
• Fair Sampling by Simulated Annealing on Quantum Annealer
• Efficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing
• Virtual Screening of Chemical Space based on Quantum Annealing
• Maximum-Likelihood Channel Decoding with Quantum Annealing Machine