In this work, we study the theory of quantum error correction, one of the main methods of preventing loss of information in a quantum computer.This method, however, is normally studied under ideal conditions in which the operation of the quantum gates that constitute the quantum algorithm do not interefere with the kind of error the system undergoes.Moreover, the syndrome measurements employed in the traditional method are considered instantaneous.Our aims with this work are to evaluate how altering these two suppositions would modify the quantum error correction process.In respect with the first objective, we verify that, for errors caused by external environments, the action of a logical gate simultaneously to the noise can provoke errors that, in principle, may not be correctable by the code employed.We subsequently propose a short-step correction method that can be used to render negligible the uncorrectable errors, besides being capable of reducing the probability of occurrence of correctable errors.For the second objective, we first study how finite-time measurements affect the decoherence of a single qubit, concluding that this kind of measurement can actually protect the state under scrutiny.Motivated by that, we demonstrate, that, in certain cases, finite syndrome measurements performed concurrently with the noise are capable of protecting more efficiently the state of the qubits against errors than if the measurements had been performed instantaneously at the the end of the process.
In this work, we study the theory of quantum error correction, one of the main methods of preventing loss of information in a quantum computer.This method, however, is normally studied under ideal conditions in which the operation of the quantum gates that constitute the quantum algorithm do not interefere with the kind of error the system undergoes.Moreover, the syndrome measurements employed in the traditional method are considered instantaneous.Our aims with this work are to evaluate how altering these two suppositions would modify the quantum error correction process.In respect with the first objective, we verify that, for errors caused by external environments, the action of a logical gate simultaneously to the noise can provoke errors that, in principle, may not be correctable by the code employed.We subsequently propose a short-step correction method that can be used to render negligible the uncorrectable errors, besides being capable of reducing the probability of occurrence of correctable errors.For the second objective, we first study how finite-time measurements affect the decoherence of a single qubit, concluding that this kind of measurement can actually protect the state under scrutiny.Motivated by that, we demonstrate, that, in certain cases, finite syndrome measurements performed concurrently with the noise are capable of protecting more efficiently the state of the qubits against errors than if the measurements had been performed instantaneously at the the end of the process.
This work is a study of the influence of the medium on the quantum system of qubits. The article assumes a description of the fundamentals of the quantum information theory, as well as a place in it the concept of quantum entanglement. Quantum error correction is a set of methods for protecting quantum information and quantum state from unwanted interactions of the environment (decoherence) and other forms and types of noise. Today, there are modern quantum technologies that are capable of supporting fundamentally new computational algorithms based on the principles of quantum mechanics. The dependences of data distortion on noise and measures of decoherence on noise in one qubit are demonstrated. This article is devoted to solving the problem of research and development of corrective codes for correcting several types of quantum errors. These errors appear during computational processes in quantum algorithms and models of quantum computing devices. The aim of the work is to study existing methods for correcting various types of quantum errors and to create a corrective code for quantum error correction. The scientific novelty of this research is expressed in the one shortcoming exclusion of the quantum computing process. Currently, in many advanced countries of the world, intensive research is being carried out to develop and create quantum computers and their software, and there has been a rapid increase in interest in quantum computers. A large number of articles and monographs are published.
The quantum computing must be the initial mark of the second technological revolution caused by the deepening knowledge of the humankind about the peculiar features of the quantum mechanics. If we want to unlock all the potential of this new technology, a development of a fault-tolerant quantum computing will be needed. In order to reach this stage, it is necessary an implementation of quantum error correcting codes that guarantee an exponential suppression of the errors at each step of the execution of an algorithm. Besides that, we need to learn how to isolate our qubits aiming a suppression of the decoherence effects. Quantum mechanics imposes various constraints to the process of construction of the error correction codes, one of them is the impossibility of using copies as redundancy mechanism, once no-cloning theorem does not allow the creation of an universal copy machine of quantum states. Another issue to be noted within this context, is that the measurement process causes a collapse in the quantum state, thus leading to a corruption of the information encoded in the state. Fortunately, there are some ways to bypass the problems pointed out through the entanglement and the stabilizer formalism, the first one allows us to recover the redundancy through the delocalization of the information in the Hilbert spaces of the parts that share quantum correlations, while the second one provides a process of gathering information about the errors that can occur in the quantum state without measuring it. The surface codes are one of the quantum codes that use the features highlighted to correct the errors, this type of code is one of the main candidates to be experimentally implemented on a large scale and it presents promising results in the preliminary studies.
Communication is the prototypical application of error-correction methods. To communicate, a sender needs to convey information to a receiver over a noisy "communication channel." Such a channel can be thought of as a means of transmitting an information-carrying physical system from one place to another. During transmission, the physical system is subject to disturbances (noise) that can adversely affect the information carried. To use a communication channel, the sender needs to encode the information to be transmitted in the physical system. After transmission, the receiver decodes the information. Quantum error correction is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault-tolerant quantum computation that can deal with both noise on stored quantum information, and also with faulty quantum gates, faulty quantum preparation,and faulty measurements. In this dissertation, we look at how additional information about the structure of the quantum circuit and noise can improve or alter the performance of techniques in quantum error correction. Chapter 1 and 2, are an introduction to the quantum computation, quantum error correction codes and fault-tolerant quantum computing. These chapters are written to be a useful for students at the graduate and advanced undergraduate level. Also. The first two chapters of this dissertation will be useful to researchers in other fields who would like to understand how quantum error correction and fault-tolerant quantum computing are possible. In chapter 3, we present numerical simulation results comparing the logical error rates for the fault-tolerant [[7, 1, 3]] 's 7 code using the technique of ancilla verification vs. the newer method of ancilla decoding as described in [1]. In chapter 4, we determine how often one should apply error correction. Therefore, we provide a relationship between the logical error rate and the physical error rate for a sequence of logical gates, sometimes followed by noisy quantum error correction
In order to reduce errors, error correction codes need to be implemented fast. They can correct the errors corresponding to the first few orders in the Taylor expansion of the time evolution operator corresponding to the Hamiltonian of the interaction with the environment. If implemented fast enough, the zeroth order error predominates and the dominant effect is of error prevention by measurement (Zeno effect) rather than correction. In this ``Zeno regime,'' codes with less redundancy are sufficient for protection. We describe such a simple scheme, which uses two ``noiseless'' qubits to protect a large number, n, of information qubits from noise from the environment. The ``noisless qubits'' can be realized by treating them as logical qubits to be encoded by one of the previously introduced encoding schemes.
Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.
1. IntroductionQuantum system is vulnerable to disturbance from the external environment, which leads todecoherence in the system. We have to overcome this difficulty to realize a working quanutumcomputer and a dependable quantum information processing. Quantum error correction (QEC)[1, 2, 3] is one of the most promising candidates for overcoming decoherence.QEC proposals to date are separated roughly into two classes, one employs extra ancilla qubitsfor error syndrome readout while the other, called operator quantum error correction (OQEC)employs a higher rank projection operator. However, the schemes have not been built in actualquantum computing or quantum information processing so far. This is dueto the following obstaclesinherent in these QECs; the syndrome must be read out by introducing ancilla qubits duringcomputing/information processing in the former case, while realization of a high-rank projectionoperator is physically challenging in the latter case.It was shown in [4] that for some quantum channels there exist different QECs in which nosyndrome measurements, no ancillas and no projection operators were required. Recovery operationand decoding operation are combined into a single unitary operation and the output state is a directproductof a decoded qubitstate and an ancilla state. Aqubit state isreproducedwithout recoveringthe codeword and, moreover, the projection operation is automatically built in our output state.The purpose of this paper is to extend the results in [4] to general quantum channels. We showthat for any quantum channel there is a unitary recovery operation, with which the output stateis a tensor product of decoded qubit state and an ancilla state. As a result, a decoding scheme canbe done by a unitary gate followed by a partial trace operation.The rest of the paper is organized as follows. We introduce the basic notions of OQEC andthen prove the main theorem in Section 2. We also give simple examples demonstrating our resultand a simplified proof of a theorem given in [2] illustrating that our recovery channel can be usedto do correction for many other channels related to ours. Section 3 is devoted to summary anddiscussions.