SearcharxivSearch

arXiv · 1906.06068

Group geometrical axioms for magic states of quantum computing

Abstract

Let $H$ be a non trivial subgroup of index $d$ of a free group $G$ and $N$ the normal closure of $H$ in $G$. The coset organization in a subgroup $H$ of $G$ provides a group $P$ of permutation gates whose common eigenstates are either stabilizer states of the Pauli group or magic states for universal quantum computing. A subset of magic states consists of MIC states associated to minimal informationally complete measurements. It is shown that, in most cases, the existence of a MIC state entails that the two conditions (i) $N=G$ and (ii) no geometry (a triple of cosets cannot produce equal pairwise stabilizer subgroups), or that these conditions are both not satisfied. Our claim is verified by defining the low dimensional MIC states from subgroups of the fundamental group $G=\pi_1(M)$ of some manifolds encountered in our recent papers, e.g. the $3$-manifolds attached to the trefoil knot and the figure-eight knot, and the $4$-manifolds defined by $0$-surgery of them. Exceptions to the aforementioned rule are classified in terms of geometric contextuality (which occurs when cosets on a line of the geometry do not all mutually commute).

Explore related subjects

Keep this discovery

BibTeXRIS

Michel Planat, Raymond Aschheim, Marcelo M. Amaral, Klee Irwin. 2019-06-14. Group geometrical axioms for magic states of quantum computing. https://doi.org/10.3390/math7100948

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR