Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound

• URL: http://arxiv.org/abs/2111.07029v2
• Date: Mon, 11 Jul 2022 22:01:03 GMT
• Title: Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
• Authors: Nithin Raveendran, Narayanan Rengaswamy, Filip Rozp\k{e}dek, Ankur Raina, Liang Jiang, and Bane Vasi\'c
• Abstract summary: We show how to exploit GottesmanKitaev-Preskill (GKP) code with generic quantum low-density parity-check (QLDPC) codes. We also discuss new fundamental and practical questions that arise from this work on channel capacity under GKP analog information.
• Score: 9.466536273518134
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction has recently been shown to benefit greatly from specific physical encodings of the code qubits. In particular, several researchers have considered the individual code qubits being encoded with the continuous variable GottesmanKitaev-Preskill (GKP) code, and then imposed an outer discrete-variable code such as the surface code on these GKP qubits. Under such a concatenation scheme, the analog information from the inner GKP error correction improves the noise threshold of the outer code. However, the surface code has vanishing rate and demands a lot of resources with growing distance. In this work, we concatenate the GKP code with generic quantum low-density parity-check (QLDPC) codes and demonstrate a natural way to exploit the GKP analog information in iterative decoding algorithms. We first show the noise thresholds for two lifted product QLDPC code families, and then show the improvements of noise thresholds when the iterative decoder - a hardware-friendly min-sum algorithm (MSA) - utilizes the GKP analog information. We also show that, when the GKP analog information is combined with a sequential update schedule for MSA, the scheme surpasses the well-known CSS Hamming bound for these code families. Furthermore, we observe that the GKP analog information helps the iterative decoder in escaping harmful trapping sets in the Tanner graph of the QLDPC code, thereby eliminating or significantly lowering the error floor of the logical error rate curves. Finally, we discuss new fundamental and practical questions that arise from this work on channel capacity under GKP analog information, and on improving decoder design and analysis.

Related papers

• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• 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)
• Analog information decoding of bosonic quantum LDPC codes [3.34006871348377]
  We propose novel decoding methods that explicitly exploit the syndrome information obtained from a bosonic qubit readout. Our results lay the foundation for general decoding algorithms using analog information and demonstrate promising results in the direction of fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2023-11-02T15:41:03Z)
• Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla [0.6802401545890963]
  Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement error in phase space. If noise in phase space is biased, square-lattice GKP code can be ancillaryd with XZZX surface code or repetition code. We study the performance of GKP repetition codes with physical ancillary GKP qubits in correcting biased noise.
  arXiv  Detail & Related papers  (2023-08-03T06:14:43Z)
• Closest lattice point decoding for multimode Gottesman-Kitaev-Preskill codes [0.8192907805418581]
  Quantum error correction (QEC) plays an essential role in fault-tolerantly realizing quantum algorithms of practical interest. We study multimode Gottesman-Kitaev-Preskill (GKP) codes, encoding a qubit in many oscillators. We implement a closest point decoding strategy for correcting random shift errors.
  arXiv  Detail & Related papers  (2023-03-08T16:42:42Z)
• Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem [5.497441137435869]
  We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived class of NTRU-GKP codes has the additional property that decoding for a displacement noise model is equivalent to decrypting the NTRU cryptosystem. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography.
  arXiv  Detail & Related papers  (2023-03-04T14:39:20Z)
• 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)
• 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)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.