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

Physical Review A

Quantum error correction architecture for qudit stabilizer codes

Priya J. Nadkarni, Shayan Srinivasa Garani

Published Apr 22, 2021• 23 citations
Publisher

Abstract

Quantum communication channels benefit from nonbinary entanglement-assisted stabilizer codes using preshared entangled states for achieving better error correction capability compared to those that do not use preshared entanglement, making them indispensable for realizing large-scale quantum computing and communication systems over qudits. We provide a previously unreported design architecture of the syndrome computation unit for qudit stabilizer codes based on classical additive codes using discrete Fourier transform gates, $\mathrm{ADD}$ gates, and multiplication gates. The proposed syndrome computation circuit architectures are necessary toward the implementable realization of such entanglement-assisted and -unassisted qudit stabilizer codes within the quantum transceiver system. We further provide an equivalent design architecture of the syndrome computation unit that decomposes into two syndrome computation units based on X errors and Z errors separately for entanglement-assisted and -unassisted qudit CSS codes. The proposed quantum error correction architectures are useful for building high-density coded quantum memories for archival quantum storage.

DOI
10.1103/physreva.103.042420

Related papers

Encoding of Nonbinary Entanglement-Unassisted and Assisted Stabilizer Codes

Priya J. Nadkarni, Shayan Srinivasa Garani

Quantum coding schemes over qudits using preshared entanglement between the encoder and decoder can provide better error correction capability than without it. In this article, we develop procedures for constructing encoding operators for entanglement-unassisted and entanglement-assisted qudit stabilizer codes over Fpk, with p prime and k ≥ 1 from first principles, generalizing prior works on qubit-based codes and codes that work over Fp. We also provide quantum encoding architectures based on the proposed encoding procedures using one and two qudit gates, useful toward realizing coded quantum computing and communication systems using qudits.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•16 citations

Quantum error correction and fault-tolerant quantum computation

Todd A. Brun, Ching–Yi Lai

Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.

•Jan 1, 2013•0 citations

A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices

Ching–Yi Lai, Chung-Chin Lu

In this paper, a new but simple construction of stabilizer codes and related entanglement-assisted quantum error-correcting codes is proposed based on syndrome assignment by classical parity-check matrices. This method turns the construction of quantum stabilizer codes to the construction of classical parity-check matrices satisfying a specific commutative condition. The designed minimum distance 2t*+1 of the constructed quantum stabilizer codes can be achieved by a commutative classical parity-check matrix with classical minimum distance 4t*-m, where the parameterm, 0 ≤m≤ 2t*, depends on a property of the parity-check matrix. Asmdecreases, there is an increasing set of additional correctable error operators beyond the designed error correcting capability t*. The (asymptotic) coding efficiency is at least comparable to that of CSS codes. A class of quantum Reed-Muller codes is constructed and codes in this class have a larger set of correctable error operators than that of the quantum Reed-Muller codes previously developed in the literature. Quantum circulant codes are also constructed and many of them are optimal in terms of their coding parameters.

arXiv:0712.0103•IEEE Transactions on Information Theory•Oct 1, 2011•14 citations

Fault-Tolerant Qudit Gate Optimization in Solid-State Quantum Memory

William Boone Samuels

Achieving scalable, fault-tolerant quantum computation requires quantum memory architectures that minimize error correction overhead while preserving coherence. This work presents a framework for high-dimensional qudit memory in 153Eu:Y2SiO5, integrating three core mechanisms: (i) non-destructive syndrome extraction, using spin-echo sequences to encode error syndromes without direct measurement; (ii) adaptive quantum Fourier transform (QFT) for error identification, leveraging frequency-space transformations to reduce gate complexity; and (iii) coset-based fault-tolerant correction, factorizing large stabilizer-like unitaries into modular operations to confine error propagation. By combining generalized stabilizer formalism, Weyl-Heisenberg operators, and finite-group coset decompositions, we develop a qudit error correction scheme optimized for solid-state quantum memory. This approach circumvents resource-intensive multi-qubit concatenation, enabling scalable, long-lived quantum storage with efficient state retrieval and computational redundancy. These results provide a pathway toward practical fault-tolerant architectures for rare-earth-ion-doped quantum memories.

arXiv:2503.03578•Mar 5, 2025•0 citations

Encoder Circuit Optimization for Nonbinary Quantum Error Correction Codes in Prime Dimensions: An Algorithmic Framework

Aditya Sodhani, Keshab K. Parhi

Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis$|0\rangle$and$|1\rangle$states—recent advances have demonstrated the practical implementation of higher-dimensional quantum systems (qudits) across various hardware platforms. In these hardware realizations, the higher-order states are less stable and thus remain coherent for a shorter duration than the basis$|0\rangle$and$|1\rangle$states. Moreover, formal methods for designing efficient encoder circuits for these systems remain underexplored. This limitation motivates the development of efficient circuit techniques for qudit systems (d-level quantum systems). Previous works have typically established generating gate sets for higher-dimensional codes by generalizing the methods used for qubits. In this work, we introduce a systematic framework for optimizing encoder circuits for prime-dimension stabilizer codes. This framework is based on novel generating gate sets whose elements map directly to efficient Clifford gate sequences. We demonstrate the effectiveness of this method on key codes, achieving a 13–44% reduction in encoder circuit gate count for the qutrit (d = 3)$[[9,5,3]]_{3}$,$[[5,1,3]]_{3}$, and$[[7,1,3]]_{3}$codes, and a 9–21% reduction for the ququint (d = 5)$[[10,6,3]]_{5}$code when compared to prior work. We also achieved circuit depth reductions up to 42%.

