Metraipolis › archive › dc_5bd97c60bec5

Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings — arXiv:2608.18536

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.18536
License (as archived)
CC0-1.0
Archived
2026-10-18T13:59:13.052Z
SHA-256 of the archived text
ba4637fcaa378cc2d5ca7b46f1c321c15e9bb5ee8e4b7a9ccccb83ff484faea8
Stable URL of this page
https://metraipolis.com/documento/dc_5bd97c60bec5

How to cite

Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings — arXiv:2608.18536 — arXiv (en), https://arxiv.org/abs/2608.18536 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5bd97c60bec5 (Metraipolis archive dc_5bd97c60bec5, sha256 ba4637fcaa378cc2d5ca7b46f1c321c15e9bb5ee8e4b7a9ccccb83ff484faea8)
BibTeX
@misc{dc5bd97c60bec5,
  title = {Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings — arXiv:2608.18536},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.18536},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5bd97c60bec5; sha256 ba4637fcaa378cc2d5ca7b46f1c321c15e9bb5ee8e4b7a9ccccb83ff484faea8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18536. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Encoding quantum information with low circuit overhead is a fundamental challenge in fault-tolerant quantum computation. Random circuits provide a natural mechanism for rapidly spreading logical information through simple gates applied in parallel. Brown and Fawzi showed that random Clifford circuits on two-qubit Clifford gates provide such encoders that achieve the quantum Gilbert-Varshamov rate-distance tradeoff with depth $O(\log^3 n)$. We show that the same asymptotic tradeoff is attained in optimal $O(\log n)$ depth under a gate distribution with a more restricted support. For every fixed $\delta>0$ and sufficiently large $n$, if $\frac kn < 1 - H(\frac{d}{n}) - \frac{d}{n}\log_2 3 - \delta$, we can construct random circuits of depth $O(\log n)$ which define, with high probability, an $[n,k]$ stabilizer code of distance at least $d+1$, which matches the $\Omega(\log n)$ light-cone lower bound for linear distance encoders. Our ensemble employs a random matching circuit architecture consisting of $T$ independent permutation-invariant layers. In each layer, the qubits are paired up by a uniformly random perfect matching, and a random independent two-qubit Clifford gate is applied to each pair. The gate distribution need not be uniform over, or even have full support on, the two-qubit Clifford group; rather, we allow for very general distributions on Clifford gates satisfying three regularity conditions. In particular, the construction can be implemented using $n/2$ CNOT gates on randomly matched pairs in each layer, with parallel one-qubit Clifford twirls. These regularity conditions allow us to reduce the second-moment dynamics of our random circuits to a reversible Markov chain on binary support strings. We establish logarithmic hitting-time bounds for this Markov chain and comparisons of its stationary distribution to prove the coding properties of the circuits.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-20 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Strongly Correlated Electrons (cond-mat.str-el); Computational Complexity (cs.CC); Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.18536 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T13:58:18.011Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).