Curator's Take
AI Commentary
This article shows that even when one augments shallow nearest‑neighbour circuits with “ambient” unitaries or ancilla qubits, they still cannot approximate unitary designs for the matchgate, orthogonal, symplectic and Clifford families unless the circuit depth scales linearly with system size. By proving a fundamental depth lower bound, it explains why recent tomography and benchmarking protocols that rely on these subgroup samples incur a much larger overhead than analogous schemes using full random unitaries. The result also confirms that existing linear‑depth constructions for such designs are essentially optimal, guiding hardware designers toward realistic expectations for shallow‑circuit randomness.
— Mark Eatherly
Summary
Characterising the efficiency with which designs over various subsets of the unitary group may be constructed is an important goal of quantum information theory. While it is now known that approximate unitary designs can be realised in depth logarithmic in the system size, it has recently been shown that ensembles of local nearest-neighbour sublinear-depth one-dimensional circuits over the matchgate, orthogonal, and symplectic groups cannot form approximate 2-designs over their parent groups; similarly, sublinear-depth ensembles of Cliffords cannot form a Clifford 4-design. In this note we show that this remarkable exponential separation is not merely an artefact of restricting to ensembles consisting of unitaries from the subgroups themselves, but rather that no ensemble of local nearest-neighbour sublinear-depth unitaries can realise approximate designs in the aforementioned cases, even when employing "ambient" unitaries from beyond the subgroup itself (possibly acting on ancilla qubits). This implies that various natural tomography and benchmarking schemes which involves sampling from these groups suffer from a dramatic circuit depth overhead compared to similar protocols which involve sampling from the full unitary group. We additionally conclude that, in all of the above cases, the known linear-depth design constructions are up to constant factors optimal.