arXiv:2509.25587•IEEE Transactions on Quantum Engineering•Jan 1, 2026•1 citation

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
Quantum communication channels benefit from nonbinary entanglement-assisted stabilizer codes using preshared entangled states for achieving better error correction capability compared to those that do not use preshared entanglement, making them indispensable for realizing large-scale quantum computing and communication systems over qudits. We provide a previously unreported design architecture of the syndrome computation unit for qudit stabilizer codes based on classical additive codes using discrete Fourier transform gates, ADD\mathrm{ADD}ADD gates, and multiplication gates. The proposed syndrome computation circuit architectures are necessary toward the implementable realization of such entanglement-assisted and -unassisted qudit stabilizer codes within the quantum transceiver system. We further provide an equivalent design architecture of the syndrome computation unit that decomposes into two syndrome computation units based on X errors and Z errors separately for entanglement-assisted and -unassisted qudit CSS codes. The proposed quantum error correction architectures are useful for building high-density coded quantum memories for archival quantum storage.
Quantum coding schemes over qudits using preshared entanglement between the encoder and decoder can provide better error correction capability than without it. In this article, we develop procedures for constructing encoding operators for entanglement-unassisted and entanglement-assisted qudit stabilizer codes over Fpk, with p prime and k ≥ 1 from first principles, generalizing prior works on qubit-based codes and codes that work over Fp. We also provide quantum encoding architectures based on the proposed encoding procedures using one and two qudit gates, useful toward realizing coded quantum computing and communication systems using qudits.
Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.
In this paper, a new but simple construction of stabilizer codes and related entanglement-assisted quantum error-correcting codes is proposed based on syndrome assignment by classical parity-check matrices. This method turns the construction of quantum stabilizer codes to the construction of classical parity-check matrices satisfying a specific commutative condition. The designed minimum distance 2t*+1 of the constructed quantum stabilizer codes can be achieved by a commutative classical parity-check matrix with classical minimum distance 4t*-m, where the parameterm, 0 ≤m≤ 2t*, depends on a property of the parity-check matrix. Asmdecreases, there is an increasing set of additional correctable error operators beyond the designed error correcting capability t*. The (asymptotic) coding efficiency is at least comparable to that of CSS codes. A class of quantum Reed-Muller codes is constructed and codes in this class have a larger set of correctable error operators than that of the quantum Reed-Muller codes previously developed in the literature. Quantum circulant codes are also constructed and many of them are optimal in terms of their coding parameters.
Achieving scalable, fault-tolerant quantum computation requires quantum memory architectures that minimize error correction overhead while preserving coherence. This work presents a framework for high-dimensional qudit memory in 153Eu:Y2SiO5, integrating three core mechanisms: (i) non-destructive syndrome extraction, using spin-echo sequences to encode error syndromes without direct measurement; (ii) adaptive quantum Fourier transform (QFT) for error identification, leveraging frequency-space transformations to reduce gate complexity; and (iii) coset-based fault-tolerant correction, factorizing large stabilizer-like unitaries into modular operations to confine error propagation. By combining generalized stabilizer formalism, Weyl-Heisenberg operators, and finite-group coset decompositions, we develop a qudit error correction scheme optimized for solid-state quantum memory. This approach circumvents resource-intensive multi-qubit concatenation, enabling scalable, long-lived quantum storage with efficient state retrieval and computational redundancy. These results provide a pathway toward practical fault-tolerant architectures for rare-earth-ion-doped quantum memories.
Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis∣0⟩|0\rangle∣0⟩and∣1⟩|1\rangle∣1⟩states—recent advances have demonstrated the practical implementation of higher-dimensional quantum systems (qudits) across various hardware platforms. In these hardware realizations, the higher-order states are less stable and thus remain coherent for a shorter duration than the basis∣0⟩|0\rangle∣0⟩and∣1⟩|1\rangle∣1⟩states. Moreover, formal methods for designing efficient encoder circuits for these systems remain underexplored. This limitation motivates the development of efficient circuit techniques for qudit systems (d-level quantum systems). Previous works have typically established generating gate sets for higher-dimensional codes by generalizing the methods used for qubits. In this work, we introduce a systematic framework for optimizing encoder circuits for prime-dimension stabilizer codes. This framework is based on novel generating gate sets whose elements map directly to efficient Clifford gate sequences. We demonstrate the effectiveness of this method on key codes, achieving a 13–44% reduction in encoder circuit gate count for the qutrit (d = 3)[[9,5,3]]3[[9,5,3]]_{3}[[9,5,3]]3​,[[5,1,3]]3[[5,1,3]]_{3}[[5,1,3]]3​, and[[7,1,3]]3[[7,1,3]]_{3}[[7,1,3]]3​codes, and a 9–21% reduction for the ququint (d = 5)[[10,6,3]]5[[10,6,3]]_{5}[[10,6,3]]5​code when compared to prior work. We also achieved circuit depth reductions up to 42%.
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.