Related papers: How to efficiently select an arbitrary Clifford gr…
Clifford algebras are used for constructing spin groups, and are therefore of particular importance in the theory of quantum mechanics. But the spin group is not the only subgroup of the Clifford algebra. An algebraist's perspective on…
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
The quantum Schur transform maps the computational basis of a system of $n$ qudits onto a \textit{Schur basis}, which spans the minimal invariant subspaces of the representations of the unitary and the symmetric groups acting on the state…
Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estimation is quite limited compared with the qubit setting. Here…
We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Clifford gates, our…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
We describe the structure of the $n$-qubit Clifford group $C_n$ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we…
An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters, and pairwise…
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous polynomials degree by degree and construct…
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…
We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU($n$), a naive brute-force search requires a computational…
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently…
Let $G$ be a finite group, $N$ a normal subgroup of $G$, and $k$ a field of characteristic $p>0$. In this paper, we formulate the brick version of Clifford's theorem under suitable assumptions and prove it by using the theory of wide…
Let $A$ be an arbitrary symmetrizable Cartan matrix of rank $r$, and ${\bf n}={\bf n_+}$ be the standard maximal nilpotent subalgebra in the Kac-Moody algebra associated with $A$ (thus, ${\bf n}$ is generated by $E_1,\ldots,E_r$ subject to…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
The paper is devoted to projective Clifford groups of quantum $N$-dimensional systems. Clearly, Clifford gates allow only the simplest quantum computations which can be simulated on a classical computer (Gottesmann-Knill theorem). However,…
CLIFFORD performs various computations in Grassmann and Clifford algebras. It can compute with quaternions, octonions, and matrices with entries in Cl(B) - the Clifford algebra of a vector space V endowed with an arbitrary bilinear form B.…
We assume the permutation $\pi$ is given by an $n$-element array in which the $i$-th element denotes the value $\pi(i)$. Constructing its inverse in-place (i.e. using $O(\log{n})$ bits of additional memory) can be achieved in linear time…
We consider a multi-pivot QuickSort algorithm using $K\in\mathbb{N}$ pivot elements to partition a nonsorted list into $K+1$ sublists in order to proceed recursively on these sublists. For the partitioning stage, various strategies are in…
Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the…