Quantum Error Correction with the Gottesman-Kitaev-Preskill Code

• URL: http://arxiv.org/abs/2106.12989v1
• Date: Thu, 24 Jun 2021 13:04:57 GMT
• Title: Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Authors: Arne L. Grimsmo and Shruti Puri
• Abstract summary: The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by Daniel Gottesman, Alexei Kitaev, and John Preskill. We provide an overview of the GKP code with emphasis on its implementation in the circuit-QED architecture.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by Daniel Gottesman, Alexei Kitaev, and John Preskill as a way to encode a qubit in an oscillator. The GKP codewords are coherent superpositions of periodically displaced squeezed vacuum states. Because of the challenge of merely preparing the codewords, the GKP code was for a long time considered to be impractical. However, the remarkable developments in quantum hardware and control technology in the last two decades has made the GKP code a frontrunner in the race to build practical, fault-tolerant bosonic quantum technology. In this Perspective, we provide an overview of the GKP code with emphasis on its implementation in the circuit-QED architecture and present our outlook on the challenges and opportunities for scaling it up for hardware-efficient, fault-tolerant quantum error correction.

Related papers

• Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits [0.0]
  This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level. We argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
  arXiv  Detail & Related papers  (2024-09-09T17:20:06Z)
• Autonomous quantum error correction of Gottesman-Kitaev-Preskill states [0.3478748525737507]
  The Gottesman-Kitaev-Preskill (GKP) code encodes a logical qubit into a bosonic system with resilience against single-photon loss. We present experimental results demonstrating quantum error correction of GKP states based on reservoir engineering of a superconducting device.
  arXiv  Detail & Related papers  (2023-10-17T17:07:28Z)
• Advances in Bosonic Quantum Error Correction with Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications [4.656672793044798]
  Gottesman-Kitaev-Preskill (GKP) codes are among the first to reach a break-even point for quantum error correction. GKP codes are widely recognized for their promise in quantum computation. This review focuses on the basic working mechanism, performance characterization, and the many applications of GKP codes.
  arXiv  Detail & Related papers  (2023-08-05T16:10:47Z)
• 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 process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• 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)
• Quantum Error Correction in the Lowest Landau Level [0.0]
  We develop finite-dimensional versions of the quantum error-correcting codes proposed by Albert, Covey, and Preskill. Our codes can be realized by a charged particle in a Landau level on a spherical geometry.
  arXiv  Detail & Related papers  (2022-10-30T21:36:00Z)
• Hardware-efficient error-correcting codes for large nuclear spins [62.997667081978825]
  We present a hardware-efficient quantum protocol that corrects phase flips of a nuclear spin using explicit experimentally feasible operations. Results provide a realizable blueprint for a corrected spin-based qubit.
  arXiv  Detail & Related papers  (2021-03-15T17:14:48Z)
• Universal quantum computation and quantum error correction with ultracold atomic mixtures [47.187609203210705]
  We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates. One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information. We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
  arXiv  Detail & Related papers  (2020-10-29T20:17:14Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.