Existence and Characterisation of Coprime Bivariate Bicycle Codes

• URL: http://arxiv.org/abs/2502.17052v2
• Date: Tue, 25 Feb 2025 07:49:23 GMT
• Title: Existence and Characterisation of Coprime Bivariate Bicycle Codes
• Authors: Jasper Johannes Postema, Servaas J. J. M. F. Kokkelmans,
• Abstract summary: One of the holy grails of quantum error correction (QEC) codes is to construct codes with minimumally good parameters.<n>BB codes have emerged as a promising candidate for such compact memory.<n>In this Article, we explore these parameters by focusing on the subclass of coprime BB codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Encoding quantum information in a quantum error correction (QEC) code offers protection against decoherence and enhances the fidelity of qubits and gate operations. One of the holy grails of QEC is to construct codes with asymptotically good parameters, i.e. a non-vanishing rate and relative minimum distance. Such codes provide compact quantum memory with low overhead and enhanced error correcting capabilities, compared to state-of-the-art topological error correction codes such as the surface or colour codes. Finding good codes that can be implemented on near-term quantum hardware is among the key goals in the field of quantum computing. Recently, bivariate bicycle (BB) codes have emerged as a promising candidate for such compact memory, though the exact tradeoff of the code parameters remains unknown. In this Article, we explore these parameters by focusing on the subclass of coprime BB codes. In many cases, we can efficiently predict code parameters by leveraging the ring structure of these codes. Finally, we demonstrate asymptotic badness. Though this excludes this subclass of codes from the search towards practical good low-density parity check (LDPC) codes, it does not affect the utility of the moderately long codes that are known, which can already be used to experimentally demonstrate better QEC beyond the surface code.

Related papers

• Construction and Decoding of Quantum Margulis Codes [2.94944680995069]
  We introduce quantum Margulis codes, a new class of QLDPC codes derived from Margulis' classical LDPC construction via the two-block group algebra framework. We show that quantum Margulis codes can be efficiently decoded using a standard min-sum decoder with linear complexity, when decoded under depolarizing noise.
  arXiv  Detail & Related papers  (2025-03-05T22:11:22Z)
• Quantum LDPC codes for erasure-biased atomic quantum processors [0.0]
  Quantum Low-Density Parity-Check (LDPC) codes have been recently shown to provide a path towards fault-tolerant quantum computing. We demonstrate that when the dominant errors are erasures, quantum LDPC codes additionally provide high thresholds and even stronger logical error suppression.
  arXiv  Detail & Related papers  (2025-02-27T15:23:40Z)
• 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)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) 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)
• 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)
• Concatenating Binomial Codes with the Planar Code [0.0]
  Rotation bosonic codes are attractive encodings for qubits in superconducting qubit experiments. We investigate concatenating these codes with the planar code in a measurement-based scheme for fault-tolerant quantum computation. We find that it is necessary to implement adaptive phase measurements, maximum likelihood quantum state inference, and weighted minimum weight decoding to obtain good performance for a planar code using binomial code qubits.
  arXiv  Detail & Related papers  (2023-12-22T02:34:56Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• 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)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)

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.