Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits

• URL: http://arxiv.org/abs/2012.12488v2
• Date: Wed, 25 Aug 2021 06:51:13 GMT
• Title: Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits
• Authors: Lucas J. Mensen, Ben Q. Baragiola, Nicolas C. Menicucci
• Abstract summary: The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation. We present a toolkit for phase-space description and manipulation of GKP encodings.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.

Related papers

• 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)
• 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)
• 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)
• Spin squeezed GKP codes for quantum error correction in atomic ensembles [0.0]
  GKP codes encode a qubit in displaced phase space of a quantum system. We propose atomic ensemble analogues of the single-mode CV GKP code. We find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes.
  arXiv  Detail & Related papers  (2022-11-09T20:25:06Z)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Gottesman-Kitaev-Preskill codes: A lattice perspective [0.7734726150561088]
  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.
  arXiv  Detail & Related papers  (2021-09-29T18:08:37Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Coherent manipulation of graph states composed of finite-energy Gottesman-Kitaev-Preskill-encoded qubits [3.215880910089585]
  Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states is a key task. We consider the finite-energy approximation of GKP qubit states given by a coherent superposition of shifted finite-squeezed vacuum states.
  arXiv  Detail & Related papers  (2021-05-10T12:22:07Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Low overhead fault-tolerant quantum error correction with the surface-GKP code [60.44022726730614]
  We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits. We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
  arXiv  Detail & Related papers  (2021-03-11T23:07:52Z)

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.