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

The European Physical Journal C

New construction of quantum error-avoiding codes via group representation of quantum stabilizer codes

Hailin Xiao, Zhongshan Zhang, Anthony Theodore Chronopoulos

Published Oct 1, 2017• 5 citations
Publisher

Abstract

In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods.

DOI
10.1140/epjc/s10052-017-5246-2

Related papers

Decoherence-free subspaces for multiple-qubit errors. II. Universal, fault-tolerant quantum computation

Daniel A. Lidar, Dave Bacon, Julia Kempe +1 more

Decoherence-free subspaces (DFSs) shield quantum information from errors induced by the interaction with an uncontrollable environment. Here we study a model of correlated errors forming an Abelian subgroup (stabilizer) of the Pauli group (the group of tensor products of Pauli matrices). Unlike previous studies of DFSs, this type of error does not involve any spatial symmetry assumptions on the system-environment interaction. We solve the problem of universal, fault-tolerant quantum computation on the associated class of DFSs. We do so by introducing a hybrid DFS quantum error-correcting-code approach, where errors that arise due to departure of the codewords from the DFS are corrected actively.

arXiv:quant-ph/0007013•Physical Review A•Jan 17, 2001•62 citations

Symmetry-Based Quantum Codes Beyond the Pauli Group

Zachary P. Bradshaw, Margarite L. LaBorde, Dillon Montero

Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that allows the code designer to take this structure into account. For any representation of a finite group, we produce a quantum code with a code space invariant under the group action, providing passive error mitigation against errors belonging to the image of the representation. Furthermore, errors outside this scope are detected and diagnosed by performing a projective measurement onto the isotypic components corresponding to irreducible representations of the chosen group, effectively generalizing syndrome extraction to symmetry-resolved quantum measurements. We show that all stabilizer codes are a special case of this construction, including qudit stabilizer codes, and show that there is a natural one logical qubit code associated to the dihedral group. Thus we provide a unifying framework for existing codes while simultaneously facilitating symmetry-aware codes tailored to specific systems.

quant-pharXiv:2512.07908•Physical Review A•Dec 9, 2025•4 citations

Universal Fault Tolerant Quantum Computation on a Class of Decoherence-Free Subspaces Without Spatial Symmetry

Daniel A. Lidar, Bacon, D J, Julia Kempe +1 more

Decoherence-free subspaces (DFSs) are constructed without the assumption of spatially symmetric system-bath coupling. Instead the underlying assumption is that subgroups of the full Pauli group of errors are responsible for the decoherence. The corresponding decoherence-free states can protect quantum information in the presence of multiple-qubit errors, and are stabilizer codes. It is shown how to perform universal fault tolerant quantum computation on this class of DFSs. This is the first demonstration that it is possible to use only one- and two-body quantum gates to perform full-blown quantum computation on a class of DFSs, with a finite number of measurements.

•Jan 1, 2001•1 citation

Theory of decoherence-free fault-tolerant universal quantum computation

Julia Kempe, Dave Bacon, Daniel A. Lidar +1 more

Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.

arXiv:quant-ph/0004064•Physical Review A•Mar 20, 2001•548 citations

Quantum Error Correcting Codes and Fault-Tolerant Quantum Computation over Nice Rings

Sang-Jun Lee

Quantum error correcting codes play an essential role in protecting quantum information from the noise and the decoherence. Most quantum codes have been constructed based on the Pauli basis indexed by a finite field. With a newly introduced algebraic class called a nice ring, it is possible to construct the quantum codes such that their alphabet sizes are not restricted to powers of a prime.\n\nSubsystem codes are quantum error correcting schemes unifying stabilizer codes, decoherence free subspaces and noiseless subsystems. We show a generalization of subsystem codes over nice rings. Furthermore, we prove that free subsystem codes over a finite chain ring cannot outperform those over a finite field. We also generalize entanglement-assisted quantum error correcting codes to nice rings. With the help of the entanglement, any classical code can be used to derive the corresponding quantum codes, even if such codes are not self-orthogonal. We prove that an R-module with antisymmetric bicharacter can be decomposed as an orthogonal direct sum of hyperbolic pairs using symplectic geometry over rings. So, we can find hyperbolic pairs and commuting generators generating the check matrix of the entanglement-assisted quantum code.\n\nFault-tolerant quantum computation has been also studied over a finite field. Transversal operations are the simplest way to implement fault-tolerant quantum gates. We derive transversal Clifford operations for CSS codes over nice rings, including Fourier transforms, SUM gates, and phase gates. Since transversal operations alone cannot provide a computationally universal set of gates, we add fault-tolerant implementations of doubly-controlled Z gates for triorthogonal stabilizer codes over nice rings.\n\nFinally, we investigate optimal key exchange protocols for unconditionally secure key distribution schemes. We prove how many rounds are needed for the key exchange between any pair of the group on star networks, linear-chain networks, and general networks.

