Most quantum error-correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $|0\ensuremath{\rangle}$ which can be used as ancilla qubits to prepare multiqubit logical states. In this Brief Report, we examine the consequences of relaxing this assumption and propose a method to increase the fidelity produced by a given code when the ancilla qubits are initialized in mixed states, using the same number of qubits, at most doubling the number of gates when the recovery operation would already be implemented. The procedure implemented consists of altering the encoding operator to include the inverse of the unitary operation used to correct detected errors after decoding. This augmentation will be especially useful in quantum computing architectures that do not possess projective measurement, such as solid-state NMR quantum information processing.
Most quantum error-correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state ∣0\ensuremath⟩ which can be used as ancilla qubits to prepare multiqubit logical states. In this Brief Report, we examine the consequences of relaxing this assumption and propose a method to increase the fidelity produced by a given code when the ancilla qubits are initialized in mixed states, using the same number of qubits, at most doubling the number of gates when the recovery operation would already be implemented. The procedure implemented consists of altering the encoding operator to include the inverse of the unitary operation used to correct detected errors after decoding. This augmentation will be especially useful in quantum computing architectures that do not possess projective measurement, such as solid-state NMR quantum information processing.
We propose a quantum error correction without error detection. A quantum state ρ0 combined with an ancilla state σ is encoded unitarily and an error operator is applied on the encoded state. The recovery operation then produces a tensor product state ρ0⊗σ′. The decoding operation is combined with the recovery operation and the state ρ0 is directly reproduced without referring to the code word. A higher rank projection operator required for a conventional operator quantum error correction is not necessary to implement. Encoding and the recovery operations are implemented with unitary operators only, which makes quantum error correction much easier than any other proposals.
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.
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.
In quantum error-correcting code (QECC), many quantum operations and measurements are necessary to correct errors in logical qubits. In the stabilizer formalism, which is widely used in QECC, generators Gi(i=1,2,...) consist of multiples of Pauli matrices and perform encoding, decoding, and measurement. In order to maintain encoding states, the stabilizer Hamiltonian ${H}_{\mathrm{stab}}=\ensuremath{-}{\ensuremath{\sum}}_{i}{G}_{i}$ is suitable because its ground state corresponds to the code space. On the other hand, Hamiltonians of most solid-state qubits have two-body interactions and show their own dynamics. In addition solid-state qubits are fixed on substrate and qubit-qubit operation is restricted in their neighborhood. The main purpose of this paper is to show how to directly generate the stabilizer Hamiltonian Hstab from conventional two-body Hamiltonians with Ising interaction and XY interaction by applying a pulse control method such as an NMR technique. We show that generation times of Hstab for nine-qubit code, five-qubit code, and Steane code are estimated to be less than 300 ns when typical experimental data of superconducting qubits are used, and sufficient pulse control is assumed. We also show how to prepare encoded states from an initial state $|0,...,0\ensuremath{\rangle}$. In addition, we discuss an appropriate arrangement of two- or three-dimensional arrayed qubits.
Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.
Abstract: Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery operator independent definition of error-correcting codes. We relate this definition to four others: The existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.