Related papers: Automorphisms of stabilizer codes
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these…
A scheme theoretic version of the automorphism group of a grading on an algebra is presented, and the classical result that shows that, over algebraically closed fields of characteristic 0, the automorphism group of a grading is the…
We study the behaviour of continuous automorphism groups of quantum spin systems on the lattice. Whereas the shift is norm asymptotically abelian continuous automorphism groups can lead only to delocalization but not to norm asymptotic…
We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…
The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a…
For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…
In this article, we study the fixed-point subgroups of the solvable Baumslag-Solitar groups $\BS(1,n)= \langle a, t \mid t a t^{-1} = a^{n} \rangle$, $n>1$ of automorphisms and endomorphisms. We also investigate the stabilizers of subgroups…
In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…
We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…
We propose a randomized variant of the stabilizer rewiring algorithm (SRA), a method for constructing a transversal circuit mapping between any pair of stabilizer codes. As gates along this circuit are applied, the initial code is deformed…
Semiclassical systems being symmetric under Lie group are studied. A state of a semiclassical system may be viewed as a set (X,f) of a classical state X and a quantum state f in the external classical background X. Therefore, the set of all…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
Given a variety of universal algebras. A method is suggested for describing automorphisms of a category of free algebras of this variety. Applying this general method all automorphisms of such categories are found in two cases: 1) for the…
We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes…
We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…