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:1208.4907

On the Fourier Transform Approach to Quantum Error Control

Hari Dilip Kumar

Published Aug 24, 2012• 0 citations
arXivHTMLPDF

Abstract

Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from stabilizer codes, and Clifford codes. These are analyzed in a framework using the Fourier transform on finite groups, the finite group in question being a subgroup of the quantum error group considered. All the classes of codes that can be obtained in this framework are explored, including codes more general than Clifford codes. The error detection properties of one of these more general classes ("direct sums of translates of Clifford codes") are characterized. Examples codes are constructed, and computer code search results presented and analysed.

DOI
10.48550/arxiv.1208.4907

Related papers

The Fourier Transform Approach to Quantum Coding

Hari Dilip Kumar, Balaji Sundar Rajan

Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from stabilizer codes, and Clifford codes. We analyze these in the framework of the Fourier inversion formula on a group algebra, the group in question being a subgroup of the error group considered. We study other possible code spaces that may be obtained via such an approach, obtaining codes that are the direct sums of translates of Clifford codes, and more general codes obtained from idempotents in the transform domain. We derive necessary and sufficient conditions for error detection by direct sums of translates of Clifford codes, and provide an example using an error group with non-Abelian index group.

arXiv:1208.4911•Aug 24, 2012•0 citations

Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory

Jonas Eidesen, David W. Kribs, Andrew Nemec

Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.

quant-pharXiv:2606.02531•Journal of Physics A Mathematical and Theoretical•Jun 2, 2026•0 citations

Clifford codes

Andreas Klappenecker, Martin Rötteler

Abstract Quantum error control codes allow to detect and correct errors that are due to decoherence effects. We review some basic properties of these codes and give some constructions. Our main focus will be on a construction of quantum error control codes that have been introduced by Knill in 1996 with the intention to generalize stabilizer codes. These so-called Clifford codes can be constructed and analyzed with tools from representation theory of finite groups. We show that a large class of Clifford codes are actually stabilizer codes. And we construct the smallest example of a Clifford code that is not a stabilizer code.

Chapman & Hall/CRC eBooks•Feb 14, 2002•15 citations

Quantum error correcting codes: From stabilizer codes to induced codes

Edward A. Loeb

The first large class of quantum error-correcting codes that was constructed is the class of stabilizer codes. The construction method used for these codes is based on finding abelian subgroups of general Pauli groups. Stabilizer codes are a special case of a more general class of quantum error-correcting codes---Clifford codes. The construction technique for Clifford codes generalizes the stabilizer code construction by introducing abstract error groups. Abstract error groups generalize the Pauli groups so that codes can be constructed for quantum systems with any dimension. Clifford codes are thus constructed by finding normal subgroups of abstract error groups. In this dissertation we show that Clifford codes are a special case of a larger class of codes, which we refer to as induced codes. In addition to this new construction method, we also present some new results pertaining to a subclass of stabilizer codes called degenerate stabilizer codes.

•Jan 1, 2006•0 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

Codeword Stabilized Quantum Codes and Their Error Correction

Yunfan Li

Quantum decoherence and errors represent some of the major challenges arising in quantum computations. Quantum error correcting codes protect quantum states against these errors and make quantum computing more reliable. One of the main problems of quantum error correction is the design of feasible decoding algorithms that can simplify error-correction for general quantum codes. The dissertation addresses decoding of general Codeword Stabilized (CWS) codes. This class of quantum codes also includes some other important classes such as additive Stabilizer codes and non-additive Union Stabilizer (USt) codes.We first design a generic error-correcting algorithm for CWS codes and analyze the number of decoding measurements and quantum gates. This algorithm performs exhaustive screening of different error patterns, similar to decoding of classical non-linear codes. For an n-qubit quantum code correcting up to t erroneous qubits, this brute-force approach consecutively tests all correctable error patterns and employs a separate n-qubit measurement in each test.The main result is a new error grouping technique that enables simultaneous testing of large groups of errors in a single measurement. To achieve this reduction, we first proceed with a new error-correction algorithm for the USt codes. Secondly, we design an algorithm that converts generic non-linear CWS codes into the simpler quasi-linear USt codes. Each decoding measurement can then either locate the actual error in a given group of errors or entirely eliminate this group. This technique yields a much simpler algorithm that exponentially reduces the number of measurements about 3^t times in any t-error-correcting CWS code.

