Short remarks on shallow unitary circuits
Jeongwan Haah
TL;DR
The paper demonstrates that shallow symmetric quantum circuits cannot emulate global Haar-random unitaries when a local conserved charge exists, requiring depth linear in system size for accurate symmetric unitary designs. It then presents a constructive shallow-circuit learning framework based on Arrighi’s identity, showing how to extract the action of a shallow unitary on local Pauli operators via quantum tomography, with extensions to quantum cellular automata (QCA) and considerations of locality/spread. Finally, it provides a new proof that translation-invariant QCAs in any dimension admit staircase implementations with only $O(n)$ local gates, using invertible subalgebra pumping and a dimensional induction, and discusses the implications for QCA triviality and circuit-depth tradeoffs. Collectively, the work clarifies when shallow circuits can mimic randomness under symmetry constraints, offers practical learning protocols for shallow unitaries, and establishes linear gate-count realizations for QCAs across dimensions, highlighting open problems in efficient conversions between QCAs and staircase circuits.
Abstract
(i) We point out that every local unitary circuit of depth smaller than the linear system size is easily distinguished from a global Haar random unitary if there is a conserved quantity that is a sum of local operators. This is always the case with a continuous onsite symmetry or with a local energy conservation law. (ii) We explain a simple algorithm for a formulation of the shallow unitary circuit learning problem and relate it to an open question on strictly locality-preserving unitaries (quantum cellular automata). (iii) We show that any translation-invariant quantum cellular automaton in $D$-dimensional lattice of volume $V$ can be implemented using only $O(V)$ local gates in a staircase fashion using invertible subalgebra pumping.
