Reversible quantum cellular automata
B. Schumacher, R.F. Werner

TL;DR
This paper characterizes quantum cellular automata as reversible, local, and finite-propagation quantum lattice systems, providing explicit rules, structural theorems, and various construction methods, including connections to quantum walks.
Contribution
It offers a comprehensive structural theorem for quantum cellular automata, showing their reversibility and providing explicit construction methods, extending classical automata concepts to the quantum domain.
Findings
Quantum cellular automata are structurally reversible.
All local rules generate global automata with periodic boundary conditions.
Quantum walks can be viewed as special cases of cellular automata.
Abstract
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · DNA and Biological Computing · Quantum-Dot Cellular Automata