•Jan 1, 2010•0 citations
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from stabilizer codes, and Clifford codes. These are analyzed in a framework using the Fourier transform on finite groups, the finite group in question being a subgroup of the quantum error group considered. All the classes of codes that can be obtained in this framework are explored, including codes more general than Clifford codes. The error detection properties of one of these more general classes ("direct sums of translates of Clifford codes") are characterized. Examples codes are constructed, and computer code search results presented and analysed.
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from stabilizer codes, and Clifford codes. We analyze these in the framework of the Fourier inversion formula on a group algebra, the group in question being a subgroup of the error group considered. We study other possible code spaces that may be obtained via such an approach, obtaining codes that are the direct sums of translates of Clifford codes, and more general codes obtained from idempotents in the transform domain. We derive necessary and sufficient conditions for error detection by direct sums of translates of Clifford codes, and provide an example using an error group with non-Abelian index group.
Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.
Abstract Quantum error control codes allow to detect and correct errors that are due to decoherence effects. We review some basic properties of these codes and give some constructions. Our main focus will be on a construction of quantum error control codes that have been introduced by Knill in 1996 with the intention to generalize stabilizer codes. These so-called Clifford codes can be constructed and analyzed with tools from representation theory of finite groups. We show that a large class of Clifford codes are actually stabilizer codes. And we construct the smallest example of a Clifford code that is not a stabilizer code.
The first large class of quantum error-correcting codes that was constructed is the class of stabilizer codes. The construction method used for these codes is based on finding abelian subgroups of general Pauli groups. Stabilizer codes are a special case of a more general class of quantum error-correcting codes---Clifford codes. The construction technique for Clifford codes generalizes the stabilizer code construction by introducing abstract error groups. Abstract error groups generalize the Pauli groups so that codes can be constructed for quantum systems with any dimension. Clifford codes are thus constructed by finding normal subgroups of abstract error groups. In this dissertation we show that Clifford codes are a special case of a larger class of codes, which we refer to as induced codes. In addition to this new construction method, we also present some new results pertaining to a subclass of stabilizer codes called degenerate stabilizer codes.
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.
Quantum decoherence and errors represent some of the major challenges arising in quantum computations. Quantum error correcting codes protect quantum states against these errors and make quantum computing more reliable. One of the main problems of quantum error correction is the design of feasible decoding algorithms that can simplify error-correction for general quantum codes. The dissertation addresses decoding of general Codeword Stabilized (CWS) codes. This class of quantum codes also includes some other important classes such as additive Stabilizer codes and non-additive Union Stabilizer (USt) codes.We first design a generic error-correcting algorithm for CWS codes and analyze the number of decoding measurements and quantum gates. This algorithm performs exhaustive screening of different error patterns, similar to decoding of classical non-linear codes. For an n-qubit quantum code correcting up to t erroneous qubits, this brute-force approach consecutively tests all correctable error patterns and employs a separate n-qubit measurement in each test.The main result is a new error grouping technique that enables simultaneous testing of large groups of errors in a single measurement. To achieve this reduction, we first proceed with a new error-correction algorithm for the USt codes. Secondly, we design an algorithm that converts generic non-linear CWS codes into the simpler quasi-linear USt codes. Each decoding measurement can then either locate the actual error in a given group of errors or entirely eliminate this group. This technique yields a much simpler algorithm that exponentially reduces the number of measurements about 3^t times in any t-error-correcting CWS code.