Closest lattice point decoding for multimode Gottesman-Kitaev-Preskill codes

Abstract

Quantum error correction (QEC) plays an essential role in fault-tolerantly realizing quantum algorithms of practical interest. Among different approaches to QEC, encoding logical quantum information in harmonic oscillator modes has been shown to be promising and hardware efficient. In this work, we study multimode Gottesman-Kitaev-Preskill (GKP) codes, encoding a qubit in many oscillators, through a lattice perspective. In particular, we implement a closest point decoding strategy for correcting random Gaussian shift errors. For decoding a generic multimode GKP code, we first identify its corresponding lattice followed by finding the closest lattice point in its symplectic dual lattice to a candidate shift error compatible with the error syndrome. We use this method to characterize the error correction capabilities of several known multimode GKP codes, including their code distances and fidelities. We also perform numerical optimization of multimode GKP codes up to ten modes and find three instances (with three, seven and nine modes) with better code distances and fidelities compared to the known GKP codes with the same number of modes. While exact closest point decoding incurs exponential time cost in the number of modes for general unstructured GKP codes, we give several examples of structured GKP codes (i.e., of the repetition-rectangular GKP code types) where the closest point decoding can be performed exactly in linear time. For the surface-GKP code, we show that the closest point decoding can be performed exactly in polynomial time with the help of a minimum-weight-perfect-matching algorithm (MWPM). We show that this MWPM closest point decoder improves both the fidelity and the noise threshold of the surface-GKP code to 0.602 compared to the previously studied MWPM decoder assisted by log-likelihood analog information which yields a noise threshold of 0.599.

Correct the mistake in Eq. 118, and a number of typos

References in corpus (46)

• Quantum Computing in the NISQ era and beyond
• Mixed State Entanglement and Quantum Error Correction
• Gaussian Quantum Information
• Good Quantum Error-Correcting Codes Exist
• Encoding a qubit in an oscillator
• Quantum Error Correction for Quantum Memories
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Stabilizer Codes and Quantum Error Correction
• Dynamically protected cat-qubits: a new paradigm for universal quantum computation
• Confining the state of light to a quantum manifold by engineered two-photon loss
• Squeezing as an irreducible resource
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Macroscopically distinct quantum superposition states as a bosonic code for amplitude damping
• Efficient Quantum Computation using Coherent States
• Encoding a qubit in a trapped-ion mechanical oscillator
• Performance and structure of single-mode bosonic codes
• Building a fault-tolerant quantum computer using concatenated cat codes
• The XZZX Surface Code
• Exponential suppression of bit-flips in a qubit encoded in an oscillator
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Fault-tolerant quantum computation against biased noise
• Bosonic quantum error correction codes in superconducting quantum circuits
• Bias-preserving gates with stabilized cat qubits
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• Repetition Cat Qubits for Fault-Tolerant Quantum Computation
• High-threshold fault-tolerant quantum computation with analog quantum error correction
• Quantum information processing with bosonic qubits in circuit QED
• Quantum Error Correction with the Toric-GKP Code
• Towards Scalable Bosonic Quantum Error Correction
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Tailoring surface codes for highly biased noise
• Analog quantum error correction with encoding a qubit into an oscillator
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• A fault-tolerant continuous-variable measurement-based quantum computation architecture
• Stabilization of Finite-Energy Gottesman-Kitaev-Preskill States
• Encoding an oscillator into many oscillators
• Continuous-variable gate teleportation and bosonic-code error correction
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Achievable rates for the Gaussian quantum channel
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Enhanced noise resilience of the surface-GKP code via designed bias
• Reducing the overhead for quantum computation when noise is biased
• Encoding qubits in multimode grid states
• Tracking Quantum Error Correction
• Quantum error correction with the color-Gottesman-Kitaev-Preskill code

Cited by in corpus (9)

• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
• Clifford operations and homological codes for rotors and oscillators
• Bosonic Pauli+: Efficient Simulation of Concatenated Gottesman-Kitaev-Preskill Codes
• General Approach to Error Detection of Bosonic Codes via Phase Estimation
• Topological stabilizer models on continuous variables
• Safeguarding Oscillators and Qudits with Distributed Two-Mode Squeezing
• Exploring the quantum capacity of a Gaussian random displacement channel using Gottesman-Kitaev-Preskill codes and maximum likelihood decoding
• Enlarging the GKP stabilizer group for enhanced noise protection