[Paper Review] Reversible quantum cellular automata

Benjamin Schumacher, Reinhard F. Werner|ArXiv.org|May 28, 2004

Cellular Automata and Applications24 references105 citations

TL;DR

This paper proposes a rigorous framework for reversible quantum cellular automata (QCA) on infinite lattices with finite propagation speed and translation invariance. It establishes that all such QCAs are structurally reversible via a generalized Margolus partitioning scheme, ensuring the inverse of a nearest-neighbor QCA is also a nearest-neighbor automaton, and provides multiple construction methods using unitary symmetries, classical reversible automata, quantum circuits, and Clifford transformations.

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 unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.

Motivation & Objective

• To address foundational deficiencies in prior definitions of quantum cellular automata, particularly issues with infinite systems and ill-defined global unitaries.
• To establish a mathematically rigorous framework for QCAs based on observable algebras and the Heisenberg picture, avoiding state vector ambiguities in infinite systems.
• To characterize all local rules generating QCAs with finite propagation speed and translation invariance.
• To prove that all such QCAs are structurally reversible, i.e., invertible via a blockwise unitary scheme.
• To provide constructive methods for building QCAs from unitaries commuting with their translates, classical reversible automata, quantum circuits, and Clifford transformations.

Proposed method

• Define QCAs as infinite quantum lattice systems with discrete time dynamics that commute with lattice translations and have strictly finite propagation speed.
• Use the Heisenberg picture to describe the global time evolution as a *-automorphism on the observable algebra, ensuring localization of observables under time evolution.
• Characterize local rules generating QCAs via unitary operators that commute with lattice translations and preserve finite propagation.
• Introduce a generalized Margolus partitioning scheme where the lattice is divided into blocks, and unitary operations are applied blockwise, with time evolution alternating between partitions.
• Construct QCAs from unitaries that commute with their translates, showing such operators generate valid QCA time steps.
• Demonstrate that QCAs can be built from quantized reversible classical cellular automata, quantum circuits, and Clifford transformations on finite Weyl systems.

Experimental results

Research questions

• RQ1 What are the necessary and sufficient conditions for a local rule to generate a reversible quantum cellular automaton with finite propagation speed on an infinite lattice?
• RQ2 Can the inverse of a nearest-neighbor quantum cellular automaton always be realized as a nearest-neighbor automaton?
• RQ3 How can quantum cellular automata be systematically constructed from known quantum operations such as unitaries, circuits, or classical reversible rules?
• RQ4 To what extent do quantum random walks arise as special cases of quantum cellular automata?
• RQ5 What is the structural role of the generalized Margolus partitioning scheme in ensuring reversibility and finite propagation in QCAs?

Key findings

• All reversible quantum cellular automata with finite propagation speed and translation invariance are structurally reversible, meaning they can be decomposed into a sequence of blockwise unitary operations on a partitioned lattice.
• The inverse of a nearest-neighbor quantum cellular automaton is itself a nearest-neighbor automaton, a property not guaranteed in the classical case.
• A complete characterization of local rules generating such QCAs is provided, based on unitary operators that commute with lattice translations.
• Quantum random walks in the single-particle sector are shown to be special cases of quantum lattice gas automata, which are themselves QCAs with particle number conservation.
• Multiple construction methods are established: via translation-invariant unitaries, quantization of classical reversible automata, quantum circuits, and Clifford transformations on finite Weyl systems.
• The framework allows for a consistent description of QCAs in the Heisenberg picture, avoiding the ill-defined global unitary operations that plague earlier approaches.