50,724 research outputs found
New Quantum Codes from Evaluation and Matrix-Product Codes
Stabilizer codes obtained via CSS code construction and Steane's enlargement
of subfield-subcodes and matrix-product codes coming from generalized
Reed-Muller, hyperbolic and affine variety codes are studied. Stabilizer codes
with good quantum parameters are supplied, in particular, some binary codes of
lengths 127 and 128 improve the parameters of the codes in
http://www.codetables.de. Moreover, non-binary codes are presented either with
parameters better than or equal to the quantum codes obtained from BCH codes by
La Guardia or with lengths that can not be reached by them
Homological Product Codes
Quantum codes with low-weight stabilizers known as LDPC codes have been
actively studied recently due to their simple syndrome readout circuits and
potential applications in fault-tolerant quantum computing. However, all
families of quantum LDPC codes known to this date suffer from a poor distance
scaling limited by the square-root of the code length. This is in a sharp
contrast with the classical case where good families of LDPC codes are known
that combine constant encoding rate and linear distance. Here we propose the
first family of good quantum codes with low-weight stabilizers. The new codes
have a constant encoding rate, linear distance, and stabilizers acting on at
most qubits, where is the code length. For comparison, all
previously known families of good quantum codes have stabilizers of linear
weight. Our proof combines two techniques: randomized constructions of good
quantum codes and the homological product operation from algebraic topology. We
conjecture that similar methods can produce good stabilizer codes with
stabilizer weight for any . Finally, we apply the homological
product to construct new small codes with low-weight stabilizers.Comment: 49 page
Quantum error-correcting codes associated with graphs
We present a construction scheme for quantum error correcting codes. The
basic ingredients are a graph and a finite abelian group, from which the code
can explicitly be obtained. We prove necessary and sufficient conditions for
the graph such that the resulting code corrects a certain number of errors.
This allows a simple verification of the 1-error correcting property of
fivefold codes in any dimension. As new examples we construct a large class of
codes saturating the singleton bound, as well as a tenfold code detecting 3
errors.Comment: 8 pages revtex, 5 figure
Constructions of Quantum Convolutional Codes
We address the problems of constructing quantum convolutional codes (QCCs)
and of encoding them. The first construction is a CSS-type construction which
allows us to find QCCs of rate 2/4. The second construction yields a quantum
convolutional code by applying a product code construction to an arbitrary
classical convolutional code and an arbitrary quantum block code. We show that
the resulting codes have highly structured and efficient encoders. Furthermore,
we show that the resulting quantum circuits have finite depth, independent of
the lengths of the input stream, and show that this depth is polynomial in the
degree and frame size of the code.Comment: 5 pages, to appear in the Proceedings of the 2007 IEEE International
Symposium on Information Theor
- …