Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes

• URL: http://arxiv.org/abs/2508.08191v1
• Date: Mon, 11 Aug 2025 17:11:23 GMT
• Title: Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes
• Authors: Abraham Jacob, Campbell McLauchlan, Dan E. Browne,
• Abstract summary: We introduce tri tricycle (TT) codes, qLDPC codes that combine several desirable features.<n>TT codes have high thresholds under a circuit-level noise model, partial single-shot decodability for low-time-overhead decoding.<n> codes possess several $CZ gates that can partially address logical qubits between two code blocks.
• Score: 3.1952340441132474
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While quantum low-density parity check (qLDPC) codes are a low-overhead means of quantum information storage, it is valuable for quantum codes to possess fault-tolerant features beyond this resource efficiency. In this work, we introduce trivariate tricycle (TT) codes, qLDPC codes that combine several desirable features: high thresholds under a circuit-level noise model, partial single-shot decodability for low-time-overhead decoding, a large set of transversal Clifford gates and automorphisms within and between code blocks, and (for several sub-constructions) constant-depth implementations of a (non-Clifford) $CCZ$ gate. TT codes are CSS codes based on a length-3 chain complex, and are defined from three trivariate polynomials, with the 3D toric code (3DTC) belonging to this construction. We numerically search for TT codes and find several candidates with improved parameters relative to the 3DTC, using up to 48$\times$ fewer data qubits as equivalent 3DTC encodings. We construct syndrome-extraction circuits for these codes and numerically demonstrate single-shot decoding in the X error channel in both phenomenological and circuit-level noise models. Under circuit-level noise, TT codes have a threshold of $0.3\%$ in the Z error channel and $1\%$ in the X error channel (with single-shot decoding). All TT codes possess several transversal $CZ$ gates that can partially address logical qubits between two code blocks. Additionally, the codes possess a large set of automorphisms that can perform Clifford gates within a code block. Finally, we establish several TT code polynomial constructions that allows for a constant-depth implementation of logical $CCZ$ gates. We find examples of error-correcting and error-detecting codes using these constructions whose parameters out-perform those of the 3DTC, using up to $4\times$ fewer data qubits for equivalent-distance 3DTC encodings.

Related papers

• Addressable fault-tolerant universal quantum gate operations for high-rate lift-connected surface codes [0.8919684307774216]
  Quantum low-density parity check (qLDPC) codes are among the leading candidates to realize error-corrected quantum memories with low qubit overhead.<n>In this work, we introduce a construction to implement all Clifford quantum gate operations on the recently introduced lift-connected surface (LCS) codes.
  arXiv  Detail & Related papers  (2025-11-13T11:01:44Z)
• Transversal dimension jump for product qLDPC codes [2.8610973865376486]
  We introduce a code-switching protocol for dimension lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions.<n>We implement one-way CNOTs between a 3D code and its 2D component codes, enabling teleportation-based switching.<n>This yields high-rate quantum logical computation with high thresholds and low space-time costs.
  arXiv  Detail & Related papers  (2025-10-08T17:35:07Z)
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes [1.0792624191049491]
  We introduce a class of finite block-length quantum LDPC codes which we name tricycle codes.<n>These codes can support constant-depth physical circuits that implement logical $CCZ$ gates between three code blocks.<n>We show that tricycle codes enable single-shot state-preparation and error correction, leading to a highly efficient magic-state generation protocol.
  arXiv  Detail & Related papers  (2025-08-14T14:56:50Z)
• Quasi-twisted codes: decoding and applications in code-based cryptography [0.0]
  We propose a syndrome-based decoding method for QT codes.<n>We also introduce a Niederreiter-like cryptosystem constructed from QT codes.
  arXiv  Detail & Related papers  (2025-07-01T18:26:27Z)
• Romanesco codes: Bias-tailored qLDPC codes from fractal codes [0.0]
  We introduce and analyze a family of Clifford-deformed bicycle codes that are tailored for biased noise.<n>Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers.<n>We find small examples with high encoding rate that perform well for a large range of bias.
  arXiv  Detail & Related papers  (2025-05-30T18:06:24Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Decoding Quasi-Cyclic Quantum LDPC Codes [23.22566380210149]
  Quantum low-density parity-check (qLDPC) codes are an important component in the quest for fault tolerance. Recent progress on qLDPC codes has led to constructions which are quantumally good, and which admit linear-time decoders to correct errors affecting a constant fraction of codeword qubits. In practice, the surface/toric codes, which are the product of two repetition codes, are still often the qLDPC codes of choice.
  arXiv  Detail & Related papers  (2024-11-07T06:25:27Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Transversal Clifford and T-gate codes of short length and high distance [0.6138671548064355]
  We construct three kinds of codes encoding a single logical qubit for distances up to $31$.<n>To our knowledge, these are the smallest known triorthogonal codes for their respective distances.
  arXiv  Detail & Related papers  (2024-08-22T22:45:47Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• 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)
• 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)
• 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)
• 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.