Related papers: Quantum Error Correction via Codes over GF(4)
In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat…
We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. To accomplish this, we encode the original state by…
In their comment, de Almedia and Palazzo \cite{comment} discovered an error in my earlier paper concerning the construction of quantum convolutional codes (quant-ph/9712029). This error can be repaired by modifying the method of code…
We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the…
Conventional fault-tolerant quantum error-correction schemes require a number of extra qubits that grows linearly with the code's maximum stabilizer generator weight. For some common distance-three codes, the recent "flag paradigm" uses…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional…
Topological stabilizer codes with different spatial dimensions have complementary properties. Here I show that the spatial dimension can be switched using gauge fixing. Combining 2D and 3D gauge color codes in a 3D qubit lattice,…
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…
We examine the transformation of noise under a quantum error correcting code (QECC) concatenated repeatedly with itself, by analyzing the effects of a quantum channel after each level of concatenation using recovery operators that are…
Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubit-flip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-Shor-Steane construction…
Advances in single photon creation, transmission, and detection suggest that sending quantum information over optical fibers may have losses low enough to be correctable using a quantum error correcting code. Such error-corrected…
We develop a theory based on quasi-geometric (QG) approach to transform a small number of qubits into a larger number of error-correcting qubits by considering four different cases. More precisely, we use the 2-dimensional quasi-orthogonal…
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…
It was shown by Ahn, Wiseman, and Milburn [PRA {\bf 67}, 052310 (2003)] that feedback control could be used as a quantum error correction process for errors induced by weak continuous measurement, given one perfectly measured error channel…
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into…
A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible…
It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…