Lower-depth local encoding circuits for the surface code

• URL: http://arxiv.org/abs/2509.09779v1
• Date: Thu, 11 Sep 2025 18:23:05 GMT
• Title: Lower-depth local encoding circuits for the surface code
• Authors: Jahan Claes,
• Abstract summary: The best previous surface code encoding circuit compatible with 2D local connectivity requires depth $2d$ to encode distance-$d$ surface codes.<n>This paper presents depth $d$ encoding circuits for the rotated surface code.
• Score: 0.029851290829909654
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Efficient encoding of the 2D toric code logical state using local Clifford gates [0.0]
  An algorithm which encodes the $Ltimes L$ 2D toric code logical state with a circuit of depth $2L+1$ is presented.
  arXiv  Detail & Related papers  (2025-10-16T19:57:04Z)
• Optimal Quantum $(r,δ)$-Locally Repairable Codes From Matrix-Product Codes [52.3857155901121]
  We study optimal quantum $(r,delta)$-LRCs from matrix-product (MP) codes.<n>We present five infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
  arXiv  Detail & Related papers  (2025-08-05T16:05:14Z)
• DFormerv2: Geometry Self-Attention for RGBD Semantic Segmentation [66.7989548848166]
  Existing approaches encode depth maps along with RGB images and perform feature fusion between them to enable more robust predictions.<n>We present DFormerv2, a strong RGBD encoder that explicitly uses depth maps as geometry priors rather than encoding depth information with neural networks.<n>Our goal is to extract the geometry clues from the depth and spatial distances among all the image patch tokens, which will then be used as geometry priors to allocate attention weights in self-attention.
  arXiv  Detail & Related papers  (2025-04-07T03:06:07Z)
• Almost Linear Decoder for Optimal Geometrically Local Quantum Codes [8.837439668920288]
  We show how to achieve geometrically local codes that maximize both the dimension and the distance, as well as the energy barrier of the code.<n>We demonstrate the existence of a finite threshold error rate under the code capacity noise model using a minimum weight perfect matching decoder.
  arXiv  Detail & Related papers  (2024-11-05T09:15:06Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Hierarchical memories: Simulating quantum LDPC codes with local gates [0.016385815610837167]
  We construct a new family of $[[N,K,D]]$ codes, that encode a number of logical qubits $K = Omega(N/log(N)2)$.<n>The N-th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code.<n>Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
  arXiv  Detail & Related papers  (2023-03-08T18:48:12Z)
• Learning Deep Implicit Functions for 3D Shapes with Dynamic Code Clouds [56.385495276042406]
  Deep Implicit Function (DIF) has gained popularity as an efficient 3D shape representation. We propose to learn DIF with Dynamic Code Cloud, named DCC-DIF. Our method explicitly associates local codes with learnable position vectors, and the position vectors are continuous and can be dynamically optimized.
  arXiv  Detail & Related papers  (2022-03-26T11:07:59Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• General tensor network decoding of 2D Pauli codes [0.0]
  We propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. We numerically demonstrate the power of this decoder by studying four classes of codes under three noise models. We show that the thresholds yielded by our decoder are state-of-the-art, and numerically consistent with optimal thresholds where available.
  arXiv  Detail & Related papers  (2021-01-11T19:00:03Z)
• Union-Find Decoders For Homological Product Codes [0.0]
  Homological product codes are a class of codes that can have improved distance while retaining relatively low stabilizer weight. We show how to build union-find decoders for these codes, using a union-find decoder for one of the codes in the product and a brute force decoder for the other code.
  arXiv  Detail & Related papers  (2020-09-29T18:00:54Z)
• Optimal local unitary encoding circuits for the surface code [0.2770822269241973]
  The surface code is a leading candidate quantum error correcting code, owing to its high threshold. We present an optimal local unitary encoding circuit for the planar surface code. We also show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping.
  arXiv  Detail & Related papers  (2020-02-02T11:09:46Z)
• Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders [77.34726150561087]
  We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise.
  arXiv  Detail & Related papers  (2019-05-17T17:41:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.