Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.15065 · Nature

Quantum error correction of qudits beyond break-even

Benjamin L. Brock, Shraddha Singh, Alec Eickbusch, Volodymyr Sivak, Andy Z. Ding, Luigi Frunzio, S. M. Girvin, Michel Devoret

Published May 14, 2025• 104 citations
arXivHTMLPDF

Abstract

Hilbert space dimension is a key resource for quantum information processing1,2. Not only is a large overall Hilbert space an essential requirement for quantum error correction, but a large local Hilbert space can also be advantageous for realizing gates and algorithms more efficiently3–7. As a result, there has been considerable experimental effort in recent years to develop quantum computing platforms using qudits (d-dimensional quantum systems with d > 2) as the fundamental unit of quantum information8–19. Just as with qubits, quantum error correction of these qudits will be necessary in the long run, but so far, error correction of logical qudits has not been demonstrated experimentally. Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman–Kitaev–Preskill bosonic code20. Using a reinforcement learning agent21,22, we optimized the Gottesman–Kitaev–Preskill qutrit (ququart) as a ternary (quaternary) quantum memory and achieved beyond break-even error correction with a gain of 1.82 ± 0.03 (1.87 ± 0.03). This work represents a novel way of leveraging the large Hilbert space of a harmonic oscillator to realize hardware-efficient quantum error correction. Quantum error correction of a logical qutrit and ququart were experimentally realized beyond the break-even point with the Gottesman–Kitaev–Preskill bosonic code.

DOI
10.1038/s41586-025-08899-y

Related papers

Universal quantum gate set for Gottesman–Kitaev–Preskill logical qubits

Vassili G. Matsos, Christophe H. Valahu, Maverick J. Millican +4 more

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.

arXiv:2409.05455•Nature Physics•Aug 21, 2025•40 citations

Bosonic quantum error correction codes in superconducting quantum circuits

Weizhou Cai, Yuwei Ma, Weiting Wang +2 more

Quantum information is vulnerable to environmental noise and experimental imperfections, hindering the reliability of practical quantum information processors. Therefore, quantum error correction (QEC) that can protect quantum information against noise is vital for universal and scalable quantum computation. Among many different experimental platforms, superconducting quantum circuits and bosonic encodings in superconducting microwave modes are appealing for their unprecedented potential in QEC. During the last few years, bosonic QEC is demonstrated to reach the break-even point, i.e. the lifetime of a logical qubit is enhanced to exceed that of any individual components composing the experimental system. Beyond that, universal gate sets and fault-tolerant operations on the bosonic codes are also realized, pushing quantum information processing towards the QEC era. In this article, we review the recent progress of the bosonic codes, including the Gottesman-Kitaev-Preskill codes, cat codes, and binomial codes, and discuss the opportunities of bosonic codes in various quantum applications, ranging from fault-tolerant quantum computation to quantum metrology. We also summarize the challenges associated with the bosonic codes and provide an outlook for the potential research directions in the long terms.

arXiv:2010.08699•Fundamental Research•Jan 1, 2021•251 citations

Non-Markovian Feedback for Optimized Quantum Error Correction

Matteo Ballerini Puviani, Sangkha Borah, Remmy A. M. Zen +2 more

Bosonic codes allow the encoding of a logical qubit in a single component device, utilizing the infinitely large Hilbert space of a harmonic oscillator. In particular, the Gottesman-Kitaev-Preskill code has recently been demonstrated to be correctable well beyond the break-even point of the best passive encoding in the same system. Current approaches to quantum error correction (QEC) for this system are based on protocols that use feedback, but the response is based only on the latest measurement outcome. In our work, we use the recently proposed feedback-GRAPE (gradient-ascent pulse engineering with feedback) method to train a recurrent neural network that provides a QEC scheme based on memory, responding in a non-Markovian way to the full history of previous measurement outcomes, optimizing all subsequent unitary operations. This approach significantly outperforms current strategies and paves the way for more powerful measurement-based QEC protocols.

arXiv:2312.07391•Physical Review Letters•Jan 16, 2025•20 citations

Het gebruik van qudits voor fouttolerante kwantum computatie

James Keppens

