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:2501.04888 · Physical Review A

Beyond integral-domain stabilizer codes

Lane G. Gunderman

Published Nov 21, 2025• 3 citations
arXivHTMLPDF

Abstract

Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems; however, largely the case of a composite number of levels in the system has been avoided. This relative absence is due to the underlying ring theoretic tools required for analyzing such systems. Here we explore composite local-dimension quantum stabilizer codes, providing a pair of constructions for transforming known stabilizer codes into valid ones for composite local dimensions. In addition, remarks on logical encodings and the counts possible are discussed. This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems and expanding the understanding of the symplectic spaces involved.

DOI
10.1103/4y6f-xx6s

Related papers

Local-dimension-invariant qudit stabilizer codes

Lane G. Gunderman

Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.

arXiv:1910.08122•Physical Review A•May 28, 2020•14 citations

Stabilizer Codes with Exotic Local-dimensions

Lane G. Gunderman

Traditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other cases. In particular, we show that any traditional stabilizer code can be used for analog continuous-variable codes, and consider restrictions in phase space and discretized phase space. This puts this framework on an equivalent footing as traditional stabilizer codes. Following this, using extensions of prior ideas, we show that a stabilizer code originally designed with a finite field local-dimension can be transformed into a code with the same n , k , and d parameters for any integral domain. This is of theoretical interest and can be of use for systems whose local-dimension is better described by mathematical rings, which permits the use of traditional stabilizer codes for protecting their information as well.

arXiv:2303.17000•Quantum•Feb 12, 2024•4 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

arXiv:quant-ph/9705052•May 28, 1997•2,856 citations

Stabilizer codes : encoding schemes and applications

Shiyu Shi

Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.

•Jan 1, 2016•0 citations

Mixed-register Stabilizer Codes: A Coding-theoretic Perspective

Himanshu Dongre, Lane G. Gunderman

Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure of realistic quantum hardware, but also has some possibly enticing foundational strengths. While work in the past has largely focused on protecting information in quantum devices with locations that are some consistent local structure, this work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures -- these are mixed-register quantum devices. In this work we provide some general results for mixed-register Pauli operators, then identify some stabilizer encoded information forms that are forbidden. Building on these insights, we construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions. The construction of such codes results in codes with logical subspaces that do not directly correspond to any of the constituent local-dimensions.

quant-pharXiv:2603.28459•Mar 31, 2026•0 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
Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems; however, largely the case of a composite number of levels in the system has been avoided. This relative absence is due to the underlying ring theoretic tools required for analyzing such systems. Here we explore composite local-dimension quantum stabilizer codes, providing a pair of constructions for transforming known stabilizer codes into valid ones for composite local dimensions. In addition, remarks on logical encodings and the counts possible are discussed. This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems and expanding the understanding of the symplectic spaces involved.
Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.
Traditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other cases. In particular, we show that any traditional stabilizer code can be used for analog continuous-variable codes, and consider restrictions in phase space and discretized phase space. This puts this framework on an equivalent footing as traditional stabilizer codes. Following this, using extensions of prior ideas, we show that a stabilizer code originally designed with a finite field local-dimension can be transformed into a code with the same n , k , and d parameters for any integral domain. This is of theoretical interest and can be of use for systems whose local-dimension is better described by mathematical rings, which permits the use of traditional stabilizer codes for protecting their information as well.
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.
Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.
Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure of realistic quantum hardware, but also has some possibly enticing foundational strengths. While work in the past has largely focused on protecting information in quantum devices with locations that are some consistent local structure, this work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures -- these are mixed-register quantum devices. In this work we provide some general results for mixed-register Pauli operators, then identify some stabilizer encoded information forms that are forbidden. Building on these insights, we construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions. The construction of such codes results in codes with logical subspaces that do not directly correspond to any of the constituent local-dimensions.
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.