Mapping the error syndromes to error operators is the core of quantum decoding network and the key step to realize quantum error correction. The definitions of the bit flip error syndrome matrix and the phase flip error syndrome matrix are presented, and then the error syndromes of Pauli errors are expressed in terms of the columns of the bit flip error syndrome matrix and the phase flip error syndrome matrix. It is also shown that the error syndrome matrix of a stabilizer code is determined by its check matrix, which is similar to the relationship between the classical error and the parity check matrix of classical codes. So, the techniques of error detection and error correction for classical linear codes can be applied to quantum stabilizer codes after some modifications. The error correction circuits are constructed based on the relationship between the error operator and error syndrom. The decoding circuit is constructed by reversing the encoding circuit because the encoding operators are unitary.
In this paper, we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the decoding problem consists of determining the most likely recovery given the syndrome. The corresponding classical problem is known to be NP-complete, and are appropriate a similar decoding problem for quantum codes is also known to be NP-complete. However, this decoding strategy is not optimal in the quantum setting as it does not consider error degeneracy, which causes distinct errors to have the same effect on the code. Here, we show that optimal decoding of stabilizer codes (previously known to be NP-hard) is in fact computationally much harder than optimal decoding of classical linear codes, it is #P-complete.
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.
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities. Using this result---which applies to degenerate as well as nondegenerate codes---previously established necessary conditions for classical linear codes can be easily translated into necessary conditions for quantum stabilizer codes. Examples of specific consequences are as follows: for a quantum channel subject to a \ensuremath{\delta} fraction of errors, the best asymptotic capacity attainable by any stabilizer code cannot exceed H(+$\sqrt{2\ensuremath{\delta}(1\ensuremath{-}2\ensuremath{\delta})}$); and, for the depolarizing channel with fidelity parameter \ensuremath{\delta}, the best asymptotic capacity attainable by any stabilizer code cannot exceed 1-H(\ensuremath{\delta}).
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.
Rényi coherent information, a computable proxy for the von Neumann coherent information, is widely used to study mixed-state phases of matter and decodability transitions in noisy quantum error-correcting codes. However, being a difference of two Rényi entropies, it need not be monotonic in the Rényi index, and lacks the operational meaning of its von Neumann counterpart. Here we address both issues for stabilizer codes. First, for Pauli noise generated by independent Bernoulli events, we prove that the Rényi-
n coherent information is nondecreasing in
n∈Z+. This follows from a general theorem: if independent random bits are mapped linearly to a fine label
T and a coarse label
C, then the Rényi entropy difference
Hn(C)−Hn(T) is nondecreasing in
n. For stabilizer codes,
T is the joint syndrome--logical class and
C is the syndrome, and the difference is the Rényi-
n coherent information up to a constant. The same theorem covers classical linear codes and independent detector error models. Second, for arbitrary stochastic Pauli noise, we give the Rényi-
n coherent information an operational meaning via postselection on matching syndromes between one data block and
n−1 auxiliary blocks. We determine when this defines a quantum channel and show that saturation of the Rényi-
n coherent information is equivalent to asymptotically perfect recovery of the postselected channel. Moreover, the Rényi-
n coherent information also upper-bounds the ordinary coherent information achievable after any syndrome-conditioned recovery.