Romanesco codes: Bias-tailored qLDPC codes from fractal codes

• URL: http://arxiv.org/abs/2506.00130v1
• Date: Fri, 30 May 2025 18:06:24 GMT
• Title: Romanesco codes: Bias-tailored qLDPC codes from fractal codes
• Authors: Catherine Leroux, Joseph K. Iverson,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce and analyze a family of Clifford-deformed bivariate bicycle codes that are tailored for biased noise. Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers. The code is non-CSS, featuring stabilizer generators that are each half X and half Z. We find small examples with high encoding rate that perform well for a large range of bias. In the limit of large noise bias, the code reduces to two independent classical cellular automaton codes, giving a distance scaling better than is possible with 2D topological quantum codes. Our construction combines two classical cellular automaton codes, LDPC codes that were recently proposed for use with noise-biased cat qubits, related to each other by a reflection. Each stabilizer in the quantum code is obtained by multiplying an all-X stabilizer from the first code with an all-Z stabilizer from the second code, or the other way around. The result is a self-dual quantum code with a number of qubits equal to the sum of the input codes and stabilizer weight and locality determined by the input codes. Under strong noise bias, the effective distance of the quantum code approaches the distance of the input codes. We simulate the logical performance of our qLDPC codes under code-capacity noise and find strong suppression of the logical error rate.

Related papers

• Abelian multi-cycle codes for single-shot error correction [0.027042267806481293]
  We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes.<n>The proposed codes have highly redundant sets of low-weight stabilizer generators, which improves decoding accuracy in a fault-tolerant regime.<n>We derive simple expressions for the dimension of the proposed codes in two important special cases, give bounds on the distances, and explicitly construct some relatively short codes.
  arXiv  Detail & Related papers  (2025-06-20T11:05:32Z)
• 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)
• High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
  We present a new family of quantum low-density parity-check codes, which we call radial codes. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance. Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
  arXiv  Detail & Related papers  (2024-06-20T16:08:06Z)
• Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes [4.299840769087443]
  Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
  arXiv  Detail & Related papers  (2024-01-15T10:38:13Z)
• Spatially-Coupled QLDPC Codes [3.1000291317724997]
  We describe toric codes as quantum counterparts of classical spatially-coupled (2D-SC) codes.<n>We introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a class of convolutional LDPC codes.<n>This paper focuses on QLDPC codes with rate less than 1/10, but we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.
  arXiv  Detail & Related papers  (2023-04-29T00:57:57Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Tailored XZZX codes for biased noise [60.12487959001671]
  We study a family of codes having XZZX-type stabilizer generators. We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
  arXiv  Detail & Related papers  (2022-03-30T17:26:31Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• 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)

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.