Lower-depth local encoding circuits for the surface code
quant-ph
Submitted: 2025-09-11
Updated: 2026-11-01
Comments: Barely three pages, mostly figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: The surface code is the most studied error-correcting code thanks to its high threshold, simple decoding, and locality in two dimensions (2D).
Terminology
Abstract
The surface code is the most studied error-correcting code thanks to its high threshold, simple decoding, and locality in two dimensions (2D). A key component of any code is its encoding circuit, which maps an unencoded state to the corresponding encoded state. The best previous surface code encoding circuit compatible with 2D local connectivity requires depth 2d to encode distance- d surface codes. This paper presents depth d encoding circuits for the rotated surface code. Our circuit is constructed inductively from circuits that grow the code from d to (d+2). We prove that depth d+O(1) is optimal for inductively constructed circuits.
Sources
- Quantum codes on a lattice with boundary
- Experimental Demonstration of Logical Magic State Distillation
- Magic state cultivation: growing T states as cheap as CNOT gates
- Cultivating T states on the surface code with only two-qubit gates
- Fold-transversal surface code cultivation
- Efficient Magic State Cultivation on the Surface Code
- Realizing topologically ordered states on a quantum processor
- A Unitary Encoder for Surface Codes
- Quantum circuits for toric code and X-cube fracton model
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements