A geometric view of quantum cellular automata

Nielsen, et al.^{1, 2} proposed a view of quantum computation where determining optimal algorithms is equivalent to extremizing a geodesic length or cost functional. This view of optimization is highly suggestive of an action principle of the space of N-qubits interacting via local operations. The cost or action functional is given by the cost of evolution operators on local qubit operations leading to causal dynamics, as in Blute et. al.³ Here we propose a view of information geometry for quantum algorithms where the inherent causal structure determines topology and information distances^{4, 5} set the local geometry. This naturally leads to geometric characterization of hypersurfaces in a quantum cellular automaton. While in standard quantum circuit representations the connections between individual qubits, i.e. the topology, for hypersurfaces will be dynamic, quantum cellular automata have readily identifiable static hypersurface topologies determined via the quantum update rules. We demonstrate construction of quantum cellular automata geometry and discuss the utility of this approach for tracking entanglement and algorithm optimization.