The classification of self-orthogonal codes of length 42

2018 ◽  
Vol 10 (06) ◽  
pp. 1850083
Author(s):  
Debashis Ghosh ◽  
Joydeb Pal ◽  
Lakshmi Kanta Dey

Self-orthogonal codes play an important role in constructing quantum-error-correcting codes. In this paper, we prove that if quasi-symmetric 2-(41, 9, 9) design exists, then it arises from self-orthogonal and self-complementary [Formula: see text] codes with dual distance of at least 5. Moreover, we emphasize the enumeration of inequivalent doubly-even codes with the needed dual distance and an automorphism of order 7. This is found to be precisely 8.

2009 ◽  
Vol 07 (06) ◽  
pp. 1277-1283 ◽  
Author(s):  
JIANFA QIAN ◽  
WENPING MA ◽  
WANGMEI GUO

A new method to obtain self-orthogonal codes over finite field F2 is presented. Based on this method, we provide a construction for quantum error-correcting codes starting from cyclic codes over finite ring R = F2 + uF2. As an example, we present infinite families of quantum error-correcting codes which are derived from cyclic codes over the ring R = F2 + uF2.


2008 ◽  
Vol 25 (4) ◽  
pp. 519-522
Author(s):  
Yongjun Du ◽  
Yuefei Ma

2021 ◽  
Vol 103 (6) ◽  
Author(s):  
Stefanie J. Beale ◽  
Joel J. Wallman

2014 ◽  
Vol 28 (06) ◽  
pp. 1450017 ◽  
Author(s):  
RUIHU LI ◽  
GEN XU ◽  
LUOBIN GUO

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2 asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2 exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δ max +1 from binary primitive cyclic codes of length n = 2m-1, where δ max = 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.


Author(s):  
Axel Dahlberg ◽  
Stephanie Wehner

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool—for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ′ is a vertex-minor of another graph G . The vertex-minor problem is, in general, -Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ′ are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information. This article is part of a discussion meeting issue ‘Foundations of quantum mechanics and their impact on contemporary society’.


1997 ◽  
Vol 55 (2) ◽  
pp. 900-911 ◽  
Author(s):  
Emanuel Knill ◽  
Raymond Laflamme

Sign in / Sign up

Export Citation Format

Share Document