Quantum error correction with higher Gottesman-Kitaev-Preskill codes: minimal measurements and linear optics

• URL: http://arxiv.org/abs/2110.05315v1
• Date: Mon, 11 Oct 2021 14:35:07 GMT
• Title: Quantum error correction with higher Gottesman-Kitaev-Preskill codes: minimal measurements and linear optics
• Authors: Frank Schmidt and Peter van Loock
• Abstract summary: We propose two schemes to obtain Gottesman-Kitaev-Preskill (GKP) error syndromes by means of linear optical operations, homodyne measurements and GKP ancillae. For a concatenation of GKP codes with a stabilizer code only $2n$ measurements are needed in order to obtain the complete syndrome information.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose two schemes to obtain Gottesman-Kitaev-Preskill (GKP) error syndromes by means of linear optical operations, homodyne measurements and GKP ancillae. This includes showing that for a concatenation of GKP codes with a $[n,k,d]$ stabilizer code only $2n$ measurements are needed in order to obtain the complete syndrome information, significantly reducing the number of measurements in comparison to the canonical concatenated measurement scheme and at the same time generalizing linear-optics-based syndrome detections to higher GKP codes. Furthermore, we analyze the possibility of building the required ancilla states from single-mode states and linear optics. We find that for simple GKP codes this is possible, whereas for concatenations with qubit Calderbank-Shor-Steane (CSS) codes of distance $d\geq3$ it is not. We also consider the canonical concatenated syndrome measurements and propose methods for avoiding crosstalk between ancillae. In addition, we make use of the observation that the concatenation of a GKP code with a stabilizer code forms a lattice in order to see the analog information decoding of such codes from a different perspective allowing for semi-analytic calculations of the logical error rates.

Related papers

• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• 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)
• 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)
• Biased Gottesman-Kitaev-Preskill repetition code [0.0]
  Continuous-variable quantum computing architectures based upon the Gottesmann-Kitaev-Preskill (GKP) encoding have emerged as a promising candidate. We study the code-capacity behaviour of a rectangular-lattice GKP encoding with a repetition code under an isotropic Gaussian displacement channel.
  arXiv  Detail & Related papers  (2022-12-21T22:56:05Z)
• 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)
• Qubit-oscillator concatenated codes: decoding formalism & code comparison [1.8759305308855916]
  Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. GKP-stabilizer codes allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes.
  arXiv  Detail & Related papers  (2022-09-10T02:30:15Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• 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)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• 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.