Explicit Construction of Classical and Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12

• URL: http://arxiv.org/abs/2501.13444v1
• Date: Thu, 23 Jan 2025 07:52:07 GMT
• Title: Explicit Construction of Classical and Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12
• Authors: Daiki Komoto, Kenta Kasai,
• Abstract summary: This study proposes an explicit construction method for classical and quantum quasi-cyclic low-density parity-check codes with a girth of 12.<n>By utilizing algebraic techniques, short cycles are eliminated, which improves error correction performance.<n>The results of this study enable the design of high-performance quantum error correction codes without the need for random search.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study proposes an explicit construction method for classical and quantum quasi-cyclic low-density parity-check (QC-LDPC) codes with a girth of 12. The proposed method designs parity-check matrices that maximize the girth while maintaining an orthogonal structure suitable for quantum error correction. By utilizing algebraic techniques, short cycles are eliminated, which improves error correction performance. Additionally, this method is extended to non-binary LDPC codes and spatially-coupled LDPC codes, demonstrating that both the girth and orthogonality can be preserved. The results of this study enable the design of high-performance quantum error correction codes without the need for random search.

Related papers

• Quantum Error Correction with Girth-16 Non-Binary LDPC Codes via Affine Permutation Construction [0.0]
  We propose a method for constructing quantum error-correcting codes based on non-binary low-density parity-check codes with Tanner graph girth 16. Numerical experiments show that the proposed codes significantly reduce the number of low-weight codewords.
  arXiv  Detail & Related papers  (2025-04-24T17:59:58Z)
• A Systematic Approach to Hyperbolic Quantum Error Correction Codes [0.0]
  Hyperbolic quantum error correction codes (HQECCs) leverage the unique geometric properties of hyperbolic space to enhance the capabilities and performance of quantum error correction. By embedding qubits in hyperbolic lattices, HQECCs achieve higher encoding rates and improved error thresholds compared to conventional Euclidean codes.
  arXiv  Detail & Related papers  (2025-04-10T14:38:10Z)
• On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes [2.34863357088666]
  This paper focuses on the finite-length QLDPC code design criteria, specifically aimed at constructing degenerate quasi-cyclic symmetric lifted-product (LP-QLDPC) codes. We describe the necessary conditions such that the designed LP-QLDPC codes are guaranteed to have a minimum distance strictly greater than the minimum weight stabilizer generators.
  arXiv  Detail & Related papers  (2025-03-10T17:38:30Z)
• Existence and Characterisation of Bivariate Bicycle Codes [0.0]
  We show that BB codes provide compact quantum memory with low overhead and enhanced error correcting capabilities. We explore these codes by leveraging their ring structure and predict their dimension as well as conditions on their existence.
  arXiv  Detail & Related papers  (2025-02-24T11:04:15Z)
• Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes [0.0]
  We identify and classify cycle structures in the parity-check matrix where estimated noise becomes trapped.<n>For Type-I cycles, we propose a method to make the difference between estimated and true noise degenerate.<n>Type-II cycles are shown to be uncorrectable, while for Type-III cycles, we utilize the fact that cycles in non-binary LDPC codes do not necessarily correspond to codewords.
  arXiv  Detail & Related papers  (2025-01-23T18:59:08Z)
• Low-density parity-check representation of fault-tolerant quantum circuits [5.064729356056529]
  In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. This paper presents a toolkit for designing and analysing fault-tolerant quantum circuits.
  arXiv  Detail & Related papers  (2024-03-15T12:56:38Z)
• CBQ: Cross-Block Quantization for Large Language Models [66.82132832702895]
  Post-training quantization (PTQ) has played a key role in compressing large language models (LLMs) with ultra-low costs. We propose CBQ, a cross-block reconstruction-based PTQ method for LLMs. CBQ employs a cross-block dependency using a reconstruction scheme, establishing long-range dependencies across multiple blocks to minimize error accumulation.
  arXiv  Detail & Related papers  (2023-12-13T07:56:27Z)
• 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)
• Hardness of braided quantum circuit optimization in the surface code [0.1759008116536278]
  Large-scale quantum information processing requires the use of quantum error codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a two-dimensional array of physical qubits. However, error correction also introduces a significant overhead in time, the number of physical qubits, and the number of physical gates.
  arXiv  Detail & Related papers  (2023-02-01T06:35:50Z)
• 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 Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• 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)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• 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.