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

Het gebruik van qudits voor fouttolerante kwantum computatie

James Keppens

Published Oct 7, 2026• 0 citations
OpenAlex

Abstract

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.

Related papers

Qudit vs. qubit: Simulated performance of error-correction codes in higher dimensions

James Keppens, Quinten Eggerickx, Vukan Levajac +2 more

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, we investigate the viability of qudits in error correction codes by creating and simulating the quantum circuitry for the smallest qudit error correction code with a multidimensional circuit-level noise model and specifically adapted decoders. 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$.

arXiv:2502.05992•Physical Review A•Sep 3, 2025•11 citations

Towards fault-tolerant quantum computation with higher-dimensional systems

Hussain Anwar

The main focus of this thesis is to explore the advantages of using higher-dimensional quantum systems (qudits) as building blocks for fault-tolerant quantum computation. In particular, we investigate the two main essential ingredients of many state-of-the-art fault-tolerant schemes [133], which are magic state distillation and topological error correction. The theory for both of these components is well established for the qubit case, but little has been known for the generalised qudit case. For magic state distillation, we first present a general numerical approach that can be used to investigate the distillation properties of any stabilizer code. We use this approach to study small threedimensional (qutrit) codes and classify, for the first time, new types of qutrit magic states. We then provide an analytic study of a family of distillation protocols based on the quantum Reed-Muller codes. We discover a particular five-dimensional code that, by many measures, outperforms all known qubit codes. For the topological error correction, we study the qudit toric code serving as a quantum memory. For this purpose we examine an efficient renormalization group decoder to estimate the error correction threshold. We find that when the qudit toric code is subject to a generalised bit-flip noise, and for a sufficiently high dimension, a threshold of 30% can be obtained under perfect decoding.

•Mar 28, 2014•3 citations

Fault-Tolerant Encoding of Logical Qudits in Spin Systems

Sumin Lim

Universal quantum computers require fault-tolerant logical qudits, as qudits naturally align with the simulation of multi-level physical systems. Here, we present a general framework and working examples for encoding fault-tolerant logical qudits in finite-dimensional spin systems. We construct distance-$3$, distance-$5$ codewords, and general $2t+1$-distance codes that can be implemented using a single physical qudit or a small number of coupled qudits for higher distances, while requiring a Hilbert space dimension significantly smaller than conventional constructions based on multiple logical qubits. Logical operations and error correction protocols can be implemented with polynomial scaling in the number of elementary operations. We further discuss schematic designs for physical implementation and required single-gate fidelities, which are compatible with current spin qudit platforms. This strategy provides a resource-efficient path toward realizing fault-tolerant logical qudits in finite multi-level physical systems.

quant-pharXiv:2511.06620•Physical Review A•Nov 11, 2025•0 citations

Realization of Real-Time Fault-Tolerant Quantum Error Correction

Ciarán Ryan-Anderson, Justin Bohnet, K. Lee +14 more

Correcting errors in real time is essential for reliable large-scale quantum computations. Realizing this high-level function requires a system capable of several low-level primitives, including single-qubit and two-qubit operations, mid-circuit measurements of subsets of qubits, real-time processing of measurement outcomes, and the ability to condition subsequent gate operations on those measurements. In this work, we use a ten qubit QCCD trapped-ion quantum computer to encode a single logical qubit using the $[[7,1,3]]$ color code, first proposed by Steane~\cite{steane1996error}. The logical qubit is initialized into the eigenstates of three mutually unbiased bases using an encoding circuit, and we measure an average logical SPAM error of $1.7(6) \times 10^{-3}$, compared to the average physical SPAM error $2.4(8) \times 10^{-3}$ of our qubits. We then perform multiple syndrome measurements on the encoded qubit, using a real-time decoder to determine any necessary corrections that are done either as software updates to the Pauli frame or as physically applied gates. Moreover, these procedures are done repeatedly while maintaining coherence, demonstrating a dynamically protected logical qubit memory. Additionally, we demonstrate non-Clifford qubit operations by encoding a logical magic state with an error rate below the threshold required for magic state distillation. Finally, we present system-level simulations that allow us to identify key hardware upgrades that may enable the system to reach the pseudo-threshold.

arXiv:2107.07505•Physical Review X•Dec 23, 2021•375 citations

New methods in quantum error correction and fault-tolerant quantum computing

Christopher Chamberland

Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.

•Oct 22, 2018•0 citations

Fault-Tolerant Quantum Computation Using Large Spin-Cat Codes

Sivaprasad Omanakuttan, Vikas Buchemmavari, Jonathan A. Gross +2 more

We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code, analogous to the continuous-variable cat encoding. With this, we can correct the dominant error sources, namely processes that can be expressed as error operators that are linear or quadratic in the components of angular momentum. Such codes tailored to dominant error sources can exhibit superior thresholds and lower resource overheads when compared to those designed for unstructured noise models. A key component is the gate that preserves the rank of spherical tensor operators. Categorizing the dominant errors as phase and amplitude errors, we demonstrate how phase errors, analogous to phase-flip errors for qubits, can be effectively corrected. Furthermore, we propose a measurement-free error-correction scheme to address amplitude errors without relying on syndrome measurements. Through an in-depth analysis of logical gate errors, we establish that the fault-tolerant threshold for error correction in the spin-cat encoding surpasses that of standard qubit-based encodings. We consider a specific implementation based on neutral-atom quantum computing, with qudits encoded in the nuclear spin of 87 Sr , and show how to generate the universal gate set, including the rank-preserving gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing. Published by the American Physical Society 2024

