Related papers: Beyond Stabilizer Codes I: Nice Error Bases

The theory of standard bases in polynomial rings with coefficients in a ring R with respect to local orderings is developed. R is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in R.

We prove an algebraic version of a classical theorem in topology, asserting that an abelian p-group action on a smooth projective variety of positive dimension cannot fix exactly one point. When the group has only two elements, we prove…

A k-gap is a finite k-sequence of pairwise disjoint monotone families of infinite subsets of N mixed in such a way that we cannot find a partition of N such that each family is trival on one piece of the partition. We prove that, relative…

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…

We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.

Let G be a finite solvable permutation group. Then modulo a possibly trivial normal elementary abelian 3-subgroup, some set-stabilizer in G is a 2-group.

Let $G$ be a finite permutation group on $\Omega.$ An ordered sequence $(\omega_1,\dots, \omega_t)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of its…

Let $G$ be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of $G$ is trivial. In 2010, Vdovin conjectured that the base size of $G$ is at most 5. Burness proved this…

Consider a finite primitive solvable group. We observe that a result of Y. Yang implies that there exist two points whose pointwise stabilizer has derived length at most $9$. We show that, if the group has odd cardinality, then there exist…

We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…

We propose an analysis for the stabilized finite element methods proposed in, E. Burman, Stabilized finite element methods for nonsymmetric, noncoercive, and ill-posed problems. Part I: Elliptic equations. SIAM J. Sci. Comput., 35(6) 2013,…

A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…

It is known that nonadditive quantum codes are more optimal for error correction when compared to stabilizer codes. The class of codeword stabilized codes (CWS) provides tools to obtain new nonadditive quantum codes by reducing the problem…

Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit,…

Let $K$ be a field and let $S=K[x_1,\dots,x_n]$ be a standard polynomial ring over a field $K$. We characterize the extremal Betti numbers, values as well positions, of a $t$-spread strongly stable ideal of $S$. Our approach is…

We contribute towards the classification programme for Conway groupoids associated to a $2-(n,4,\lambda)$ design. Our main results improve the known bounds for a hole stabilizer to be primitive, or to contain the alternating group, ${\rm…

Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…

We consider the grading of $sl(n,\mathbb{C})$ by the group $\Pi_n$ of generalized Pauli matrices. The grading decomposes the Lie algebra into $n^2-1$ one--dimensional subspaces. In the article we demonstrate that the normalizer of grading…