analiza aiqbench
This research introduces trivariate tricycle (TT) codes, a new class of quantum low-density parity check (qLDPC) codes that achieve high fault-tolerance thresholds and partial single-shot decodability. By leveraging three trivariate polynomials within a length-3 chain complex, these codes offer significant resource efficiency improvements over existing 3D toric codes while supporting constant-depth implementations of non-Clifford CCZ gates. The work advances the practical viability of quantum error correction by balancing low overhead with robust performance under circuit-level noise models.
Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes
arXiv:2508.08191v3 Announce Type: replace 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 $Z$ memory, in both phenomenological and circuit-level noise models. We also demonstrate that the codes have good performance under single-shot decoding even in $X$ memory. Under circuit-level noise, TT codes have a crossing point of $0.3\%$ in $X$ memory and $1\%$ in $Z$ memory (with single-shot decoding). All TT codes possess several transversal $CZ$ gates that can partially address logical qubits between two code blocks. 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 allow for a constant-depth implementation of logical $CCZ$ gates. We find codes with $CCZ$ gates that use up to $5.7\times$ fewer data qubits as equivalent-distance 3DTC encodings, and others with encoding rates as high as $1/4$.
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 $Z$ memory, in both phenomenological and circuit-level noise models. We also demonstrate that the codes have good performance under single-shot decoding even in $X$ memory. Under circuit-level noise, TT codes have a crossing point of $0.3\%$ in $X$ memory and $1\%$ in $Z$ memory (with single-shot decoding). All TT codes possess several transversal $CZ$ gates that can partially address logical qubits between two code blocks. 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 allow for a constant-depth implementation of logical $CCZ$ gates. We find codes with $CCZ$ gates that use up to $5.7\times$ fewer data qubits as equivalent-distance 3DTC encodings, and others with encoding rates as high as $1/4$.
33 pages, 18 figures. Responding to reviewer feedback
arXiv:2508.08191 [quant-ph]
(or arXiv:2508.08191v3 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2508.08191 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 376 cuvinte
Subiecte conexe

News
Quantum Computing Report · 25 iul. 2026

Quantum Logical-Qubit Leaderboard
Quantum Zeitgeist · 5 iun. 2026

NISQ, What Noisy Intermediate-Scale Quantum Means
Quantum Zeitgeist · 30 aug. 2026

Simple logical quantum computation with concatenated symplectic double codes
Quantum Journal · 19 aug. 2026