A generalization of the stabilizer code construction presented by Gottesman is described, which allows for the construction of quantum error-correcting codes for continuous-variable systems. This formalism describes all continuous-variable codes presented to date, and can be used to construct new codes based on discrete-variable codes or classical codes. We use it to describe the nine-mode code given by Lloyd and Slotine, and a five-mode code described by Braunstein. In addition, we construct a new continuous-variable code based an code of Gottesman which encodes three logical modes of information into eight physical modes and corrects one error. This generalization is a step toward an independent understanding of continuous-variable quantum information and a theory of fault-tolerant quantum information processing.
A generalization of the stabilizer code construction presented by Gottesman is described, which allows for the construction of quantum error-correcting codes for continuous-variable systems. This formalism describes all continuous-variable codes presented to date, and can be used to construct new codes based on discrete-variable codes or classical codes. We use it to describe the nine-mode code given by Lloyd and Slotine, and a five-mode code described by Braunstein. In addition, we construct a new continuous-variable code based an code of Gottesman which encodes three logical modes of information into eight physical modes and corrects one error. This generalization is a step toward an independent understanding of continuous-variable quantum information and a theory of fault-tolerant quantum information processing.
On the physical level, digital computers are not error free. However, by adding the redundancy and using the error-correction technique, the errors on the computational level can be mitigated to the point that the probability of error occurring is negligible for most tasks. In quantum computation, a similar strategy can be employed. Here, a main difference between classical computer and quantum computer is that the quantum error correction needs to mitigate the errors, while maintaining the quantum coherence. In this chapter, we will first discuss the conceptual ideas of how to implement quantum error correction and achieve fault tolerance in the continuous-variable system. In the case of the continuous-variable system, we need to first encode the information using a logical qubit which, in a sense, digitize the broad Hilbert space. We will give some examples of the logical qubits and then discuss a particular type of encoding called Gottesman-Kitaev-Preskill (GKP) qubit, which is one of the currently most promising encoding.
Classical information technologies employ binary encodings in which data are represented as sequences of bits taking values of “0” or “1.” In this chapter, the authors describe how the procedure can be generalized to create [[n, k, d]] stabilizer codes, where n is the total number of qubits, k is the number of logical qubits, and d is the code distance. They outline a construction known as the surface code. We must also understand how to perform operations on a state encoded in a quantum code without losing the code's protection against errors, and how to safely perform error correction when the gates used are themselves noisy. A protocol that performs these tasks is called fault tolerant. The authors revisit the problems discussed by introducing a more rigorous mathematical framework in analogy with classical error correction theory.
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.
Codeword-stabilized quantum codes provide a unified approach to constructing quantum error-correcting codes, including both additive and nonadditive quantum codes. Standard codeword-stabilized quantum codes encode quantum information into subspaces. The more general notion of encoding quantum information into a subsystem is known as an operator (or subsystem) quantum error-correcting code. Most operator codes studied to date are based in the usual stabilizer formalism. We introduce operator quantum codes based on the codeword-stabilized quantum code framework. Based on the necessary and sufficient conditions for operator quantum error correction, we derive an error-correction condition for operator codeword-stabilized quantum codes. Based on this condition, the word operators of a operator codeword-stabilized quantum code are constructed from a set of classical binary errors induced by generators of the gauge group. We use this scheme to construct examples of both additive and nonadditive codes that encode quantum information into a subsystem.
We introduce a stabilizer formalism for the general quantum error correction framework called operator algebra quantum error correction (OAQEC), which generalizes Gottesman's formulation for traditional quantum error correcting codes (QEC) and Poulin's for operator quantum error correction and subsystem codes (OQEC). The construction generates hybrid classical-quantum stabilizer codes and we formulate a theorem that fully characterizes the Pauli errors that are correctable for a given code, generalizing the fundamental theorems for the QEC and OQEC stabilizer formalisms. We discover hybrid versions of the Bacon-Shor subsystem codes motivated by the formalism, and we apply the theorem to derive a result that gives the distance of such codes. We show how some recent hybrid subspace code constructions are captured by the formalism, and we also indicate how it extends to qudits.
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.