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:0712.3223 · International Journal of Quantum Information

SIMPLE FAULT-TOLERANT ENCODING OVER q-ARY CSS QUANTUM CODES

Pedro J. Salas

Published Oct 1, 2007• 0 citations
arXivHTMLPDF

Abstract

CSS codes are a subfamily of stabilizer codes especially appropriate for fault-tolerant quantum computations. A very simple method is proposed to encode a general qudit when a Calderbank–Shor–Steane quantum code, defined over a q-ary alphabet, is used.
DOI
10.1142/s0219749907003146

Related papers

Fault-tolerant preparation of stabilizer states for quantum Calderbank-Shor-Steane codes by classical error-correcting codes

Ching–Yi Lai, Yi-Cong Zheng, Todd A. Brun

Stabilizer states are extensively studied in quantum information theory for their structures based on the Pauli group. Calderbank-Shor-Steane (CSS) stabilizer states are of particular importance in their application to fault-tolerant quantum computation (FTQC). However, how to fault-tolerantly prepare arbitrary CSS stabilizer states for general CSS stabilizer codes is still unknown, and their preparation can be highly costly in computational resources. In this paper, we show how to prepare a large class of CSS stabilizer states useful for FTQC. We propose distillation protocols using syndrome encoding by classical codes or quantum CSS codes. Along the same lines, we show that classical coding techniques can reduce the ancilla consumption in Steane syndrome extraction by using additional transversal controlled-not gates and classical computing power. In the scenario of a fixed ancilla consumption rate, we can increase the frequency of quantum error correction and effectively lower the error rate.

arXiv:1605.05647•Physical Review A•Mar 31, 2017•17 citations

Entanglement-assisted fault-tolerant encoding and decoding for qudit stabilizer codes

Abhi Kumar Sharma, Shayan Srinivasa Garani

We propose fault-tolerant quantum encoders for Calderbank-Shor-Steane (CSS) and non-CSS codes over qudits by utilizing $g$-partite maximally entangled states. The qudits are grouped into $g$ contiguous blocks such that entangled states are shared across the blocks, and multiqudit gates are applied locally to restrict the error propagation within each block. We also propose a transversal fault-tolerant block decoder to decode the blocks individually and recover the complete encoded quantum information. The optimum value of $g$ to obtain an improvement in the probability of error propagation of the proposed encoders against non-fault-tolerant schemes is analytically determined for application in the encoding circuit. The proposed fault-tolerant scheme with entanglement assistance scales linearly with the number of $g$-partite entangled states and overcomes the limitations of diminishing coding rates for higher levels of concatenation within the concatenated coding scheme. We validate the proposed ideas by constructing fault-tolerant encoding circuits for the non-CSS ${[[5,1,3]]}_{3}$ code and the ${[[7,1,3]]}_{3}$ CSS code through illustrative examples. We reduced the probability of error propagation from 0.248 to 0.212 for the ${[[5,1,3]]}_{3}$ code and from 0.207 to 0.174 for the ${[[7,1,3]]}_{3}$ code. For example, over ${[[100,70]]}_{2}$ quantum code without any fault tolerance, using three-partite entangled pairs, one can get two orders of improvement (1e-2) in the probability of error propagation compared to the non-fault-tolerant encoder by encoding over 190 physical qubits with the same number of stabilizers.

Physical Review A•Dec 31, 2024•2 citations

Implementation of Fault-Tolerant Encoding Circuit Based on Stabilizer Implementation and “Flag” Bits in Steane Code

Dongxiao Quan, Chensong Liu, Xiaojie Lv +1 more

Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.

Entropy•Aug 11, 2022•8 citations

