Topological quantum codes from self-complementary self-dual graphs
نویسندگان
چکیده
منابع مشابه
Topological quantum codes from self-complementary self-dual graphs
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of “voltage graphs” and “Paley graphs in the Galois field GF (p)”, where p ∈ P and r ∈ Z. The parameters of two new classes of quantum codes are [[(2k + 2)(8k + 7), 2(8k +7k), dmin]] and [[(2k+2)(8k +9), 2(8k +9k +1), dmin]] respectively...
متن کاملOn Self-Dual Quantum Codes, Graphs, and Boolean Functions
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...
متن کاملFormally self-dual linear binary codes from circulant graphs
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So graph is an important tool for searching optimum code. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.
متن کاملNew self-dual additive F4-codes constructed from circulant graphs
In order to construct quantum [[n, 0, d]] codes for (n, d) = (56, 15), (57, 15), (58, 16), (63, 16), (67, 17), (70, 18), (71, 18), (79, 19), (83, 20), (87, 20), (89, 21), (95, 20), we construct self-dual additive F4-codes of length n and minimum weight d from circulant graphs. The quantum codes with these parameters are constructed for the first time.
متن کاملQuantum self-dual codes and symmetric matrices
In a recent paper Calderbank, Rains, Shor and Sloane [1] described a method of constructing quantum-error-correcting codes from ordinary binary or quaternary codes that are selforthogonal with respect to a certain inner product. We use this relation to show that a class of binary formally self-dual codes defined by symmetric matrices give rise to quantum codes with error-correcting capacity pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2015
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-015-1115-9