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

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.

Revised version - Accepted for publication in Quantum. Two column format, 24 pages and 10 figures. Added QC-QLDPC codes used for simulations in Appendix

References in corpus (5)

• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Analog quantum error correction with encoding a qubit into an oscillator
• Improved quantum error correction using soft information
• Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors
• Quantum Computation and Communication in Bosonic Systems

Cited by in corpus (21)

• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
• Hierarchical memories: Simulating quantum LDPC codes with local gates
• Qubit-oscillator concatenated codes: decoding formalism & code comparison
• Spin squeezed GKP codes for quantum error correction in atomic ensembles
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
• Analog information decoding of bosonic quantum LDPC codes
• Fault-tolerant logical measurements via homological measurement
• Weight Reduced Stabilizer Codes with Lower Overhead
• Optimal encoding of oscillators into more oscillators
• Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
• Classical product code constructions for quantum Calderbank-Shor-Steane codes
• High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
• End-to-end switchless architecture for fault-tolerant photonic quantum computing
• Bosonic Pauli+: Efficient Simulation of Concatenated Gottesman-Kitaev-Preskill Codes
• QUITS: A modular Qldpc code circUIT Simulator
• Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
• GNarsil: Splitting Stabilizers into Gauges
• Multimode rotationally symmetric bosonic codes from group-theoretic construction
• Fault Tolerant Quantum Simulation via Symplectic Transvections
• Symmetry-enriched topological order and quasifractonic behavior in ${\mathbb{Z}}_N$ stabilizer codes