Tailoring three-dimensional topological codes for biased noise

Abstract

Tailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for several advantages including a transversal implementation of non-Clifford logical gates, single-shot decoding strategies, parallelized decoding in the case of fracton codes as well as construction of fractal lattice codes. Motivated by this, we tailor 3D topological codes for enhanced storage performance under 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. Our examples include the 3D surface code on the cubic lattice, the 3D surface code on a checkerboard lattice that lends itself to a subsystem code with a single-shot decoder, the 3D color code, as well as fracton models such as the X-cube model, the Sierpinski model and the Haah code. We use the belief propagation with ordered statistics decoder (BP-OSD) to study threshold error rates at finite bias. We also present a rotated layout for the 3D surface code, which uses roughly half the number of physical qubits for the same code distance under appropriate boundary conditions. Imposing coprime periodic dimensions on this rotated layout leads to logical operators of weight $O(n)$ at infinite bias and a corresponding $\exp [-O(n)]$ subthreshold scaling of the logical failure rate, where $n$ is the number of physical qubits in the code. Even though this scaling is unstable due to the existence of logical representations with $O(1)$ low-rate Pauli errors, the number of such representations scales only polynomially for the Clifford-deformed code, leading to an enhanced effective distance.

51 pages, 34 figures

References in corpus (12)

• Local stabilizer codes in three dimensions without string logical operators
• Experimental Quantum Computations on a Topologically Encoded Qubit
• Fault-tolerant quantum computation against biased noise
• Topological Computation without Braiding
• Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
• Universal transversal gates with color codes - a simplified approach
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Modified belief propagation decoders for quantum low-density parity-check codes
• Morphing quantum codes
• Generalized Performance of Concatenated Quantum Codes -- A Dynamical Systems Approach

Cited by in corpus (13)

• Tensor Network Decoding Beyond 2D
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Clifford operations and homological codes for rotors and oscillators
• Plane-selective manipulations of nuclear spin qubits in a three-dimensional optical tweezer array
• Exact results on finite size corrections for surface codes tailored to biased noise
• The domain wall color code
• Multi-Qubit Parity Gates for Rydberg Atoms in Various Configurations
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Systematic construction of stabilizer codes via gauging abelian boundary symmetries
• Generalizing the matching decoder for the Chamon code
• Minimising surface-code failures using a color-code decoder
• Mitigating Temporal Fragility in the XY Surface Code
• Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding