Gottesman-Kitaev-Preskill codes: A lattice perspective

• URL: http://arxiv.org/abs/2109.14645v3
• Date: Tue, 8 Feb 2022 16:21:36 GMT
• Title: Gottesman-Kitaev-Preskill codes: A lattice perspective
• Authors: Jonathan Conrad, Jens Eisert and Francesco Arzani
• Abstract summary: We show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the product of lattices. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the tensord surface-GKP code.
• Score: 0.7734726150561088
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes. We derive formal bounds on code parameters, show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the tensor product of lattices and point to natural resource savings that have remained hidden in recent approaches. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the concatenated surface-GKP code.

Related papers

• 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)
• Lattices, Gates, and Curves: GKP codes as a Rosetta stone [0.0]
  We explain how GKP Clifford gates arise as symplectic automorphisms of the corresponding GKP lattice. For a single-mode GKP code, we identify the space of all GKP codes with the moduli space of elliptic curves. We construct a universal family of GKP codes and show how it gives rise to an explicit construction of fiber bundle fault tolerance.
  arXiv  Detail & Related papers  (2024-07-03T16:57:53Z)
• Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
  We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
  arXiv  Detail & Related papers  (2023-04-05T20:28:04Z)
• 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)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• 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)
• Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound [9.466536273518134]
  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.
  arXiv  Detail & Related papers  (2021-11-13T03:42:12Z)
• 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)
• Galois hulls of MDS codes and their quantum error correction [18.763290930749235]
  We give new families of MDS codes with Galois hulls of arbitrary dimensions. We construct nine new families of MDS entanglement-assisted quantum error-correcting codes.
  arXiv  Detail & Related papers  (2020-02-28T17:54:57Z)

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.