Complexity of Local Quantum Circuits under Nonunital Noise

It is widely accepted that noisy quantum devices are limited to logarithmic depth circuits unless mid-circuit measurements and error correction are employed. However, this conclusion holds only for unital error channels, such as depolarizing noise. Building on the idea of the "quantum refrigerator" [Ben-Or, Gottesman and Hassidim (2013)], we improve upon previous results and show that geometrically local circuits in the presence of nonunital noise, in any dimension $d\geq 1$, can correct errors without mid-circuit measurements and extend computation to any depth, with only polylogarithmic overhead in the depth and the number of qubits. This implies that local quantum dynamics subjected to sufficiently weak nonunital noise is computationally universal and nearly as hard to simulate as noiseless dynamics. Additionally, we quantify the contraction property of local random circuits in the presence of nonunital noise.