Curator's Take
AI Commentary
This article shows that truly shallow (depth‑1) circuits built from only Pauli, CNOT or a single T/T† gate can form constant‑degree, constant‑gap quantum expanders—a hardware‑friendly construction that was previously thought to require much deeper layers. By leveraging these expanders the authors settle an open question about achieving the optimal entanglement‑gap scaling in 1D frustration‑free Hamiltonians and introduce a streaming test for volume‑law states that can be run on near‑term devices. The extension to unitary‑group expanders also tightens the spectral‑gap analysis of random walks on dense subgroups, sharpening earlier Bourgain–Gamburd results and opening new routes for efficient scrambling and benchmarking protocols. Readers should care because these tools bring mathematically powerful expander properties into the regime of circuits that current quantum processors can actually implement.
— Mark Eatherly
Summary
We construct a constant-degree and constant-gap quantum expander on $n$ qubits where each unitary can be implemented by a depth-$1$ and 1D circuit of Pauli or CNOT gates. We provide two applications of this expander. First, we use it to construct a family of frustration-free 1D Hamiltonians whose ground states obey the entanglement-gap relation $S = Θ(Δ^{-1/2})$; this is believed to be optimal, but achieving it had been open. Second, we use it to provide a streaming protocol that tests for closeness to a class of 1D volume-law entangled states. Moreover, we extend our quantum expander to a constant-degree and constant-gap expander on the unitary group where each unitary is a single $T$ gate, a single $T^{\dagger}$ gate, or a depth-$1$ Clifford circuit. This implies that a random sequence of unitaries from the expander yields a gapped walk on a dense subgroup of the unitary group. This improves upon previous work by Bourgain and Gamburd which did not control the dependence of the gap on the dimension.