Related papers: Sarnak's conjecture in quantum computing, cyclotom…

Suppose $4|n$, $n\geq 8$, $F=F_n=\mathbb{Q}(\zeta_n+\bar{\zeta}_n)$, and there is one prime $\mathfrak{p}=\mathfrak{p}_n$ above $2$ in $F_n$. We study amalgam presentations for $\operatorname{PU_{2}}(\mathbb{Z}[\zeta_n, 1/2])$ and…

The Clifford+T gate set is a topological generating set for PU(2), which has been well-studied from the perspective of quantum computation on a single qubit. The discovery that it generates a full S-arithmetic subgroup of PU(2) has led to a…

Our goal in this paper is to construct optimal topological generators for compact unitary Lie groups, extending the work of a letter of Sarnak and arXiv:1704.02106 on golden and super-golden gates to higher dimensions. To do so we consider…

For an integer $n\geq 8$ divisible by $4$, let $R_n=\mathbb{Z}[\zeta_n,1/2]$ and let $\operatorname{U}_2(R_n)$ be the group of $2\times 2$ unitary matrices with entries in $R_n$. Set…

Let $n$ be a positive integer divisible by 8. The Clifford-cyclotomic gate set $\mathcal{G}_n$ consists of the Clifford gates, together with a $z$-rotation of order $n$. It is easy to show that, if a circuit over $\mathcal{G}_n$ represents…

Let $n\geq 8$ be divisible by 4. The Clifford-cyclotomic gate set $\mathcal{G}_n$ is the universal gate set obtained by extending the Clifford gates with the $z$-rotation $T_n = \mathrm{diag}(1,\zeta_n)$, where $\zeta_n$ is a primitive…

The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length $N = 2^m$ over $\mathbb{Z}_4$. We show that exponentiating these $\mathbb{Z}_4$-valued codewords by $\imath \triangleq \sqrt{-1}$…

In quantum information context, the groups generated by Pauli spin matrices, and Dirac gamma matrices, are known as the single qubit Pauli group P, and two-qubit Pauli group P2, respectively. It has been found [M. Socolovsky, Int. J. Theor.…

Associated to any closed subgroup $G\subset U_N^+$ is a family of toral subgroups $T_Q\subset G$, indexed by the unitary matrices $Q\in U_N$. The family $\{T_Q|Q\in U_N\}$ is expected to encode the main properties of $G$, and there are…

One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.…

Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…

Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…

The recent proposal (M Planat and M Kibler, Preprint 0807.3650 [quantph]) of representing Clifford quantum gates in terms of unitary reflections is revisited. In this essay, the geometry of a Clifford group G is expressed as a BN-pair, i.e.…

We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…

Let $E$ be an optimal elliptic curve defined over $\mathbb{Q}$. The critical subgroup of $E$ is defined by Mazur and Swinnerton-Dyer as the subgroup of $E(\mathbb{Q})$ generated by traces of branch points under a modular parametrization of…

Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $\mathrm{CNOT}$ circuit can be implemented…

Previously one of us presented a conjecture [APF-4 Proceedings] to model antiferromagnetism and high temperature superconductivity and their 'unification' by quantum group symmetry rather than the corresponding classical symmetry in view of…

We provide a classification of compact quantum groups, which can be obtained by the Woronowicz construction, when the arrays used in the twisted determinant condition are extensions of functions on permutations. General properties of such…

All quantum gates with one and two qubits may be described by elements of $Spin$ groups due to isomorphisms $Spin(3) \simeq SU(2)$ and $Spin(6) \simeq SU(4)$. However, the group of $n$-qubit gates $SU(2^n)$ for $n > 2$ has bigger dimension…

We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action…