Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2212.05071 · Physical Review Research

Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder

Andrew S. Darmawan, Yoshifumi Nakata, Shiro Tamiya, Hayata Yamasaki

Published Apr 16, 2024• 12 citations
arXivHTMLPDF

Abstract

Recent work [M. J. Gullans , ] has shown that quantum error correcting codes defined by random Clifford encoding circuits can achieve a nonzero encoding rate in correcting errors even if the random circuits on n qubits, embedded in one spatial dimension (1D), have a logarithmic depth d = O ( log n ) . However, this was demonstrated only for a simple erasure noise model. In this work, we discover that, for the same class of codes, this desired property indeed holds for the conventional Pauli noise model. Specifically, we numerically demonstrate that the hashing bound, i.e., a rate known to be achieved with d = O ( n ) -depth random encoding circuits, can be attained for the above codes even when the circuit depth is restricted to d = O ( log n ) in 1D for depolarizing noise of various strengths. This analysis is made possible with our development of a tensor-network maximum-likelihood decoding algorithm that works efficiently for log -depth encoding circuits in 1D. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.023055

Related papers

Approximate Quantum Error Correction with 1D Log-Depth Circuits

Guoding Liu, Zhenyu Du, Zi-Wen Liu +1 more

Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this work, we rigorously prove through information-theoretic analysis that one-dimensional logarithmic-depth random Clifford encoding circuits can achieve high quantum error correction performance. We demonstrate that these random codes typically exhibit good approximate quantum error correction capability by proving that their encoding rate achieves the hashing bound for Pauli noise and the channel capacity for erasure errors. We show that the error correction inaccuracy decays once a threshold of logarithmic depth is exceeded, resulting in negligible recovery errors. This threshold is shown to be lower than that of the simple separate block encoding, and the decay rate is higher. We further establish that these codes are optimal by proving that logarithmic depth is necessary to maintain a constant encoding rate and high error correction performance. To prove our results, we propose decoupling theorems tailored for one-dimensional low-depth circuits. These results also imply strong decoupling and rapid thermalization properties in low-depth random circuits and have potential applications in quantum information science and physics.

arXiv:2503.17759•PRX Quantum•Jan 6, 2026•8 citations

Fault-tolerant quantum memory using low-depth random circuit codes

Jon Nelson, Gregory S. Bentsen, Steven T. Flammia +1 more

Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless. In this work, we design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes even when all gates and measurements are subject to noise. This is sufficient for fault-tolerant quantum memory since these encoded states can then be used as ancillas for Steane error correction. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of 2 % . In addition, we also extend results in the code capacity setting by developing a maximum likelihood marginal decoder for depolarizing noise similar to work by Darmawan []. As in their work, we formulate the decoding problem as a tensor network contraction and show how to contract the network efficiently by exploiting the low-depth structure. Replacing the tensor network with a so-called “tropical” tensor network, we also show how to perform minimum weight decoding. With these decoders, we are able to numerically estimate the depolarizing error threshold of finite-rate random circuit codes and show that this threshold closely matches the hashing bound even when the decoding is suboptimal.

arXiv:2311.17985•Physical Review Research•Jan 10, 2025•6 citations

Error correction with brickwork Clifford circuits

Twan Kroll, Jonas Helsen

We prove that random 1D Clifford brickwork circuits form (in expectation) good approximate quantum error correction codes in logarithmic depth. Our proof makes use of the statistical mechanics techniques for random circuits developed by Dalzell et al. [PRX Quantum 3, 010333], adapted extensively to our own purpose. We also consider exact error correction, where we give matching upper and lower bounds for the required depth in which random 1D Clifford brickwork circuits become error correcting.

quant-pharXiv:2602.20900•Feb 25, 2026•2 citations

Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings

