paper

Automorphisms of stabilizer codes

arXiv:1102.5715

Abstract

We study the automorphisms of binary stabilizer codes and states. We prove that they almost always form a solvable group, and thereby shed new light on the fact that there is no universal set of transversal gates. We also determine the connected component of the automorphism group.

13 pages, 2 figures

References in corpus (3)