Sparse Quantum Codes from Quantum Circuits

Abstract

We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit element. Using this prescription, we can map an arbitrary stabilizer code into a new subsystem code with the same distance and number of encoded qubits but where all the generators have constant weight, at the cost of adding some ancilla qubits. With an additional overhead of ancilla qubits, the new code can also be made spatially local. Applying our construction to certain concatenated stabilizer codes yields families of subsystem codes with constant-weight generators and with minimum distance $d=n^{1-\epsilon }$, where $\epsilon =O(1/\sqrt{\log n})$. For spatially local codes in $D$ dimensions we nearly saturate a bound due to Bravyi and Terhal and achieve $d=n^{1-\epsilon -1/D}$. Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer and Luo, was $O(\sqrt{n\log n})$ for a stabilizer code.

28 pages, 2 figures. v4. Fixed an error regarding our fault-tolerant gadgets; results unchanged. Added discussion of explicit constant factors. v5. Final published version

References in corpus (5)

• Fault-tolerant quantum computation with high threshold in two dimensions
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Short random circuits define good quantum error correcting codes
• Perturbative 2-body Parent Hamiltonians for Projected Entangled Pair States

Cited by in corpus (12)

• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Limits on the storage of quantum information in a volume of space
• A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)
• Learning logical Pauli noise in quantum error correction
• Towards local testability for quantum coding
• Fractalizing quantum codes
• On maximum-likelihood decoding with circuit-level errors
• Layer Codes
• Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
• Low-overhead fault-tolerant quantum computation by gauging logical operators
• Single-shot preparation of hypergraph product codes via dimension jump
• Wire Codes