The generation of a logical qubit called the Gottesman-Kitaev-Preskill (GKP) qubit in an optical traveling wave is a major challenge for realizing large-scale universal fault-tolerant optical quantum computers. Recently, probabilistic generation of elementary GKP qubits has been demonstrated using photon number measurements and homodyne measurements. However, the generation rate is only a few Hz, and it will be difficult to generate fault-tolerant GKP qubits at a practical rate unless success probability is significantly improved. Here, we propose a method to efficiently synthesize GKP qubits from several quantum states by adaptive Gaussian operations. In the initial-state preparation that utilizes photon number measurements, an adaptive operation allows any measurement outcome above a certain threshold to be considered as a success. This threshold is lowered by utilizing the generalized photon subtraction method. The initial states are synthesized into a GKP qubit by homodyne measurements and a subsequent adaptive operation. As a result, the single-shot success probability of generating fault-tolerant GKP qubits in a realistic scale system exceeds
10, which is $1\ifmmode\times\else\texttimes\fi{}{10}^{6}$ times better than previous methods. This proposal will become a powerful tool for advancing optical quantum computers from the proof-of-principle stage to practical application.
Concatenation of a bosonic code with a qubit code is one of the promising ways to achieve fault-tolerant quantum computation. As one of the most important bosonic codes, the Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement errors in phase space. If the noise in phase space is biased, the square-lattice GKP code can be concatenated with the repetition code that promises a high fault-tolerant threshold to suppress the logical error. In this work, we study the performance of GKP repetition codes with finite-energy ancillary GKP qubits in correcting biased noise. We find that there exists a critical value of noise variance for the ancillary GKP qubit such that the logical Pauli error rate decreases when increasing the code size. Furthermore, one round of GKP error correction has to be performed before concatenating with the repetition code. Our study paves the way for practical implementation of error correction by concatenating the GKP code with low-level qubit codes.
Abstract Boson quantum error correction is an important means to realize quantum error correction information processing. In this paper, we consider the connection of a single-mode Gottesman-Kitaev-Preskill (GKP) code with a two-dimensional (2D) surface (surface-GKP code) on a triangular quadrilateral lattice. On the one hand, we use a Steane-type scheme with maximum likelihood estimation for surface-GKP code error correction. On the other hand, the minimum-weight perfect matching (MWPM) algorithm is used to decode surface-GKP codes. In the case where only the data GKP qubits are noisy, the threshold reaches σ ≈ 0.5 (
pˉ≈12.3% p ¯ ≈ 12.3 % ). If the measurement is also noisy, the threshold is reached σ ≈ 0.25 (
pˉ≈10.02% p ¯ ≈ 10.02 % ). More importantly, we introduce a neural network decoder. When the measurements in GKP error correction are noise-free, the threshold reaches σ ≈ 0.78 (
pˉ≈15.12% p ¯ ≈ 15.12 % ). The threshold reaches σ ≈ 0.34 (
pˉ≈11.37% p ¯ ≈ 11.37 % ) when all measurements are noisy. Through the above optimization method, multi-party quantum error correction will achieve a better guarantee effect in fault-tolerant quantum computing.