SpiderCSS: Scalable Fault-Tolerant CSS State Preparation

Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li +3 more

Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalable compilation pipeline that generates highly-optimized, fault-tolerant state preparation circuits for arbitrary Calderbank-Shor-Steane (CSS) codes. Starting from an idealized specification of a CSS state, we use the ZX-calculus and fault-equivalent rewrites to construct a diagram that prepares the given state while preserving the fault tolerance of the initial ideal ZX-diagram. From this diagram, SpiderCSS constructs a fault-tolerant CSS-state preparation circuit using a modular construction that is CNOT-minimal both within each component and also in the way these components are connected together. By only using fault-equivalent rewrites, the final circuit is provably fault-tolerant without needing expensive verification. Monte Carlo simulations across a variety of CSS codes up to distance 15 show that SpiderCSS scales efficiently and constructs circuits with substantially reduced depth and qubit footprint compared to existing scalable and heuristic methods, while simultaneously achieving an average decrease of 33.7% in logical error rate and an increase of 9.5% in acceptance rate.

quant-pharXiv:2610.03714•Oct 5, 2026•0 citations

Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly

K. Sai Mineesh Reddy, Navin Kashyap

This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal $Z$-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize the logical transversal Clifford group (i.e., transversal single-qubit Clifford gates are realized within a single code block, while transversal two-qubit Clifford gates are realized across two identical code blocks). Furthermore, investigating CSS-T codes, we: (a) demonstrate asymptotically good CSS-T codes wherein the transversal $T$ realizes the logical transversal $S^{\dagger}$; (b) show that the condition $C_2 \ast C_1 \subseteq C_1^{\perp}$ is necessary but not sufficient for CSS-T codes; and (c) revise the characterizations of CSS-T codes wherein the transversal $T$ implements the logical identity and the logical transversal $T$, respectively.

quant-pharXiv:2601.08568•IEEE International Symposium on Information Theory (ISIT)•Jan 14, 2026•5 citations

Nearly-optimal CSS code subspace verification with local measurement

Yingying Hu, Congcong Zheng, Xutao Yu +1 more

Abstract Quantum error correction (QEC) is the core mechanism enabling scalable and fault-tolerant quantum computation. Among various QEC schemes, Calderbank–Shor–Steane (CSS) codes play a central role. Efficiently verifying whether a quantum state remains within the target CSS code subspace is therefore essential both for understanding the theoretical performance of these codes and for assessing the error-correcting capability of practical quantum platforms. In this work, we develop an efficient framework for verifying whether a quantum system remains within the encoded subspace of a CSS code. We first show that the stabilizer structure of any CSS code can be mapped to a two-colorable graph, enabling the design of a hybrid verification strategy based solely on local Pauli measurements. We further analytically optimize the measurement probabilities and derive the resulting sample complexities for representative CSS codes. Specifically, for the Toric code, the efficiency of our hybrid strategy increases with lattice size and asymptotically approaches near-optimal performance. These results establish a unified and scalable approach to CSS code subspace verification, providing a foundation for certifiable and fault-tolerant quantum information processing.

