Abstract Conventional approaches towards creating a large-scale, fault-tolerant quantum computer require an error correction scheme that uses multiple physical qubits to encode one logical qubit of protected quantum information. A key limiting factor in realizing error-corrected quantum information processing is the large ratio of physical-to-logical qubits required by many error correction codes, outstripping the size of near-term devices. The Gottesman–Kitaev–Preskill (GKP) code offers hardware efficiency at the cost of increased encoding complexity by encoding a logical qubit into a single quantum harmonic oscillator. Building on earlier demonstrations of GKP-encoded operations, we realize an entangling gate on GKP logical qubits. Our experiments use an optimal control strategy that deterministically implements a universal set of energy-preserving logical gates on finite-energy GKP states encoded in the mechanical motions of a trapped ion. We also directly generate a GKP Bell state starting from vacuum. Our approach is compatible with existing hardware architectures, demonstrating the potential for optimal control techniques with advanced encoding schemes to accelerate the path towards large-scale fault-tolerant quantum information processing.
Abstract Conventional approaches towards creating a large-scale, fault-tolerant quantum computer require an error correction scheme that uses multiple physical qubits to encode one logical qubit of protected quantum information. A key limiting factor in realizing error-corrected quantum information processing is the large ratio of physical-to-logical qubits required by many error correction codes, outstripping the size of near-term devices. The Gottesman–Kitaev–Preskill (GKP) code offers hardware efficiency at the cost of increased encoding complexity by encoding a logical qubit into a single quantum harmonic oscillator. Building on earlier demonstrations of GKP-encoded operations, we realize an entangling gate on GKP logical qubits. Our experiments use an optimal control strategy that deterministically implements a universal set of energy-preserving logical gates on finite-energy GKP states encoded in the mechanical motions of a trapped ion. We also directly generate a GKP Bell state starting from vacuum. Our approach is compatible with existing hardware architectures, demonstrating the potential for optimal control techniques with advanced encoding schemes to accelerate the path towards large-scale fault-tolerant quantum information processing.
To be useful, quantum computers will be required to successfully correct errors occurring at the hardware level. Bosonic codes provide a hardware-efficient option for error correction, but fault-tolerance further requires that the available gate interactions be compatible with the code. A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code, for which a linear beamsplitter-like coupling between two bosonic modes is fault-tolerant, making this a key primitive for building larger systems. Here, using two motional modes of a trapped ion, we demonstrate the generation of entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter. We generate all four Bell states with an average fidelity of 69%, and subsequently demonstrate an extension of the entangled state lifetime through the use of quantum error correction. These results complete the set of Gaussian operations required for quantum computing with GKP codes and enable explorations of multi-mode bosonic encodings as well as fundamental tests of information channels.
Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev, and Preskill (GKP). The recently reported generation and error correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.
We present a universal logical gate set for finite-energy Gottesman-Kitaev-Preskill (GKP) qubits encoded in the harmonic motional states of trapped neutral atoms. Internal electronic states serve as ancilla for implementing state-dependent conditional displacements in phase space, enabling arbitrary single-qubit phase gates. A Transient Rydberg excitation-mediated atomic dipole-dipole interaction enables a controlled-Z gate without invoking the blockade mechanism. The gates operate under magic-trapping conditions, allowing continuous trapping throughout the gate sequence, thereby preserving the motional encoding without intermediate measurement or feedforward. We assess the experimental feasibility of the proposed protocols using neutral 88Sr atoms and obtain average gate fidelities of 0.986 for single-qubit phase gates and 0.985 for the controlled-Z gate at a finite squeezing parameter of Δ=0.25 (12 dB of squeezing), increasing to 0.997 and 0.995 respectively as Δ reaches 0.1. These results provide a route toward universal, measurement-free logical control of motional GKP qubits in neutral-atom architectures.
Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and holding great promise for error correction through bosonic encoding. Within this framework, the foundational notion of computational universality was introduced by Lloyd and Braunstein [], and has proven especially successful since it allows for the identification of finite sets of universal CV gates independent of the encoding scheme. However, realizing the full power of this computational model requires achieving fault tolerance, which in turn demands discretization via some form of encoding—and, to date, no proof exists that universal CV gates can give rise to encoded fault tolerance. We present compelling evidence in this direction by utilizing the Gottesman-Kitaev-Preskill (GKP) encoding. Specifically, we numerically optimize the generation of GKP states from vacua using circuits comprised solely of universal CV gates, and demonstrate that the resulting states are of sufficient quality to exhibit error probabilities below the threshold required for fault-tolerant memory via concatenated GKP-stabilizer codes.
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing in superconducting circuits. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level, therefore reducing drastically the hardware requirements to bring fault-tolerant quantum computing to scale. Going beyond the well-known Gottesman-Kitaev-Preskill (GKP) code, we discuss how using multiple bosonic modes to encode a single qubit offers increased protection against control errors and enhances its overall error-correcting capabilities. Given recent successful demonstrations of critical components of this architecture, we argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.