Related papers: How to efficiently select an arbitrary Clifford gr…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

We present two deterministic algorithms to approximate single-qutrit gates. These algorithms utilize the Clifford + $\mathbf{R}$ group to find the best approximation of diagonal rotations. The first algorithm exhaustively searches over the…

We propose an algebraic formulation for two distinct quantum algorithms: a quantum classification algorithm and a quantum search algorithm with a non-uniform initial distribution, both based on Clifford algebras and spinorial…

A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

In this paper we consider some Lie groups in complexified Clifford algebras. Using relations between operations of conjugation in Clifford algebras and matrix operations we prove isomorphisms between these groups and classical matrix groups…

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 consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…

Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

We present a simple but general framework for constructing quantum circuits that implement the multiply-controlled unitary $\text{Select}(H) \equiv \sum_\ell |\ell\rangle\langle\ell|\otimes H_\ell$, where $H = \sum_\ell H_\ell$ is the…

When facing a very large stream of data, it is often desirable to extract most important statistics online in a short time and using small memory. For example, one may want to quickly find the most influential users generating posts online…

Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle…

We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum…

We formulate generalizations of Pauli's theorem on the cases of real and complex Clifford algebras of even and odd dimensions. We give analogues of these theorems in matrix formalism. Using these theorems we present an algorithm for…

We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…

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

We discuss a Clifford algebra framework for discrete symmetry groups (such as reflection, Coxeter, conformal and modular groups), leading to a surprising number of new results. Clifford algebras allow for a particularly simple description…