Approximate Quantum Error Correction with 1D Log-Depth Circuits

Abstract

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.

80 pages, 10 figures. Comments are welcomed!

References in corpus (57)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Black holes as mirrors: quantum information in random subsystems
• Quantum Error Correction for Quantum Memories
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Strong quantum computational advantage using a superconducting quantum processor
• Suppressing quantum errors by scaling a surface code logical qubit
• Randomized Benchmarking of Quantum Gates
• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Bulk Locality and Quantum Error Correction in AdS/CFT
• Robust randomized benchmarking of quantum processes
• On quantum Renyi entropies: a new generalization and some properties
• Quantum error correction below the surface code threshold
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Distance measures to compare real and ideal quantum processes
• Quantum mechanical evolution towards thermal equilibrium
• Noise tailoring for scalable quantum computation via randomized compiling
• Quantum information can be negative
• Quantum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition
• The thermodynamic meaning of negative entropy
• The randomized measurement toolbox
• Evenly distributed unitaries: on the structure of unitary designs
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Local random quantum circuits are approximate polynomial-designs
• Demonstration of fault-tolerant universal quantum gate operations
• A Fully Quantum Asymptotic Equipartition Property
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Emergent statistical mechanics of entanglement in random unitary circuits
• Sandwiched Rényi Divergence Satisfies Data Processing Inequality
• The XZZX Surface Code
• Tradeoffs for reliable quantum information storage in 2D systems
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Multiqubit Clifford groups are unitary 3-designs
• Exponential Decay of Correlations Implies Area Law
• Information-capacity description of spin-chain correlations
• Robust shadow estimation
• One-shot decoupling
• Dynamics of entanglement and transport in 1D systems with quenched randomness
• General conditions for approximate quantum error correction and near-optimal recovery channels
• Efficient estimation of Pauli channels
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Phase transition in Random Circuit Sampling
• Hadamard-free circuits expose the structure of the Clifford group
• Standard forms of noisy quantum operations via depolarization
• Relating different quantum generalizations of the conditional Renyi entropy
• Decoupling with unitary approximate two-designs
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Quantum scrambling with classical shadows
• Experimental exploration of five-qubit quantum error correcting code with superconducting qubits
• Approximate quantum error correction, random codes, and quantum channel capacity
• Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
• Short random circuits define good quantum error correcting codes
• The Near-optimal Performance of Quantum Error Correction Codes
• Complexity and order in approximate quantum error-correcting codes
• Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
• Group twirling and noise tailoring for multi-qubit controlled phase gates