6,356 research outputs found
Commutative association schemes
Association schemes were originally introduced by Bose and his co-workers in
the design of statistical experiments. Since that point of inception, the
concept has proved useful in the study of group actions, in algebraic graph
theory, in algebraic coding theory, and in areas as far afield as knot theory
and numerical integration. This branch of the theory, viewed in this collection
of surveys as the "commutative case," has seen significant activity in the last
few decades. The goal of the present survey is to discuss the most important
new developments in several directions, including Gelfand pairs, cometric
association schemes, Delsarte Theory, spin models and the semidefinite
programming technique. The narrative follows a thread through this list of
topics, this being the contrast between combinatorial symmetry and
group-theoretic symmetry, culminating in Schrijver's SDP bound for binary codes
(based on group actions) and its connection to the Terwilliger algebra (based
on combinatorial symmetry). We propose this new role of the Terwilliger algebra
in Delsarte Theory as a central topic for future work.Comment: 36 page
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
Convolutional and tail-biting quantum error-correcting codes
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to
4096 states and minimum distances up to 10 are constructed as stabilizer codes
from classical self-orthogonal rate-1/n F_4-linear and binary linear
convolutional codes, respectively. These codes generally have higher rate and
less decoding complexity than comparable quantum block codes or previous
quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same
rate and error-correction capability and essentially the same decoding
algorithms are derived from these convolutional codes via tail-biting.Comment: 30 pages. Submitted to IEEE Transactions on Information Theory. Minor
revisions after first round of review
Exotic topological order in fractal spin liquids
We present a large class of three-dimensional spin models that possess
topological order with stability against local perturbations, but are beyond
description of topological quantum field theory. Conventional topological spin
liquids, on a formal level, may be viewed as condensation of string-like
extended objects with discrete gauge symmetries, being at fixed points with
continuous scale symmetries. In contrast, ground states of fractal spin liquids
are condensation of highly-fluctuating fractal objects with certain algebraic
symmetries, corresponding to limit cycles under real-space renormalization
group transformations which naturally arise from discrete scale symmetries of
underlying fractal geometries. A particular class of three-dimensional models
proposed in this paper may potentially saturate quantum information storage
capacity for local spin systems.Comment: 18 pages, 10 figure
Classical and Quantum Evaluation Codesat the Trace Roots
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian inner product. They allow us to construct stabilizer quantum codes over several finite fields which substantially improve the codes in the literature. For the binary case, we obtain records at http://codetables.de/. Moreover, we obtain several classical linear codes over the field F 4 which are records at http://codetables.de/
Topological Order and Memory Time in Marginally Self-Correcting Quantum Memory
We examine two proposals for marginally self-correcting quantum memory, the
cubic code by Haah and the welded code by Michnicki. In particular, we prove
explicitly that they are absent of topological order above zero temperature, as
their Gibbs ensembles can be prepared via a short-depth quantum circuit from
classical ensembles. Our proof technique naturally gives rise to the notion of
free energy associated with excitations. Further, we develop a framework for an
ergodic decomposition of Davies generators in CSS codes which enables formal
reduction to simpler classical memory problems. We then show that memory time
in the welded code is doubly exponential in inverse temperature via the Peierls
argument. These results introduce further connections between thermal
topological order and self-correction from the viewpoint of free energy and
quantum circuit depth.Comment: 19 pages, 18 figure
- …