Qudits can be described by a state vector in a q-dimensional Hilbert space, enabling a more extensive encoding and manipulation of information compared to qubits. This implies that conducting fault-tolerant quantum computations using qudits rather than qubits might entail less overhead. In this work, I investigate the viability of qudits across three key components of a fault-tolerant quantum computer: hardware control, quantum error-correction codes, and logical gate operations. This includes benchmarking physically decomposed qudit gates against qubit-based implementations for a specific donor-spin system, threshold simulations of qudit error-correction codes using tailored simulators and decoders, and simulations of magic state distillation circuits with qudits. At the hardware level, a numerical leakage-aware randomized benchmarking protocol is applied to a native ququart encoding in a donor-spin system and compared against an equivalent pair of encoded qubits. The ququart implementation is found to reduce the lower-bound gate infidelity by 40 – 50%, a consequence of the fewer ESR and EDSR pulses and correspondingly lower cumulative noise exposure. This provides a concrete, platform-specific demonstration of reduced physical-gate overhead prior to the introduction of any error-correction redundancy. At the level of quantum error correction, the viability of qudits is investigated through the construction and simulation of the quantum circuits for the five-qudit perfect code. The code is evaluated under a multidimensional circuit-level noise model using decoders specifically adapted to the qudit setting. This yields the first threshold estimates reported for qutrit and ququint codes under circuit-level noise. After introducing a flag qudit to protect the code from hook errors, comparable error thresholds of the order of 10–4 are obtained for qudits of dimensions 2, 3 and 5. These simulations were subsequently performed using Sdim, a stabilizer tableau simulator that enabled threshold estimation up to dimension q = 7, a regime inaccessible to state-vector simulators such as Cirq. At the level of logical operations, magic state distillation protocols of the Bravyi-Kitaev type are simulated under logical circuit-level noise, to my knowledge for the first time for this protocol family. Once the Clifford operations implementing the distillation circuit are subject to a nonzero logical error rate, the achievable output fidelity saturates within a finite usable distillation range rather than an arbitrarily improvable one: roughly 0.9-15.6% for the |T⟩₂-type protocol, 3.7-5% for the |H⟩₂-type protocol and 5.4-7.4% for the |H+⟩₃-type protocol at a representative logical circuit-level noise level of pCL = 10–3. The qutrit protocol achieves a more favorable distillation threshold but suffers from a substantially lower yield due to its reduced syndrome acceptance probability. This highlights a trade-off between threshold performance and yield that is intrinsic to the higher-dimensional construction. Further investigation with more advanced and larger-scale protocols is required to better understand and characterize this behavior. Overall, these results show that qudits can provide real efficiency benefits: higher-dimensional control can improve physical gate fidelity, and qutrit and ququint error-correction thresholds can match those of qubits when hook errors are properly handled. However, logical circuit-level noise limits the maximum magic state fidelity, showing that the benefits of qudits are not yet fully realized at the logical-operation level. This thesis provides the first broad numerical study of these effects and introduces the simulation tools needed to explore larger code families, decoders, and distillation protocols.

•Oct 7, 2026•0 citations

Autonomous Quantum Error Correction of Gottesman-Kitaev-Preskill States

Dany Lachance-Quirion, Marc-Antoine Lemonde, Jean Olivier Simoneau +12 more

The Gottesman-Kitaev-Preskill (GKP) code encodes a logical qubit into a bosonic system with resilience against single-photon loss, the predominant error in most bosonic systems. Here we present experimental results demonstrating quantum error correction of GKP states based on reservoir engineering of a superconducting device. Error correction is made fully autonomous through an unconditional reset of an auxiliary transmon qubit. We show that the lifetime of the logical qubit is increased from quantum error correction, therefore reaching the point at which more errors are corrected than generated.

arXiv:2310.11400•Physical Review Letters•Apr 12, 2024•62 citations

Continuous-Variable Error Correction for General Gaussian Noises

Jing Wu, Quntao Zhuang

