Related papers: Clifford circuits over non-cyclic abelian groups

We study the notion of $\Gamma$-graded commutative algebra for an arbitrary abelian group $\Gamma$. The main examples are the Clifford algebras already treated by Albuquerque and Majid. We prove that the Clifford algebras are the only…

With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error correction can be carried out using simple Gaussian operations. Still, non-Clifford gates, required for universality, require non-Gaussian elements. In their…

Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It…

We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal…

We translate the action of local Clifford operations on graph states into transformations on their associated graphs - i.e. we provide transformation rules, stated in purely graph theoretical terms, which completely characterize the…

We develop a general theory of Clifford algebras for finite morphisms of schemes and describe applications to the theory of Ulrich bundles and connections to period-index problems for curves of genus 1.

Albuquerque and Majid have shown how to view Clifford algebras $\cl_{p,q}$ as twisted group rings whereas Chernov has observed that Clifford algebras can be viewed as images of group algebras of certain 2-groups modulo an ideal generated by…

This is a note from a series of lectures at Encuentro Colombiano de Computacion Cuantica, Universidad de los Andes, Bogota, Colombia, 2015. The purpose is to introduce additive quantum error correcting codes, with emphasis on the use of…

In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies…

Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an…

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…

There have been significant recent advances in constructing theoretical and practical quantum error correcting codes that function well as quantum memories; however, performing fault-tolerant logical gates on these codes is less studied,…

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…

Clifford algebras are naturally associated with quadratic forms. These algebras are Z_2-graded by construction. However, only a Z_n-gradation induced by a choice of a basis, or even better, by a Chevalley vector space isomorphism Cl(V) <->…

Here is discussed generalization of Clifford algebras, l^n-dimensional Weyl-Clifford algebras T(n,l) with n generators t_k satisfying equation $(\sum_{k=1}^n a_k t_k)^l = \sum_{k=1}^n a_k^l$. It is originated from two basic and well known…

The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…

The Clifford group associated with a finite abelian group gives rise to a natural extension by the corresponding symplectic group. We prove that this extension splits as a semidirect product if and only if the group order is not divisible…

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

We establish for smooth projective real curves the equivalent of the classical Clifford inequality known for complex curves. We also study the cases when equality holds.

After a brief discussion of the computational complexity of Clifford algebras, we present a new basis for even Clifford algebra Cl(2m) that simplifies greatly the actual calculations and, without resorting to the conventional matrix…