Skip to content

Unital Noisy Random Circuit Uniformization

Claim/Theorem

Deshpande, Niroula, Shtanko, Gorshkov, Fefferman, and Gullans do not prove a blanket statement for all unital noisy random circuits; the theorem-level anchor is narrower. Their Theorem 2 (pp. 10-11) shows that for any parallel-circuit architecture with heralded-dephasing noise at rate p and dephasing parameter q, the circuit-averaged total-variation distance to the uniform distribution obeys E_B[delta] < (3^(2/3) / 2) n^(1/3) exp(-gamma p d / 3) with gamma = 8 q (1 - q) / 3, so this specific unital noise model drives outputs exponentially toward uniformity with depth. Their Theorem 3 (p. 11) simultaneously shows that sublogarithmic depth remains poorly anticoncentrated even under local Pauli noise. For the noiseless comparison, Dalzell, Hunter-Jones, and Brandao prove architecture-dependent upper bounds: Theorem 1 (p. 4) gives O(log n) depth for the 1D nearest-neighbor architecture, Theorem 2 (p. 4) gives a complete-graph bound, and Theorem 3 (p. 4) gives only a weaker Theta(n^2)-gate bound for general regularly connected architectures. The Conjecture 1 contrast is therefore between architecture-dependent noiseless anticoncentration and architecture-independent uniformization for the specific heralded-dephasing model, not a generic log-depth theorem for all noiseless architectures.

Dependencies

  • None.

Conflicts/Gaps

  • This node is a contrast principle, not the target theorem.
  • The Deshpande et al. upper bound used here is for heralded dephasing, not arbitrary unital noise; their low-depth obstruction is proved for local Pauli noise.
  • The Dalzell et al. comparison theorem is architecture-sensitive: only the 1D nearest-neighbor result is explicitly O(log n) depth, while the general regularly connected theorem is weaker.
  • The combination of two papers is deliberate here because the mathematical insight is comparative: Conjecture 1 sits between the noiseless anticoncentration regime and the unital-noise uniformization regime.

Sources

  • 10.1103/PRXQuantum.3.040329 (Theorem 2, pp. 10-11; Theorem 3, p. 11; verified against the local PDF bundle built from the Zotero attachment)
  • 10.1103/PRXQuantum.3.010333 (Theorem 1, p. 4; Theorem 2, p. 4; Theorem 3, p. 4; verified against the local PDF bundle built from the Zotero attachment)