Quantum Algorithm of Evolutionary Analysis of 1D Cellular Automata
arXiv:1001.4870
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.
7 pages, 2 figures
References in corpus (8)
- Grover's quantum searching algorithm is optimal
- Reversible quantum cellular automata
- Local Unitary Quantum Cellular Automata
- On the structure of Clifford quantum cellular automata
- Reversible universal quantum computation within translation invariant systems
- Grover's Algorithm: Quantum Database Search
- Introduction to Quantum Cellular Automata
- Intrinsically universal one-dimensional quantum cellular automata in two flavours