Related papers: The Clifford-cyclotomic group and Euler-Poincar\'e…

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…

Sarnak's conjecture in quantum computing concerns when the groups $\operatorname{PU}_2$ and $\operatorname{PSU}_2$ over cyclotomic rings $\mathbb{Z}[\zeta_n, 1/2]$ with $\zeta_n=e^{2\pi i/n}$, $4|n$, are generated by the Clifford-cyclotomic…

Peres/Mermin arguments about no-hidden variables in quantum mechanics are used for displaying a pair (R, S) of entangling Clifford quantum gates, acting on two qubits. From them, a natural unitary representation of Coxeter/Weyl groups W(D5)…

One of the main goals of these notes is to explain how rotations in reals^n are induced by the action of a certain group, Spin(n), on reals^n, in a way that generalizes the action of the unit complex numbers, U(1), on reals^2, and the…

Based on a presentation of $\mathcal{C}_n$ and the help of [GAP], we construct the character table of the Clifford group $\mathcal{C}_n$ for $n=1,2,3$. As an application, we can efficiently decompose the (higher power of) tensor product of…

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…

A parametrization, given by the Euler angles, of Hermitian matrix generators of even and odd-degenerate Clifford algebras is constructed by means of the Kronecker product of a parametrized version of Pauli matrices and by the identification…

We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…

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…

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

Let $n \geq 1$ be an odd integer. We construct an anticyclotomic Euler system for certain cuspidal automorphic representations of unitary groups with signature $(1, 2n-1)$.

The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates…

We deduce the periodicity 8 for the type of $Pin$ and $Spin$ representations of the orthogonal groups $O(n)$ from simple combinatorial properties of the finite Clifford groups generated by the gamma matrices. We also include the case of…

The non commuting matrix elements of matrices from quantum group $GL_q(2;C)$ with $q\equiv \omega $ being the $n$-th root of unity are given a representation as operators in Hilbert space with help of $C_4^{(n)}$ generalized Clifford…

The Standard Model of particle physics is derived from first principles from the free Dirac Lagrangian in 8-dimensional spacetime. Motivated by second quantization arguments, we embed the 4-dimensional Clifford algebra of the Dirac…

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.…

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…

The Clifford group is the quotient of the normalizer of the Weyl-Heisenberg group in dimension $d$ by its centre. We prove that when $d$ is not prime the Clifford group is not a group unitary $2$-design. Furthermore, we prove that the…

We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra…