Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing

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...

Full description

Saved in:

Bibliographic Details
Published in:	arXiv.org
Main Authors:	Ishikawa, Yuto, Yoshihara, Takuma, Okamura, Keita, Ohzeki, Masayuki
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 10.11.2023
Subjects:	Algorithms Cost function Optimization
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50
ISSN:	2331-8422
DOI:	10.48550/arxiv.2309.04792