Solving tiling puzzles with quantum annealing
Quantum Physics
2019-04-04 v1 Computational Complexity
Abstract
To solve tiling puzzles, such as "pentomino" or "tetromino" puzzles, we need to find the correct solutions out of numerous combinations of rotations or piece locations. Solving this kind of combinatorial optimization problem is a very difficult problem in computational science, and quantum computing is expected to play an important role in this field. In this article, we propose a method and obtained specific formulas to find solutions for tetromino tiling puzzles using a quantum annealer. In addition, we evaluated these formulas using a simulator and using actual hardware DW2000Q.
Keywords
Cite
@article{arxiv.1904.01770,
title = {Solving tiling puzzles with quantum annealing},
author = {Asa Eagle and Takumi Kato and Yuichiro Minato},
journal= {arXiv preprint arXiv:1904.01770},
year = {2019}
}
Comments
7 pages, 10 figures