Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from ReedMuller codes. A Singleton bound for pure con...

............................................................................................................................... i Co-Authorship Statement.................................................................................................... ii Acknowledgments.............................................................................................................. iii Table of

We solve one of the oldest problems in the theory of quantum stabilizer codes by proving the non-existence of quantum [[13,5,4]]-codes.

Let K〈x, y〉 be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not two elements in K〈x, y〉 are equivalent under an automorphism of K〈x, y〉. A modification of our algorithm solves the problem whether or not an element in K〈x, y〉 is a semiinvariant of a nontrivial automorphism. In partic...

In this paper by definition of generalized action of generalized Lie groups (top spaces) on a manifold, the concept of stabilizer of the top spaces is introduced. We show that the stabilizer is a top space, moreover we find the tangent space of a stabilizer. By using of the quotient spaces, the dimension of some top spaces are fined.

A base of a permutation group G on a set Ω is a subset B of Ω such that the pointwise stabilizer of B in G is trivial. The base size of G, denoted by b(G), is the minimal cardinality of a base. Let G = Sn or An acting primitively on a set with point stabilizer H. In this note we prove that if H acts primitively on {1, . . . , n}, and does not contain An, then b(G) = 2 for all n ≥ 13. Combined w...

We show how to convert a quantum stabilizer code to a one-way or two-way entanglement distillation protocol. The proposed conversion method is a generalization of those of Shor-Preskill and Nielsen-Chuang. The recurrence protocol and the quantum privacy amplification protocol are equivalent to the protocols converted from [[2, 1]] stabilizer codes. We also give an example of a two-way protocol ...

In this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  And we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. Also, we prove that  right and product stabilizers are filters and if they are ...

One of the problems concerning entanglement witnesses (EWs) is the construction of them by a given set of operators. Here several multi-qubit EWs called stabilizer EWs are constructed by using the stabilizer operators of some given multi-qubit states such as GHZ, cluster and exceptional states. The general approach to manipulate the multi-qubit stabilizer EWs by exact(approximate) linear progra...

This is an announcement of some new computational methods in stable homotopy theory, in particular, methods for using the cohomology of small-height Morava stabilizer groups to compute the cohomology of large-height Morava stabilizer groups. As an application, the cohomology of the height four Morava stabilizer group is computed at large primes (its rank turns out to be 3440). Consequently we a...