Quantum Science and Technology•Feb 10, 2026•0 citations
Stabilizer states are extensively studied in quantum information theory for their structures based on the Pauli group. Calderbank-Shor-Steane (CSS) stabilizer states are of particular importance in their application to fault-tolerant quantum computation (FTQC). However, how to fault-tolerantly prepare arbitrary CSS stabilizer states for general CSS stabilizer codes is still unknown, and their preparation can be highly costly in computational resources. In this paper, we show how to prepare a large class of CSS stabilizer states useful for FTQC. We propose distillation protocols using syndrome encoding by classical codes or quantum CSS codes. Along the same lines, we show that classical coding techniques can reduce the ancilla consumption in Steane syndrome extraction by using additional transversal controlled-not gates and classical computing power. In the scenario of a fixed ancilla consumption rate, we can increase the frequency of quantum error correction and effectively lower the error rate.
We propose fault-tolerant quantum encoders for Calderbank-Shor-Steane (CSS) and non-CSS codes over qudits by utilizing ggg-partite maximally entangled states. The qudits are grouped into ggg contiguous blocks such that entangled states are shared across the blocks, and multiqudit gates are applied locally to restrict the error propagation within each block. We also propose a transversal fault-tolerant block decoder to decode the blocks individually and recover the complete encoded quantum information. The optimum value of ggg to obtain an improvement in the probability of error propagation of the proposed encoders against non-fault-tolerant schemes is analytically determined for application in the encoding circuit. The proposed fault-tolerant scheme with entanglement assistance scales linearly with the number of ggg-partite entangled states and overcomes the limitations of diminishing coding rates for higher levels of concatenation within the concatenated coding scheme. We validate the proposed ideas by constructing fault-tolerant encoding circuits for the non-CSS [[5,1,3]]3{[[5,1,3]]}_{3}[[5,1,3]]3​ code and the [[7,1,3]]3{[[7,1,3]]}_{3}[[7,1,3]]3​ CSS code through illustrative examples. We reduced the probability of error propagation from 0.248 to 0.212 for the [[5,1,3]]3{[[5,1,3]]}_{3}[[5,1,3]]3​ code and from 0.207 to 0.174 for the [[7,1,3]]3{[[7,1,3]]}_{3}[[7,1,3]]3​ code. For example, over [[100,70]]2{[[100,70]]}_{2}[[100,70]]2​ quantum code without any fault tolerance, using three-partite entangled pairs, one can get two orders of improvement (1e-2) in the probability of error propagation compared to the non-fault-tolerant encoder by encoding over 190 physical qubits with the same number of stabilizers.
Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.
Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalable compilation pipeline that generates highly-optimized, fault-tolerant state preparation circuits for arbitrary Calderbank-Shor-Steane (CSS) codes. Starting from an idealized specification of a CSS state, we use the ZX-calculus and fault-equivalent rewrites to construct a diagram that prepares the given state while preserving the fault tolerance of the initial ideal ZX-diagram. From this diagram, SpiderCSS constructs a fault-tolerant CSS-state preparation circuit using a modular construction that is CNOT-minimal both within each component and also in the way these components are connected together. By only using fault-equivalent rewrites, the final circuit is provably fault-tolerant without needing expensive verification. Monte Carlo simulations across a variety of CSS codes up to distance 15 show that SpiderCSS scales efficiently and constructs circuits with substantially reduced depth and qubit footprint compared to existing scalable and heuristic methods, while simultaneously achieving an average decrease of 33.7% in logical error rate and an increase of 9.5% in acceptance rate.
This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal ZZZ-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize the logical transversal Clifford group (i.e., transversal single-qubit Clifford gates are realized within a single code block, while transversal two-qubit Clifford gates are realized across two identical code blocks). Furthermore, investigating CSS-T codes, we: (a) demonstrate asymptotically good CSS-T codes wherein the transversal TTT realizes the logical transversal S†S^{\dagger}S†; (b) show that the condition C2∗C1⊆C1⊥C_2 \ast C_1 \subseteq C_1^{\perp}C2​∗C1​⊆C1⊥​ is necessary but not sufficient for CSS-T codes; and (c) revise the characterizations of CSS-T codes wherein the transversal TTT implements the logical identity and the logical transversal TTT, respectively.
Abstract Quantum error correction (QEC) is the core mechanism enabling scalable and fault-tolerant quantum computation. Among various QEC schemes, Calderbank–Shor–Steane (CSS) codes play a central role. Efficiently verifying whether a quantum state remains within the target CSS code subspace is therefore essential both for understanding the theoretical performance of these codes and for assessing the error-correcting capability of practical quantum platforms. In this work, we develop an efficient framework for verifying whether a quantum system remains within the encoded subspace of a CSS code. We first show that the stabilizer structure of any CSS code can be mapped to a two-colorable graph, enabling the design of a hybrid verification strategy based solely on local Pauli measurements. We further analytically optimize the measurement probabilities and derive the resulting sample complexities for representative CSS codes. Specifically, for the Toric code, the efficiency of our hybrid strategy increases with lattice size and asymptotically approaches near-optimal performance. These results establish a unified and scalable approach to CSS code subspace verification, providing a foundation for certifiable and fault-tolerant quantum information processing.