Quantum Algorithm of Evolutionary Analysis of 1D Cellular Automata

B. Pavlyshenko

Quantum Algorithm of Evolutionary Analysis of 1D Cellular Automata

Quantum Physics 2010-01-28 v1

Authors: B. Pavlyshenko

Abstract

It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the elements of Grover's algorithm - the inversion of amplitude of searched states and unitary transform of inversion about the average. The inversion of searched states amplitudes can be performed by quantum Toffoli gate.

Keywords

cellular automata quantum search algorithms quantum algorithms

Cite

@article{arxiv.1001.4870,
  title  = {Quantum Algorithm of Evolutionary Analysis of 1D Cellular Automata},
  author = {B. Pavlyshenko},
  journal= {arXiv preprint arXiv:1001.4870},
  year   = {2010}
}

Comments

7 pages, 2 figures

Related papers

View all related →