Short random circuits define good quantum error correcting codes

Abstract

We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n{\log }^{2}n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided $\frac{k}{n}<1-\frac{d}{n}{\log }_{2}3-h(\frac{d}{n})$. In addition, we prove that such circuits typically have a depth of $O({\log }^{3}n)$.

5 pages

Cited by in corpus (18)

• Phase transition in magic with random quantum circuits
• Quantum coding with low-depth random circuits
• Mixing properties of stochastic quantum Hamiltonians
• Neural-Network Decoders for Measurement Induced Phase Transitions
• Protecting quantum memories using coherent parity check codes
• Clifford-deformed Surface Codes
• Crystalline Quantum Circuits
• Quantum Error Correction via Noise Guessing Decoding
• Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
• Sparse Quantum Codes from Quantum Circuits
• Quantum Error Correction from Complexity in Brownian SYK
• Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
• Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
• Approximate Quantum Codes From Long Wormholes
• Finite-rate sparse quantum codes aplenty
• Propagation of correlations in Local Random Quantum Circuits
• SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning
• Approximate Quantum Error Correction with 1D Log-Depth Circuits