•Jun 29, 2017•0 citations

Stabilizer Formalism for Operator Quantum Error Correction

David Poulin

Operator quantum error correction is a recently developed theory that provides a generalized and unified framework for active error correction and passive error avoiding schemes. In this Letter, we describe these codes using the stabilizer formalism. This is achieved by adding a gauge group to stabilizer codes that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the construction by identifying a gauge symmetry in Shor's 9-qubit code that allows us to remove 3 of its 8 stabilizer generators, leading to a simpler decoding procedure and a wider class of logical operations without affecting its essential properties. This opens the path to possible improvements of the error threshold of fault-tolerant quantum computing.

arXiv:quant-ph/0508131•Physical Review Letters•Dec 1, 2005•372 citations
In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods.
Decoherence-free subspaces (DFSs) shield quantum information from errors induced by the interaction with an uncontrollable environment. Here we study a model of correlated errors forming an Abelian subgroup (stabilizer) of the Pauli group (the group of tensor products of Pauli matrices). Unlike previous studies of DFSs, this type of error does not involve any spatial symmetry assumptions on the system-environment interaction. We solve the problem of universal, fault-tolerant quantum computation on the associated class of DFSs. We do so by introducing a hybrid DFS quantum error-correcting-code approach, where errors that arise due to departure of the codewords from the DFS are corrected actively.
Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that allows the code designer to take this structure into account. For any representation of a finite group, we produce a quantum code with a code space invariant under the group action, providing passive error mitigation against errors belonging to the image of the representation. Furthermore, errors outside this scope are detected and diagnosed by performing a projective measurement onto the isotypic components corresponding to irreducible representations of the chosen group, effectively generalizing syndrome extraction to symmetry-resolved quantum measurements. We show that all stabilizer codes are a special case of this construction, including qudit stabilizer codes, and show that there is a natural one logical qubit code associated to the dihedral group. Thus we provide a unifying framework for existing codes while simultaneously facilitating symmetry-aware codes tailored to specific systems.
Decoherence-free subspaces (DFSs) are constructed without the assumption of spatially symmetric system-bath coupling. Instead the underlying assumption is that subgroups of the full Pauli group of errors are responsible for the decoherence. The corresponding decoherence-free states can protect quantum information in the presence of multiple-qubit errors, and are stabilizer codes. It is shown how to perform universal fault tolerant quantum computation on this class of DFSs. This is the first demonstration that it is possible to use only one- and two-body quantum gates to perform full-blown quantum computation on a class of DFSs, with a finite number of measurements.
Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.
Quantum error correcting codes play an essential role in protecting quantum information from the noise and the decoherence. Most quantum codes have been constructed based on the Pauli basis indexed by a finite field. With a newly introduced algebraic class called a nice ring, it is possible to construct the quantum codes such that their alphabet sizes are not restricted to powers of a prime.\n\nSubsystem codes are quantum error correcting schemes unifying stabilizer codes, decoherence free subspaces and noiseless subsystems. We show a generalization of subsystem codes over nice rings. Furthermore, we prove that free subsystem codes over a finite chain ring cannot outperform those over a finite field. We also generalize entanglement-assisted quantum error correcting codes to nice rings. With the help of the entanglement, any classical code can be used to derive the corresponding quantum codes, even if such codes are not self-orthogonal. We prove that an R-module with antisymmetric bicharacter can be decomposed as an orthogonal direct sum of hyperbolic pairs using symplectic geometry over rings. So, we can find hyperbolic pairs and commuting generators generating the check matrix of the entanglement-assisted quantum code.\n\nFault-tolerant quantum computation has been also studied over a finite field. Transversal operations are the simplest way to implement fault-tolerant quantum gates. We derive transversal Clifford operations for CSS codes over nice rings, including Fourier transforms, SUM gates, and phase gates. Since transversal operations alone cannot provide a computationally universal set of gates, we add fault-tolerant implementations of doubly-controlled Z gates for triorthogonal stabilizer codes over nice rings.\n\nFinally, we investigate optimal key exchange protocols for unconditionally secure key distribution schemes. We prove how many rounds are needed for the key exchange between any pair of the group on star networks, linear-chain networks, and general networks.
Operator quantum error correction is a recently developed theory that provides a generalized and unified framework for active error correction and passive error avoiding schemes. In this Letter, we describe these codes using the stabilizer formalism. This is achieved by adding a gauge group to stabilizer codes that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the construction by identifying a gauge symmetry in Shor's 9-qubit code that allows us to remove 3 of its 8 stabilizer generators, leading to a simpler decoding procedure and a wider class of logical operations without affecting its essential properties. This opens the path to possible improvements of the error threshold of fault-tolerant quantum computing.