Related papers: Quantum Deletion Codes derived from Classical Dele…
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…
The hypergraph product (HGP) construction of quantum error-correcting codes (QECC) offers a general and explicit method for building a QECC from two classical codes, thereby paving the way for the discovery of good quantum low-density…
The development of high-resolution, large-baseline optical interferometers would revolutionize astronomical imaging. However, classical techniques are hindered by physical limitations including loss, noise, and the fact that the received…
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this…
The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality…
Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. For quantum codes, a form of puncturing is known, but its description is based on the code space rather than its…
In a recent paper ([1]=quant-ph/0606035) it is shown how the optimal recovery operation in an error correction scheme can be considered as a semidefinite program. As a possible future improvement it is noted that still better error…
Error correction, in the standard meaning of the term, implies the ability to correct all small analog errors and some large errors. Examining assumptions at the basis of the recently proposed quantum error-correcting codes, it is pointed…
The concept of quantum interleaver and a simple method of quantum burst-error correction is proposed. By using the quantum interleaver, any quantum burst-errors that have occurred spread over the interleaved code word, so that we can…
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable problems such as those in the fields of…
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…
We show how to construct a large class of quantum error correcting codes, known as CSS codes, from highly entangled cluster states. This becomes a primitive in a protocol that foliates a series of such cluster states into a much larger…
Quantum degeneracy in error correction is a feature unique to quantum error correcting codes, unlike their classical counterpart. It allows a quantum error correcting code to correct errors even when they can not uniquely pinpoint the…
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…
We investigate a family of fault-tolerant quantum error correction schemes based on the concatenation of small error detection or error correction codes with the three-dimensional cluster state. We propose fault-tolerant state preparation…
We introduce the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we…
This paper shows that Knill-Laflamme condition, known as a necessary and sufficient condition for quantum error-correction, can be applied to quantum errors where the number of particles changes before and after the error. This fact shows…
Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise in quantum states and the fragility of quantum entanglement. However, most of the error-correcting codes increases the complexity of…
Error correcting codes with a universal set of transversal gates are a desideratum for quantum computing. Such codes, however, are ruled out by the Eastin-Knill theorem. Moreover, the theorem also rules out codes which are covariant with…
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…