Layer Codes
- URL: http://arxiv.org/abs/2309.16503v2
- Date: Fri, 10 May 2024 00:22:55 GMT
- Title: Layer Codes
- Authors: Dominic J. Williamson, Nouédyn Baspin,
- Abstract summary: In three dimensions an analogous simple yet optimal code was not previously known.
The output codes have the special structure of being topological defect networks formed by layers of surface code joined along one-dimensional junctions.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet optimal code was not previously known. Here, we introduce a construction that takes as input a stabilizer code and produces as output a three-dimensional topological code with related code parameters. The output codes have the special structure of being topological defect networks formed by layers of surface code joined along one-dimensional junctions, with a maximum stabilizer check weight of six. When the input is a family of good low-density parity-check codes, the output is a three-dimensional topological code with optimal scaling code parameters and a polynomial energy barrier.
Related papers
- Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
Low-Density Parity-Check codes possess several advantages over other families of codes.
The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
arXiv Detail & Related papers (2024-06-09T12:08:56Z) - Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes.
We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z) - Lift-Connected Surface Codes [0.0]
We use the recently introduced lifted product to construct a family of Quantum Low Density Parity Check Codes (QLDPC codes)
The codes we obtain can be viewed as stacks of surface codes that are interconnected, leading to the name lift-connected surface (LCS) codes.
arXiv Detail & Related papers (2024-01-05T17:22:49Z) - Geometrically Local Quantum and Classical Codes from Subdivision [10.357542321841887]
A geometrically local quantum code is an error correcting code situated within $mathbbRD$, where the checks only act on qubits within a fixed spatial distance.
Recently, Portnoy made a significant breakthrough with codes achieving optimal dimension and distance up to polylogs.
This paper bypasses this step and streamlines the construction by noticing that a family of good quantum low-density parity-check codes, balanced product codes, naturally carries a two-dimensional structure.
arXiv Detail & Related papers (2023-09-28T02:12:38Z) - Hierarchical memories: Simulating quantum LDPC codes with local gates [0.05156484100374058]
Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories.
We construct a new family of hierarchical codes, that encode a number of logical qubits K = Omega(N/log(N)2.
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) - Tailoring three-dimensional topological codes for biased noise [2.362412515574206]
topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved biased Pauli noise.
We present Clifford deformations of various 3D topological codes, such that they exhibit a threshold error rate of $50%$ under infinitely biased Pauli noise.
arXiv Detail & Related papers (2022-11-03T19:40:57Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - The cost of universality: A comparative study of the overhead of state
distillation and code switching with color codes [63.62764375279861]
We compare two leading FT implementations of the T gate in 2D color codes under circuit noise.
We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
arXiv Detail & Related papers (2021-01-06T19:00:01Z) - DSG-Net: Learning Disentangled Structure and Geometry for 3D Shape
Generation [98.96086261213578]
We introduce DSG-Net, a deep neural network that learns a disentangled structured and geometric mesh representation for 3D shapes.
This supports a range of novel shape generation applications with disentangled control, such as of structure (geometry) while keeping geometry (structure) unchanged.
Our method not only supports controllable generation applications but also produces high-quality synthesized shapes, outperforming state-of-the-art methods.
arXiv Detail & Related papers (2020-08-12T17:06:51Z) - Decoding Across the Quantum LDPC Code Landscape [4.358626952482686]
We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low density parity check codes.
We run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes and a new class of codes that we call semi-topological codes.
arXiv Detail & Related papers (2020-05-14T14:33:08Z) - Cellular automaton decoders for topological quantum codes with noisy
measurements and beyond [68.8204255655161]
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold.
We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
arXiv Detail & Related papers (2020-04-15T18:00:01Z)
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.