3,003 research outputs found
Sparse Graph Codes for Quantum Error-Correction
We present sparse graph codes appropriate for use in quantum
error-correction. Quantum error-correcting codes based on sparse graphs are of
interest for three reasons. First, the best codes currently known for classical
channels are based on sparse graphs. Second, sparse graph codes keep the number
of quantum interactions associated with the quantum error correction process
small: a constant number per quantum bit, independent of the blocklength.
Third, sparse graph codes often offer great flexibility with respect to
blocklength and rate. We believe some of the codes we present are unsurpassed
by previously published quantum error-correcting codes.Comment: Version 7.3e: 42 pages. Extended version, Feb 2004. A shortened
version was resubmitted to IEEE Transactions on Information Theory Jan 20,
200
Structured Error Recovery for Codeword-Stabilized Quantum Codes
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes
that can correct errors by an exhaustive search of different error patterns,
similar to the way that we decode classical non-linear codes. For an n-qubit
quantum code correcting errors on up to t qubits, this brute-force approach
consecutively tests different errors of weight t or less, and employs a
separate n-qubit measurement in each test. In this paper, we suggest an error
grouping technique that allows to simultaneously test large groups of errors in
a single measurement. This structured error recovery technique exponentially
reduces the number of measurements by about 3^t times. While it still leaves
exponentially many measurements for a generic CWS code, the technique is
equivalent to syndrome-based recovery for the special case of additive CWS
codes.Comment: 13 pages, 9 eps figure
Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
New stabilizer codes with parameters better than the ones available in the
literature are provided in this work, in particular quantum codes with
parameters and that are records.
These codes are constructed with a new generalization of the Steane's
enlargement procedure and by considering orthogonal subfield-subcodes --with
respect to the Euclidean and Hermitian inner product-- of a new family of
linear codes, the -affine variety codes
Recoverable Information and Emergent Conservation Laws in Fracton Stabilizer Codes
We introduce a new quantity, that we term recoverable information, defined
for stabilizer Hamiltonians. For such models, the recoverable information
provides a measure of the topological information, as well as a physical
interpretation, which is complementary to topological entanglement entropy. We
discuss three different ways to calculate the recoverable information, and
prove their equivalence. To demonstrate its utility, we compute recoverable
information for fracton models using all three methods where appropriate. From
the recoverable information, we deduce the existence of emergent
Gauss-law type constraints, which in turn imply emergent conservation
laws for point-like quasiparticle excitations of an underlying topologically
ordered phase.Comment: Added additional cluster model calculation (SPT example) and a new
section discussing the general benefits of recoverable informatio
Topological Subsystem Codes
We introduce a family of 2D topological subsystem quantum error-correcting
codes. The gauge group is generated by 2-local Pauli operators, so that 2-local
measurements are enough to recover the error syndrome. We study the
computational power of code deformation in these codes, and show that
boundaries cannot be introduced in the usual way. In addition, we give a
general mapping connecting suitable classical statistical mechanical models to
optimal error correction in subsystem stabilizer codes that suffer from
depolarizing noise.Comment: 16 pages, 11 figures, explanations added, typos correcte
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
- …