Fusion-based implementation of qLDPC codes with quantum emitters

• URL: http://arxiv.org/abs/2509.17223v1
• Date: Sun, 21 Sep 2025 20:13:38 GMT
• Title: Fusion-based implementation of qLDPC codes with quantum emitters
• Authors: Susan X. Chen, Matthias C. Löbl, Ming Lai Chan, Anders S. Sørensen, Stefano Paesani,
• Abstract summary: Quantum low-density parity check (qLDPC) codes offer higher encoding rate than topological codes.<n>We propose a method to implement any Calderbank-Shor-Steane (CSS) qLDPC code with fusions and photonic resource states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum low-density parity check (qLDPC) codes offer higher encoding rate than topological codes, e.g. surface codes, making them favourable for practical, fault-tolerant quantum computing with low overhead. These codes are particularly well-suited for fusion-based photonic implementations as this platform readily supports non-local connections. We propose a method to implement any Calderbank-Shor-Steane (CSS) qLDPC code with fusions and photonic resource states, which can be deterministically produced by quantum emitters. We use this framework to perform a case study on small exemplary Bivariate Bicycle qLDPC codes. We analyse the performance of our constructions under relevant physical noise mechanisms, including erasures due to fusion failure or photon loss as well as Pauli errors. We obtain performances comparable with topological architectures despite the significantly higher encoding rate.

Related papers

• Self-dual Stacked Quantum Low-Density Parity-Check Codes [9.268855474673822]
  We introduce a method for constructing self-dual qLDPC codes by stacking non-self-dual qLDPC codes.<n>We conduct numerical calculations to assess the performance of these codes as quantum memory under the circuit-level noise model.
  arXiv  Detail & Related papers  (2026-02-17T05:55:48Z)
• Explicit Instances of Quantum Tanner Codes [0.0]
  We construct several explicit instances of quantum Tanner codes, a class ofally good quantum low-density parity check (qLDPC) codes.<n>The codes are constructed using dihedral groups and random pairs of classical codes and exhibit high encoding rates, relative distances, and pseudo-thresholds.
  arXiv  Detail & Related papers  (2025-08-07T07:29:03Z)
• Small Quantum Low Parity Density Check Codes for Near-Term Experiments [0.0]
  We present a simple construction recipe for small quantum LDPC codes based on recent developments in the field.<n>Our codes are approximately twice as efficient as comparable surface codes, yet require only weight-four parity checks.
  arXiv  Detail & Related papers  (2025-07-13T15:53:16Z)
• QUITS: A modular Qldpc code circUIT Simulator [0.6383572393537065]
  QUITS is a modular and flexible circuit-level simulator for QLDPC codes.<n>We introduce a syndrome extraction circuit improved from Tremblay, Delfosse, and Beverland.<n>We evaluate the performance of state-of-the-art QLDPC codes and decoders under various settings.
  arXiv  Detail & Related papers  (2025-04-03T15:14:13Z)
• 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.<n>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.<n>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)
• 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)
• Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
  We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs) The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
  arXiv  Detail & Related papers  (2024-08-09T16:47:49Z)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
  We propose a decoder for QLDPC codes based on BP guided decimation (BPGD) BPGD significantly reduces the BP failure rate due to non-convergence.
  arXiv  Detail & Related papers  (2023-12-18T05:58:07Z)
• Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices [45.997444794696676]
  Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers.<n>One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder.<n>We first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices.<n>We extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders.
  arXiv  Detail & Related papers  (2023-08-16T08:24:06Z)
• 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)
• 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)
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding [5.5165579223151795]
  We use QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of $3$-qubit GHZ states to construct a scalable GHZ purification protocol.
  arXiv  Detail & Related papers  (2022-10-25T16:42:32Z)

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.