Quantum error correction is essential for robust quantum-information processing with noisy devices. As bosonic quantum systems play a role in quantum sensing, communication, and computation, it is useful to design error-correction codes suitable for these systems against various different types of noises. While most efforts aim at protecting qubits encoded into the infinite-dimensional Hilbert space of a bosonic mode, Ref. [Phys. Rev. Lett. 125, 080503 (2020)] proposed an error-correction code to maintain the infinite-dimensional-Hilbert-space nature of bosonic systems by encoding a single bosonic mode into multiple bosonic modes. Enabled by Gottesman-Kitaev-Preskill states as ancilla, the code overcomes the no-go theorem of Gaussian error correction. In this work, we generalize the error-correction code to the scenario with general correlated and heterogeneous Gaussian noises, including memory effects. We introduce Gaussian preprocessing and postprocessing to convert the general noise model to an independent but heterogeneous collection of additive white Gaussian noise channels and then apply concatenated codes in an optimized manner. To evaluate the performance, we develop a theory framework to enable the efficient calculation of the noise SD after the error correction, despite the non-Gaussian nature of the codes. Our code provides the optimal scaling of the residue-noise SD with the number of modes and can be widely applied to distributed sensor networks, network communication, and composite quantum-memory systems.

arXiv:2101.02300•Physical Review Applied•Mar 25, 2021•25 citations
Hilbert space dimension is a key resource for quantum information processing1,2. Not only is a large overall Hilbert space an essential requirement for quantum error correction, but a large local Hilbert space can also be advantageous for realizing gates and algorithms more efficiently3–7. As a result, there has been considerable experimental effort in recent years to develop quantum computing platforms using qudits (d-dimensional quantum systems with d > 2) as the fundamental unit of quantum information8–19. Just as with qubits, quantum error correction of these qudits will be necessary in the long run, but so far, error correction of logical qudits has not been demonstrated experimentally. Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman–Kitaev–Preskill bosonic code20. Using a reinforcement learning agent21,22, we optimized the Gottesman–Kitaev–Preskill qutrit (ququart) as a ternary (quaternary) quantum memory and achieved beyond break-even error correction with a gain of 1.82 ± 0.03 (1.87 ± 0.03). This work represents a novel way of leveraging the large Hilbert space of a harmonic oscillator to realize hardware-efficient quantum error correction. Quantum error correction of a logical qutrit and ququart were experimentally realized beyond the break-even point with the Gottesman–Kitaev–Preskill bosonic code.
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.
Quantum information is vulnerable to environmental noise and experimental imperfections, hindering the reliability of practical quantum information processors. Therefore, quantum error correction (QEC) that can protect quantum information against noise is vital for universal and scalable quantum computation. Among many different experimental platforms, superconducting quantum circuits and bosonic encodings in superconducting microwave modes are appealing for their unprecedented potential in QEC. During the last few years, bosonic QEC is demonstrated to reach the break-even point, i.e. the lifetime of a logical qubit is enhanced to exceed that of any individual components composing the experimental system. Beyond that, universal gate sets and fault-tolerant operations on the bosonic codes are also realized, pushing quantum information processing towards the QEC era. In this article, we review the recent progress of the bosonic codes, including the Gottesman-Kitaev-Preskill codes, cat codes, and binomial codes, and discuss the opportunities of bosonic codes in various quantum applications, ranging from fault-tolerant quantum computation to quantum metrology. We also summarize the challenges associated with the bosonic codes and provide an outlook for the potential research directions in the long terms.
Bosonic codes allow the encoding of a logical qubit in a single component device, utilizing the infinitely large Hilbert space of a harmonic oscillator. In particular, the Gottesman-Kitaev-Preskill code has recently been demonstrated to be correctable well beyond the break-even point of the best passive encoding in the same system. Current approaches to quantum error correction (QEC) for this system are based on protocols that use feedback, but the response is based only on the latest measurement outcome. In our work, we use the recently proposed feedback-GRAPE (gradient-ascent pulse engineering with feedback) method to train a recurrent neural network that provides a QEC scheme based on memory, responding in a non-Markovian way to the full history of previous measurement outcomes, optimizing all subsequent unitary operations. This approach significantly outperforms current strategies and paves the way for more powerful measurement-based QEC protocols.
Qudits can be described by a state vector in a q-dimensional Hilbert space, enabling a more extensive encoding and manipulation of information compared to qubits. This implies that conducting fault-tolerant quantum computations using qudits rather than qubits might entail less overhead. In this work, I investigate the viability of qudits across three key components of a fault-tolerant quantum computer: hardware control, quantum error-correction codes, and logical gate operations. This includes benchmarking physically decomposed qudit gates against qubit-based implementations for a specific donor-spin system, threshold simulations of qudit error-correction codes using tailored simulators and decoders, and simulations of magic state distillation circuits with qudits. At the hardware level, a numerical leakage-aware randomized benchmarking protocol is applied to a native ququart encoding in a donor-spin system and compared against an equivalent pair of encoded qubits. The ququart implementation is found to reduce the lower-bound gate infidelity by 40 – 50%, a consequence of the fewer ESR and EDSR pulses and correspondingly lower cumulative noise exposure. This provides a concrete, platform-specific demonstration of reduced physical-gate overhead prior to the introduction of any error-correction redundancy. At the level of quantum error correction, the viability of qudits is investigated through the construction and simulation of the quantum circuits for the five-qudit perfect code. The code is evaluated under a multidimensional circuit-level noise model using decoders specifically adapted to the qudit setting. This yields the first threshold estimates reported for qutrit and ququint codes under circuit-level noise. After introducing a flag qudit to protect the code from hook errors, comparable error thresholds of the order of 10–4 are obtained for qudits of dimensions 2, 3 and 5. These simulations were subsequently performed using Sdim, a stabilizer tableau simulator that enabled threshold estimation up to dimension q = 7, a regime inaccessible to state-vector simulators such as Cirq. At the level of logical operations, magic state distillation protocols of the Bravyi-Kitaev type are simulated under logical circuit-level noise, to my knowledge for the first time for this protocol family. Once the Clifford operations implementing the distillation circuit are subject to a nonzero logical error rate, the achievable output fidelity saturates within a finite usable distillation range rather than an arbitrarily improvable one: roughly 0.9-15.6% for the |T⟩₂-type protocol, 3.7-5% for the |H⟩₂-type protocol and 5.4-7.4% for the |H+⟩₃-type protocol at a representative logical circuit-level noise level of pCL = 10–3. The qutrit protocol achieves a more favorable distillation threshold but suffers from a substantially lower yield due to its reduced syndrome acceptance probability. This highlights a trade-off between threshold performance and yield that is intrinsic to the higher-dimensional construction. Further investigation with more advanced and larger-scale protocols is required to better understand and characterize this behavior. Overall, these results show that qudits can provide real efficiency benefits: higher-dimensional control can improve physical gate fidelity, and qutrit and ququint error-correction thresholds can match those of qubits when hook errors are properly handled. However, logical circuit-level noise limits the maximum magic state fidelity, showing that the benefits of qudits are not yet fully realized at the logical-operation level. This thesis provides the first broad numerical study of these effects and introduces the simulation tools needed to explore larger code families, decoders, and distillation protocols.
The Gottesman-Kitaev-Preskill (GKP) code encodes a logical qubit into a bosonic system with resilience against single-photon loss, the predominant error in most bosonic systems. Here we present experimental results demonstrating quantum error correction of GKP states based on reservoir engineering of a superconducting device. Error correction is made fully autonomous through an unconditional reset of an auxiliary transmon qubit. We show that the lifetime of the logical qubit is increased from quantum error correction, therefore reaching the point at which more errors are corrected than generated.
Quantum error correction is essential for robust quantum-information processing with noisy devices. As bosonic quantum systems play a role in quantum sensing, communication, and computation, it is useful to design error-correction codes suitable for these systems against various different types of noises. While most efforts aim at protecting qubits encoded into the infinite-dimensional Hilbert space of a bosonic mode, Ref. [Phys. Rev. Lett. 125, 080503 (2020)] proposed an error-correction code to maintain the infinite-dimensional-Hilbert-space nature of bosonic systems by encoding a single bosonic mode into multiple bosonic modes. Enabled by Gottesman-Kitaev-Preskill states as ancilla, the code overcomes the no-go theorem of Gaussian error correction. In this work, we generalize the error-correction code to the scenario with general correlated and heterogeneous Gaussian noises, including memory effects. We introduce Gaussian preprocessing and postprocessing to convert the general noise model to an independent but heterogeneous collection of additive white Gaussian noise channels and then apply concatenated codes in an optimized manner. To evaluate the performance, we develop a theory framework to enable the efficient calculation of the noise SD after the error correction, despite the non-Gaussian nature of the codes. Our code provides the optimal scaling of the residue-noise SD with the number of modes and can be widely applied to distributed sensor networks, network communication, and composite quantum-memory systems.