Related papers: Pauli Automorphisms, Clifford Groups, and Local Cl…
Universal coverings of the orthogonal groups and their extensions are studied in terms of Clifford-Lipschitz groups. An algebraic description of basic discrete symmetries (space inversion $P$, time reversal $T$, charge conjugation $C$ and…
In these lectures, we discuss some well-known facts about Clifford algebras: matrix representations, Cartan's periodicity of 8, double coverings of orthogonal groups by spin groups, Dirac equation in different formalisms, spinors in $n$…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were…
A map on a group into itself is called a local automorphism if at any two points of the group, it can be interpolated by an automorphism of that group. In this paper we investigate the question of how local automorphisms of some classical…
Generalized Pauli's theorem, proved by D. S. Shirokov for two sets of anticommuting elements of a real or complexified Clifford algebra of dimension $2^n$, is extended to the case, when both sets of elements depend smoothly on points of…
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and…
In this paper we study Clifford and harmonic analysis on some conformal flat spin manifolds. In particular we treat manifolds that can be parametrized by $U / \Gamma$ where $U$ is a simply connected subdomain of either $S^{n}$ or $R^{n}$…
We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators…
The Pauli matrices are a set of three 2x2 complex Hermitian, unitary matrices. In this article, we investigate the relationships between certain roots of the Pauli matrices and how gates implementing those roots are used in quantum…
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…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2…
Division algebras have demonstrated their utility in studying non-associative algebras and their connection to the Standard Model through complex Clifford algebras. This article focuses on exploring the connection between these complex…
We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators.…
We review Bacry and Levy-Leblond's work on possible kinematics as applied to 2-dimensional spacetimes, as well as the nine types of 2-dimensional Cayley-Klein geometries, illustrating how the Cayley-Klein geometries give homogeneous…
Galois qudits are $q$-dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field $\mathbb{F}_q$. They differ from the more familiar modular qudit, which are the same quantum system but whose choice…
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more…
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}$…
Clifford theory establishes a relation between the representation theory of a finite group and its normal subgroups. In this paper, we establish the Clifford theory for the modular representations of finite groups. The proofs are based on…