arXiv:2401.04271•PRX Quantum•Jun 7, 2024•43 citations
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.
Qudits can be described by a state vector in a qqq-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, we investigate the viability of qudits in error correction codes by creating and simulating the quantum circuitry for the smallest qudit error correction code with a multidimensional circuit-level noise model and specifically adapted decoders. After introducing a flag qudit to protect the code from hook errors, comparable error thresholds of the order of 10−410^{-4}10−4 are obtained for qudits of dimensions 222, 333 and 555.
The main focus of this thesis is to explore the advantages of using higher-dimensional quantum systems (qudits) as building blocks for fault-tolerant quantum computation. In particular, we investigate the two main essential ingredients of many state-of-the-art fault-tolerant schemes [133], which are magic state distillation and topological error correction. The theory for both of these components is well established for the qubit case, but little has been known for the generalised qudit case. For magic state distillation, we first present a general numerical approach that can be used to investigate the distillation properties of any stabilizer code. We use this approach to study small threedimensional (qutrit) codes and classify, for the first time, new types of qutrit magic states. We then provide an analytic study of a family of distillation protocols based on the quantum Reed-Muller codes. We discover a particular five-dimensional code that, by many measures, outperforms all known qubit codes. For the topological error correction, we study the qudit toric code serving as a quantum memory. For this purpose we examine an efficient renormalization group decoder to estimate the error correction threshold. We find that when the qudit toric code is subject to a generalised bit-flip noise, and for a sufficiently high dimension, a threshold of 30% can be obtained under perfect decoding.
Universal quantum computers require fault-tolerant logical qudits, as qudits naturally align with the simulation of multi-level physical systems. Here, we present a general framework and working examples for encoding fault-tolerant logical qudits in finite-dimensional spin systems. We construct distance-333, distance-555 codewords, and general 2t+12t+12t+1-distance codes that can be implemented using a single physical qudit or a small number of coupled qudits for higher distances, while requiring a Hilbert space dimension significantly smaller than conventional constructions based on multiple logical qubits. Logical operations and error correction protocols can be implemented with polynomial scaling in the number of elementary operations. We further discuss schematic designs for physical implementation and required single-gate fidelities, which are compatible with current spin qudit platforms. This strategy provides a resource-efficient path toward realizing fault-tolerant logical qudits in finite multi-level physical systems.
Correcting errors in real time is essential for reliable large-scale quantum computations. Realizing this high-level function requires a system capable of several low-level primitives, including single-qubit and two-qubit operations, mid-circuit measurements of subsets of qubits, real-time processing of measurement outcomes, and the ability to condition subsequent gate operations on those measurements. In this work, we use a ten qubit QCCD trapped-ion quantum computer to encode a single logical qubit using the [[7,1,3]][[7,1,3]][[7,1,3]] color code, first proposed by Steane~\cite{steane1996error}. The logical qubit is initialized into the eigenstates of three mutually unbiased bases using an encoding circuit, and we measure an average logical SPAM error of 1.7(6)×10−31.7(6) \times 10^{-3}1.7(6)×10−3, compared to the average physical SPAM error 2.4(8)×10−32.4(8) \times 10^{-3}2.4(8)×10−3 of our qubits. We then perform multiple syndrome measurements on the encoded qubit, using a real-time decoder to determine any necessary corrections that are done either as software updates to the Pauli frame or as physically applied gates. Moreover, these procedures are done repeatedly while maintaining coherence, demonstrating a dynamically protected logical qubit memory. Additionally, we demonstrate non-Clifford qubit operations by encoding a logical magic state with an error rate below the threshold required for magic state distillation. Finally, we present system-level simulations that allow us to identify key hardware upgrades that may enable the system to reach the pseudo-threshold.
Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.
We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code, analogous to the continuous-variable cat encoding. With this, we can correct the dominant error sources, namely processes that can be expressed as error operators that are linear or quadratic in the components of angular momentum. Such codes tailored to dominant error sources can exhibit superior thresholds and lower resource overheads when compared to those designed for unstructured noise models. A key component is the gate that preserves the rank of spherical tensor operators. Categorizing the dominant errors as phase and amplitude errors, we demonstrate how phase errors, analogous to phase-flip errors for qubits, can be effectively corrected. Furthermore, we propose a measurement-free error-correction scheme to address amplitude errors without relying on syndrome measurements. Through an in-depth analysis of logical gate errors, we establish that the fault-tolerant threshold for error correction in the spin-cat encoding surpasses that of standard qubit-based encodings. We consider a specific implementation based on neutral-atom quantum computing, with qudits encoded in the nuclear spin of 87 Sr , and show how to generate the universal gate set, including the rank-preserving gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing. Published by the American Physical Society 2024