This paper is an expanded and more detailed version of our recent work in which the Operator Quantum Error Correction formalism was introduced. This is a new scheme for the error correction of quantum operations that incorporates the known techniques - i.e. the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method - as special cases, and relies on a generalized mathematical framework for noiseless subsystems that applies to arbitrary quantum operations. We also discuss a number of examples and introduce the notion of ``unitarily noiseless subsystems''.
We present a unified approach to quantum error correction, called operator quantum error correction. This scheme relies on a generalized notion of noiseless subsystems that is not restricted to the commutant of the interaction algebra. We arrive at the unified approach, which incorporates the known techniques -- i.e. the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method -- as special cases, by combining active error correction with this generalized noiseless subsystem method. Moreover, we demonstrate that the quantum error correction …
We give a short introduction to operator quantum error correction. This is a new protocol for error correction in quantum computing that has brought the fundamental methods under a single umbrella, and has opened up new possibilities for protecting quantum information against undesirable noise. We describe the various conditions that characterize correction in this scheme.
We explore the intersection of studies in quantum error correction and quantum local operations and classical communication (LOCC). We consider one-way LOCC measurement protocols as quantum channels and investigate their error correction properties, emphasizing an operator theory approach to the subject, and we obtain new applications to one-way LOCC state distinguishability as well as new derivations of some established results. We also derive conditions on when states that arise through the stabilizer formalism for quantum error correction are distinguishable under one-way LOCC.
It is known that one can do quantum error correction without syndrome measurement, which is often done in operator quantum error correction (OQEC). However, the physical realization could be challenging, especially when the recovery process involves high-rank projection operators and a superoperator. We use operator theory to improve OQEC so that the implementation can always be done by unitary gates followed by a partial trace operation. Examples are given to show that our error correction scheme outperforms the existing ones in various scenarios.
Quantum error correction is important to quantum information processing, which allows us to reliably process information encoded in quantum error correction codes. Efficient quantum error correction benefits from the knowledge of error rates. We propose a protocol for monitoring error rates in real time without interrupting the quantum error correction. Any adaptation of the quantum error correction code or its implementation circuit is not required. The protocol can be directly applied to the most advanced quantum error correction techniques, e.g. surface code. A Gaussian processes algorithm …
Operator quantum error-correction is a technique for robustly storing quantum information in the presence of noise. It generalizes the standard theory of quantum error-correction, and provides a unified framework for topics such as quantum error-correction, decoherence-free subspaces, and noiseless subsystems. This paper develops (a) easily applied algebraic and information-theoretic conditions which characterize when operator quantum error-correction is feasible; (b) a representation theorem for a class of noise processes which can be corrected using operator quantum error-correction; and (c)…
The complexity of the error correction circuitry forces us to design quantum error correction codes capable of correcting a single error per error correction cycle. Yet, time-correlated error are common for physical implementations of quantum systems; an error corrected during the previous cycle may reoccur later due to physical processes specific for each physical implementation of the qubits. In this paper we study quantum error correction for a restricted class of time-correlated errors in a spin-boson model. The algorithm we propose allows the correction of two errors per error correction …
Operator quantum error correction provides a unified framework for the known techniques of quantum error correction such as the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method. We first show an example of a new quantum error correction scheme which can not be described by operation quantum error correction. Then we introduce a different notion of noiseless subsystems according to the example. Base on this notion, we present a more unified approach which incorporates operator quantum error correction as a special case. Moreover, we a…
The attempt to equate operator quantum error correction (quant-ph/0504189v1) with the quantum computer condition (quant-ph/0507141) in version two of quant-ph/0504189 is shown to be invalid.
Fault tolerant protocol assumes the application of error correction after every quantum gate. However, correcting errors is costly in terms of time and number of qubits. Here we demonstrate that quantum error correction can be applied significantly less often with only a minimal loss of fidelity. This is done by simulating the implementation of 50 encoded, single-qubit, quantum gates within the [[7,1,3]] quantum error correction code in a noisy, non-equiprobable Pauli error environment with error correction being applied at different intervals. We find that applying error correction after ever…
Motivated by limitations and capabilities of neutral atom qubits, we examine whether measurement-free error correction can produce practical error thresholds. We show that this can be achieved by extracting redundant syndrome information, giving our procedure extra fault tolerance and eliminating the need for ancilla verification. The procedure is particularly favorable when multi-qubit gates are available for the correction step. Simulations of the bit-flip, Bacon-Shor, and Steane codes indicate that coherent error correction can produce threshold error rates that are on the order of $10^{-3}…
In this paper we show how the fault--tolerant error correction scheme recently proposed by DiVincenzo and Shor may be improved. Our scheme, unlike the earlier one, can also deal with a single error that might occur {\em during} the gate operations that are required for the implementation of the error correction and not only in--between the gates and hence presents an improvement towards enabling error correction and with it the practical possibility of some more involved quantum computations, such as e.g. factorization of large numbers.
We show how to perform error correction of single qubit dephasing by encoding a single qubit into a minimum of three. This may be performed in a manner closely analogous to classical error correction schemes. Further, the resulting quantum error correction schemes are trivially generalized to the minimal encoding of arbitrarily many qubits so as to allow for multiqubit dephasing correction under the sole condition that the environment acts independently on each qubit.
I give an overview of the basic concepts behind quantum error correction and quantum fault tolerance. This includes the quantum error correction conditions, stabilizer codes, CSS codes, transversal gates, fault-tolerant error correction, and the threshold theorem.
Quantum error-correction routines are developed for continuous quantum variables such as position and momentum. The result of such analog quantum error correction is the construction of composite continuous quantum variables that are largely immune to the effects of noise and decoherence.
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 \otimes σ'$. 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…
By taking into account the physical nature of quantum errors it is possible to improve the efficiency of quantum error correction. Here we consider an optimisation to conventional quantum error correction which involves exploiting asymmetries in the rates of X and Z errors by reducing the rate of X correction. As an example, we apply this optimisation to the [[7,1,3]] code and make a comparison with conventional quantum error correction. After two levels of concatenated error correction we demonstrate a circuit depth reduction of at least 43% and reduction in failure rate of at least 67%. This…
The standard quantum error correction protocols use projective measurements to extract the error syndromes from the encoded states. We consider the more general scenario of weak measurements, where only partial information about the error syndrome can be extracted from the encoded state. We construct a feedback protocol that probabilistically corrects the error based on the extracted information. Using numerical simulations of one-qubit error correction codes, we show that our error correction succeeds for a range of the weak measurement strength, where (a) the error rate is below the threshol…
It is argued that the existing schemes of fault-tolerant quantum computation designed for discrete-time models and based on quantum error correction fail for continuous-time Hamiltonian models even with Markovian noise.
From the set of operators for errors and its correction code, we introduce the so-called complete unitary transformation. It can be used for encoding while the inverse of it can be applied for correcting the errors of the encoded qubit. We show that this unitary protocol can be applied for any code which satisfies the quantum error correction condition.
This note presents a few observations on the nonlocal nature of quantum errors and the expected performance of the recently proposed quantum error-correction codes that are based on the assumption that the errors are either bit-flip or phase-flip or both.
Correcting errors is a vital but expensive component of fault tolerant quantum computation. Standard fault tolerant protocol assumes the implementation of error correction, via syndrome measurements and possible recovery operations, after every quantum gate. In fact, this is not necessary. Here we demonstrate that error correction should be applied more sparingly. We simulate encoded single-qubit rotations within the [[7,1,3]] code and show via fidelity measures that applying error correction after every gate is not desirable.
Inspired by Knill's scheme for message passing error detection, here we develop a scheme for message passing error correction for the nine-qubit Bacon-Shor code. We show that for two levels of concatenated error correction, where classical information obtained at the first level is used to help interpret the syndrome at the second level, our scheme will correct all cases with four physical errors. This results in a reduction of the logical failure rate relative to conventional error correction by a factor proportional to the reciprocal of the physical error rate.
Topological error correction provides an effective method to correct errors in quantum computation. It allows quantum computation to be implemented with higher error threshold and high tolerating loss rates. We present a topological a error correction scheme with continuous variables based on an eight-partite Gaussian cluster state. We show that topological quantum correlation between two modes can be protected against a single quadrature phase displacement error occurring on any mode and some of two errors occurring on two modes. More interestingly, some cases of errors occurring on three mod…
The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties…
We show how procedures which can correct phase and amplitude errors can be directly applied to correct errors due to quantum entanglement. We specify general criteria for quantum error correction, introduce quantum versions of the Hamming and the Gilbert-Varshamov bounds and comment on the practical implementation of quantum codes.
The errors that arise in a quantum channel can be corrected perfectly if and only if the channel does not decrease the coherent information of the input state. We show that, if the loss of coherent information is small, then approximate error correction is possible.
We consider a two reservoir model of quantum error correction with a hot bath causing errors in the qubits and a cold bath cooling the ancilla qubits to a fiducial state. We consider error correction protocols both with and without measurement of the ancilla state. The error correction acts as a kind of refrigeration process to maintain the data qubits in a low entropy state by periodically moving the entropy to the ancilla qubits and then to the cold reservoir. We quantify the performance of the error correction as a function of the reservoir temperatures and cooling rate by means of the fide…
We identify optimal quantum error correction codes for situations that do not admit perfect correction. We provide analytic n-qubit results for standard cases with correlated errors on multiple qubits and demonstrate significant improvements to the fidelity bounds and optimal entanglement decay profiles.
To implement fault-tolerant quantum computation with continuous variables, the Gottesman--Kitaev--Preskill (GKP) qubit has been recognized as an important technological element. We have proposed a method to reduce the required squeezing level to realize large scale quantum computation with the GKP qubit [Phys. Rev. X. {\bf 8}, 021054 (2018)], harnessing the virtue of analog information in the GKP qubits. In the present work, to reduce the number of qubits required for large scale quantum computation, we propose the tracking quantum error correction, where the logical-qubit level quantum error …
We propose a new scheme for quantum error correction using robust continuous variable probe modes, rather than fragile ancilla qubits, to detect errors without destroying data qubits. The use of such probe modes reduces the required number of expensive qubits in error correction and allows efficient encoding, error detection and error correction. Moreover, the elimination of the need for direct qubit interactions significantly simplifies the construction of quantum circuits. We will illustrate how the approach implements three existing quantum error correcting codes: the 3-qubit bit-flip (phas…
Graph states have been used to construct quantum error correction codes for independent errors. Hypergraph states generalize graph states, and symmetric hypergraph states have been shown to allow for the correction of correlated errors. In this paper, it is shown that symmetric hypergraph states are not useful for the correction of independent errors, at least for up to 30 qubits. Furthermore, error correction for error models with protected qubits is explored. A class of known graph codes for this scenario is generalized to hypergraph codes.
In this paper we introduce a general fault-tolerant quantum error correction protocol using flag circuits for measuring stabilizers of arbitrary distance codes. In addition to extending flag error correction beyond distance-three codes for the first time, our protocol also applies to a broader class of distance-three codes than was previously known. Flag circuits use extra ancilla qubits to signal when errors resulting from $v$ faults in the circuit have weight greater than $v$. The flag error correction protocol is applicable to stabilizer codes of arbitrary distance which satisfy a set of co…
We analyze the four dimensional toric code in a hyperbolic space and show that it has a classical error correction procedure which runs in almost linear time and can be parallelized to almost constant time, giving an example of a quantum LDPC code with linear rate and efficient error correction.
Fault-tolerant quantum computing demands many qubits with long lifetimes to conduct accurate quantum gate operations. However, external noise limits the computing time of physical qubits. Quantum error correction codes may extend such limits, but imperfect gate operations introduce errors to the correction procedure as well. The additional gate operations required due to the physical layout of qubits exacerbate the situation. Here, we use density-matrix simulations to investigate the performance change of logical qubits according to quantum error correction codes and qubit layouts and the expe…
In quantum error correction using imperfect primitives, errors of high weight arising from a few faults are major concerns since they might not be correctable by the quantum error correcting code. Fortunately, some errors of different weights are logically equivalent and the same correction procedure is applicable to all equivalent errors, thus correcting high-weight errors is sometimes possible. In this work, we introduce a technique called weight parity error correction (WPEC) which can correct Pauli error of any weight in some stabilizer codes provided that the parity of the weight of the e…
Quantum error correcting codes (QECC) are the key ingredients both for fault-tolerant quantum computation and quantum communication. Teleportation-based error correction (TEC) helps in detecting and correcting operational and erasure errors by performing X and Z measurements during teleportation. Here we demonstrate the TEC protocol for the detection and correction of a single bit-flip error by proposing a new quantum circuit. A single phase-flip error can also be detected and corrected using the above protocol. For the first time, we illustrate detection and correction of erasure error in the…
In classical case there is simplest method of error correction with using three equal bits instead of one. In the paper is shown, how the scheme fails for quantum error correction with complex vector spaces of usual quantum mechanics, but works in real and quaternionic cases. It is discussed also, how to implement the three qubits scheme with using encoding of quaternionic qubit by Majorana spinor. Necessary concepts and formulae from area of quantum error corrections are closely introduced and proved.
Dissipation may cause two initially entangled qubits to evolve into a separable state in a finite time. This behavior is called entanglement sudden death (ESD). We study to what extent quantum error correction can combat ESD. We find that in some cases quantum error correction can delay entanglement sudden death but in other cases quantum error correction may cause ESD for states that otherwise do not suffer from it. Our analysis also shows that fidelity may not be the best measure to compare the efficiency of different error correction codes since the fidelity is not directly coupled to a sta…
We examine the efficiency of pure, nondegenerate quantum-error correction-codes for Pauli channels. Specifically, we investigate if correction of multiple errors in a block is more efficient than using a code that only corrects one error per block. Block coding with multiple-error correction cannot increase the efficiency when the qubit error-probability is below a certain value and the code size fixed. More surprisingly, existing multiple-error correction codes with a code length equal or less than 256 qubits have lower efficiency than the optimal single-error correcting codes for any value o…
Quantum information can be protected from decoherence and other errors, but only if these errors are sufficiently rare. For quantum computation to become a scalable technology, practical schemes for quantum error correction that can tolerate realistically high error rates will be necessary. In some physical systems, errors may exhibit a characteristic structure that can be carefully exploited to improve the efficacy of error correction. Here, we describe a scheme for topological quantum error correction to protect quantum information from a dephasing-biased error model, where we combine a repe…
The smallest quantum code that can correct all one-qubit errors is based on five qubits. We experimentally implemented the encoding, decoding and error-correction quantum networks using nuclear magnetic resonance on a five spin subsystem of labeled crotonic acid. The ability to correct each error was verified by tomography of the process. The use of error-correction for benchmarking quantum networks is discussed, and we infer that the fidelity achieved in our experiment is sufficient for preserving entanglement.
Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error-correcting codes, teleportation, and reversing quantum measurements. We derive information-theoretic conditions and equivalent algebraic conditions that are necessary and sufficient for a general quantum operation to be reversible. We analyze the thermodynamic cost of error correction and show that error correction can be regarded as a kind of ``Maxwell demon,'' for which there is an entropy cost associated with information obtain…
We present single-photon schemes for quantum error rejection and correction with linear optics. In stark contrast to other known proposals, our schemes do not require multi-photon entangled states, are not probabilistic, and their application is not restricted to single bit-flip errors.
A general error correction method is presented which is capable of correcting coherent errors originating from static residual inter-qubit couplings in a quantum computer. It is based on a randomization of static imperfections in a many-qubit system by the repeated application of Pauli operators which change the computational basis. This Pauli-Random-Error-Correction (PAREC)-method eliminates coherent errors produced by static imperfections and increases significantly the maximum time over which realistic quantum computations can be performed reliably. Furthermore, it does not require redundan…
Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilation strategies at the software level. As such, familiarity with quantum coding is an essential prerequisite for the understanding of current and future quantum computing architectures. In this review, we provide an introductory guide to the theory and implementation of quantum error correction codes. Where possible, fundamental concepts are describ…
We present a quantum error correcting code that is invariant under the conditional time evolution between spontaneous emissions and which can correct for one general error. The code presented here generalizes previous error correction codes in that not all errors lead to different error syndromes. This idea may lead to shorter codes than previously expected.
We demonstrate that continuous-variable quantum error correction based on Gaussian ancilla states and Gaussian operations (for encoding, syndrome extraction, and recovery) can be very useful to suppress the effect of non-Gaussian error channels. For a certain class of stochastic error models, reminiscent of those typically considered in the qubit case, quantum error correction codes designed for single-channel errors may enhance the transfer fidelities even when errors occur in every channel employed for transmitting the encoded state. In fact, in this case, the error-correcting capability of …
We consider error correction in quantum key distribution. To avoid that Alice and Bob unwittingly end up with different keys precautions must be taken. Before running the error correction protocol, Bob and Alice normally sacrifice some bits to estimate the error rate. To reduce the probability that they end up with different keys to an acceptable level, we show that a large number of bits must be sacrificed. Instead, if Alice and Bob can make a good guess about the error rate before the error correction, they can verify that their keys are similar after the error correction protocol. This veri…
We propose an error correction coding algorithm for continuous quantum variables. We use this algorithm to construct a highly efficient 5-wavepacket code which can correct arbitrary single wavepacket errors. We show that this class of continuous variable codes is robust against imprecision in the error syndromes. A potential implemetation of the scheme is presented.
The purpose of this little survey is to give a simple description of the main approaches to quantum error correction and quantum fault-tolerance. Our goal is to convey the necessary intuitions both for the problems and their solutions in this area. After characterising quantum errors we present several error-correction schemes and outline the elements of a full fledged fault-tolerant computation, which works error-free even though all of its components can be faulty. We also mention alternative approaches to error-correction, so called error-avoiding or decoherence-free schemes. Technical deta…
We describe an implementation of quantum error correction that operates continuously in time and requires no active interventions such as measurements or gates. The mechanism for carrying away the entropy introduced by errors is a cooling procedure. We evaluate the effectiveness of the scheme by simulation, and remark on its connections to some recently proposed error prevention procedures.