Emile Anand, Elia Gorokhovsky, Jennifer Hritz +1 more

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 $δ>0$ and sufficiently large $n$, if $\frac kn < 1 - H(\frac{d}{n}) - \frac{d}{n}\log_2 3 - δ$, 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 $Ω(\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.

quant-pharXiv:2608.18536•Aug 20, 2026•1 citation

Shallow Shadows: Expectation Estimation Using Low-Depth Random Clifford Circuits

Christian Bertoni, Jonas Haferkamp, Marcel Hinsche +3 more

We provide practical and powerful schemes for learning properties of a quantum state using a small number of measurements. Specifically, we present a randomized measurement scheme modulated by the depth of a random quantum circuit in one spatial dimension. This scheme interpolates between two known classical shadows schemes based on random Pauli measurements and random Clifford measurements. We focus on the regime where depth scales logarithmically in the system size and provide evidence that this retains the desirable sample complexity properties of both extremal schemes while also being experimentally feasible. We present methods for two key tasks; estimating expectation values of certain observables from generated classical shadows and, computing upper bounds on the depth-modulated shadow norm, thus providing rigorous guarantees on the accuracy of the output estimates. We achieve our findings by bringing together tools from shadow estimation, random circuits, and tensor networks.

arXiv:2209.12924•Physical Review Letters•Jul 10, 2024•124 citations

Biased-noise thresholds of zero-rate holographic codes with tensor-network decoding

J. Fan, Matthew Steinberg, A. Jahn +2 more

A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a challenging problem, related to the (generally unknown) maximum capacity of the corresponding noisy channel. A benchmark for this capacity is given by the hashing bound, which describes the performance of random stabilizer codes and leads to the matter of identifying codes that come close to the bound while also being efficiently decodable. In this work, we perform a comprehensive analysis of asymptotically zero-rate holographic codes under biased noise. We show that many representatives from such models of this code class fulfill both the channel optimality and efficient decoding guarantees for tensor-network codes. In fact, all tested holographic codes are found to reach the hashing bound in some bias regime, while several built from the [[ 5 , 1 , 2 ]] surface code and [[ 6 , 1 , 3 ]] code exceed state-of-the-art code performance in the 2-Pauli noise regime. Furthermore, we consider Clifford deformations which allow all considered codes to reach the hashing bound for 1-Pauli noise as well. Our results establish that holographic codes, which were previously shown to possess efficient tensor-network decoders, also exhibit competitive thresholds under biased noise.

arXiv:2408.06232•Physical Review A•Jul 1, 2026•8 citations
Recent work [M. J. Gullans , ] has shown that quantum error correcting codes defined by random Clifford encoding circuits can achieve a nonzero encoding rate in correcting errors even if the random circuits on n qubits, embedded in one spatial dimension (1D), have a logarithmic depth d = O ( log n ) . However, this was demonstrated only for a simple erasure noise model. In this work, we discover that, for the same class of codes, this desired property indeed holds for the conventional Pauli noise model. Specifically, we numerically demonstrate that the hashing bound, i.e., a rate known to be achieved with d = O ( n ) -depth random encoding circuits, can be attained for the above codes even when the circuit depth is restricted to d = O ( log n ) in 1D for depolarizing noise of various strengths. This analysis is made possible with our development of a tensor-network maximum-likelihood decoding algorithm that works efficiently for log -depth encoding circuits in 1D. Published by the American Physical Society 2024
Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this work, we rigorously prove through information-theoretic analysis that one-dimensional logarithmic-depth random Clifford encoding circuits can achieve high quantum error correction performance. We demonstrate that these random codes typically exhibit good approximate quantum error correction capability by proving that their encoding rate achieves the hashing bound for Pauli noise and the channel capacity for erasure errors. We show that the error correction inaccuracy decays once a threshold of logarithmic depth is exceeded, resulting in negligible recovery errors. This threshold is shown to be lower than that of the simple separate block encoding, and the decay rate is higher. We further establish that these codes are optimal by proving that logarithmic depth is necessary to maintain a constant encoding rate and high error correction performance. To prove our results, we propose decoupling theorems tailored for one-dimensional low-depth circuits. These results also imply strong decoupling and rapid thermalization properties in low-depth random circuits and have potential applications in quantum information science and physics.
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless. In this work, we design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes even when all gates and measurements are subject to noise. This is sufficient for fault-tolerant quantum memory since these encoded states can then be used as ancillas for Steane error correction. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of 2 % . In addition, we also extend results in the code capacity setting by developing a maximum likelihood marginal decoder for depolarizing noise similar to work by Darmawan []. As in their work, we formulate the decoding problem as a tensor network contraction and show how to contract the network efficiently by exploiting the low-depth structure. Replacing the tensor network with a so-called “tropical” tensor network, we also show how to perform minimum weight decoding. With these decoders, we are able to numerically estimate the depolarizing error threshold of finite-rate random circuit codes and show that this threshold closely matches the hashing bound even when the decoding is suboptimal.
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⁡3n)O(\log^3 n)O(log3n). We show that the same asymptotic tradeoff is attained in optimal O(log⁡n)O(\log n)O(logn) depth under a gate distribution with a more restricted support. For every fixed δ>0δ>0δ>0 and sufficiently large nnn, if kn<1−H(dn)−dnlog⁡23−δ\frac kn < 1 - H(\frac{d}{n}) - \frac{d}{n}\log_2 3 - δnk​<1−H(nd​)−nd​log2​3−δ, we can construct random circuits of depth O(log⁡n)O(\log n)O(logn) which define, with high probability, an [n,k][n,k][n,k] stabilizer code of distance at least d+1d+1d+1, which matches the Ω(log⁡n)Ω(\log n)Ω(logn) light-cone lower bound for linear distance encoders. Our ensemble employs a random matching circuit architecture consisting of TTT 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/2n/2n/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.
We provide practical and powerful schemes for learning properties of a quantum state using a small number of measurements. Specifically, we present a randomized measurement scheme modulated by the depth of a random quantum circuit in one spatial dimension. This scheme interpolates between two known classical shadows schemes based on random Pauli measurements and random Clifford measurements. We focus on the regime where depth scales logarithmically in the system size and provide evidence that this retains the desirable sample complexity properties of both extremal schemes while also being experimentally feasible. We present methods for two key tasks; estimating expectation values of certain observables from generated classical shadows and, computing upper bounds on the depth-modulated shadow norm, thus providing rigorous guarantees on the accuracy of the output estimates. We achieve our findings by bringing together tools from shadow estimation, random circuits, and tensor networks.
A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a challenging problem, related to the (generally unknown) maximum capacity of the corresponding noisy channel. A benchmark for this capacity is given by the hashing bound, which describes the performance of random stabilizer codes and leads to the matter of identifying codes that come close to the bound while also being efficiently decodable. In this work, we perform a comprehensive analysis of asymptotically zero-rate holographic codes under biased noise. We show that many representatives from such models of this code class fulfill both the channel optimality and efficient decoding guarantees for tensor-network codes. In fact, all tested holographic codes are found to reach the hashing bound in some bias regime, while several built from the [[ 5 , 1 , 2 ]] surface code and [[ 6 , 1 , 3 ]] code exceed state-of-the-art code performance in the 2-Pauli noise regime. Furthermore, we consider Clifford deformations which allow all considered codes to reach the hashing bound for 1-Pauli noise as well. Our results establish that holographic codes, which were previously shown to possess efficient tensor-network decoders, also exhibit competitive thresholds under biased noise.