Cellular Automata on Quantum Annealing Systems
Quantum Physics
2021-01-08 v1
Abstract
We present herein an introduction to implementing 2-color cellular automata on quantum annealing systems, such as the D-Wave quantum computer. We show that implementing nearest-neighbor cellular automata is possible. We present an implementation of Wolfram's cellular automata Rule 110, which has previously been shown to be a universal Turing machine, as a QUBO suitable for use on quantum annealing systems. We demonstrate back-propagation of cellular automata rule sets to determine initial cell states for a desired later system state. We show 2-D 2-color cellular automata, such as Conway's Game of Life, can be expressed for quantum annealing systems.
Keywords
Cite
@article{arxiv.2101.02309,
title = {Cellular Automata on Quantum Annealing Systems},
author = {Robert A. Dunn},
journal= {arXiv preprint arXiv:2101.02309},
year = {2021}
}
Comments
21 pages, 11 figures