Short random circuits define good quantum error correcting codes
arXiv:1312.7646 · doi:10.1109/ISIT.2013.6620245
Abstract
We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with gates can be used to encode qubits in qubits with a distance provided . In addition, we prove that such circuits typically have a depth of .
arXiv comment5 pages
References in corpus (11)
- Mixed State Entanglement and Quantum Error Correction
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- How to share a quantum secret
- Quantum Error Correction and Orthogonal Geometry
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Random Quantum Circuits are Approximate 2-designs
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Efficient Generation of Generic Entanglement
- Efficient Computations of Encodings for Quantum Error Correction
- Convergence Conditions for Random Quantum Circuits
- Convergence rates for arbitrary statistical moments of random quantum circuits
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