Related papers: Automorphisms of stabilizer codes

In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…

Let $A$ be a finite non-abelian simple Mal'cev algebra, such as for example a finite simple non-abelian group or a finite simple non-zero ring. We show that the automorphism group of a filtered Boolean power of $A$ by the countable atomless…

We discuss some finite homogeneous structures, addressing the question of universality of their automorphism groups. We also study the existence of so-called Kat\v{e}tov functors in finite categories of embeddings or homomorphisms.

We study general maps from the space of rational CFTs with a fixed chiral algebra and associated Chern-Simons (CS) theories to the space of qudit stabilizer codes with a fixed generalized Pauli group. We consider certain natural constraints…

We obtain analogues of classical results on automorphism groups of holomorphic fiber bundles, in the setting of group schemes. Also, we establish a lifting property of the connected automorphism group, for torsors under abelian varieties.…

We establish a structure theorem for the connected automorphism groups of smooth complete toroidal horospherical varieties, that is, toric fibrations over rational homogeneous spaces. The key ingredient is a characterization of the Demazure…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Two topological phases are equivalent if they are connected by a local unitary transformation. In this sense, classifying topological phases amounts to classifying long-range entanglement patterns. We show that all 2D topological stabilizer…

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all…

This work is concerned with multi-party stabilizer states in the sense of quantum information theory. We investigate the homological invariants for states of which each party holds a large equal number N of quantum bits. We show that in…

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

Homology of the group Aut(F_n) of automorphisms of a free group on n generators is known to be independent of n in a certain stable range. Using tools from homotopy theory, we prove that in this range it agrees with homology of symmetric…

We classify the pairs $(X,\pi)$, where $\pi\colon X\to S$ is a $\mathbb{P}^1$-bundle over a non-rational geometrically ruled surface $S$ and $\mathrm{Aut}^\circ(X)$ is relatively maximal, i.e., maximal with respect to the inclusion in the…

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

We identify the obstructions for the functoriality and the uniqueness of the totalization functor, (partially) defined on the category of simplicial objects in the homotopy category of a stable model category, and we use a result from the…

In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…

Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely…

We show the simplicity of the automorphism groups of the generic $n$-hypertournament and the semigeneric tournament, and determine the normal subgroups of the automorphism groups of several other ultrahomogeneous oriented graphs. We also…

This is the first in a sequence of papers that will develop the theory of automorphisms of nonsolvable finite groups. The sequence will culminate in a new proof of McBride's Nonsolvable Signalizer Functor Theorem, which is one of the…