Related papers: Generators and relations for n-qubit Clifford oper…

We give a Clifford correspondence for an algebra A over an algebraically closed field, that is an algorithm for constructing some finite-dimensional simple A-modules from simple modules for a subalgebra and endomorphism algebras. This…

For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…

We study the commutation relations and normal ordering between families of operators on symmetric functions. These operators can be naturally defined by the operations of multiplication, Kronecker product, and their adjoints. As…

The Clifford group is the set of gates generated by controlled-Z gates, the phase gate and the Hadamard gate. We will say that a n-qubit state is a Clifford state if it can be prepared using Clifford gates. These states are known as the…

We derive a set of Clifford-algebraic formulas for two major nonlinear conformal transformations of the physical quantities related to Maxwell's equations. The superiority of these formulas over their vector-tensorial counterparts are…

Here I present a full list with all possibles products between the generators of the Clifford algebra in a four-dimensional spacetime. The resulting expressions turned out to be very simple and easy to deal with.

In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…

Any deformation of a Weyl or Clifford algebra can be realized through a change of generators in the undeformed algebra. q-Deformations of Weyl or Clifford algebrae that were covariant under the action of a simple Lie algebra g are…

As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate Grover's algorithm under a generalised quantum circuit model,…

We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…

Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer…

We conduct the first detailed analysis in quantum information of recently derived operator relations from the study of quantum one-way local operations and classical communications (LOCC). We show how operator structures such as operator…

We investigate stabilizer codes with carrier qudits of equal dimension $D$, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding…

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…

We discuss a certain class of absolutely irreducible group representations that behave nicely under the restriction to normal subgroups and subalgebras. These representations proved to be useful for the construction of abelian varieties…

We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided…

In this note, we prove the regularity of eta forms by the Clifford asymptotics. Then we generalize this result to the equivariant case.

It is shown that the generators of Clifford algebras behave as creation and annihilation operators for fermions and bosons. They can create extended objects, such as strings and branes, and can induce curved metric of our spacetime. At a…

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…

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…