Related papers: Quantum gates and quantum algorithms with Clifford…
We present a quantum compilation algorithm that maps Clifford encoders, encoding maps for stabilizer quantum codes, to a unique graphical representation in the ZX calculus. Specifically, we develop a canonical form in the ZX calculus and…
The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby…
We describe a new method for the decomposition of an arbitrary $n$ qubit operator with entries in $\mathbb{Z}[i,\frac{1}{\sqrt{2}}]$, i.e., of the form $(a+b\sqrt{2}+i(c+d\sqrt{2}))/{\sqrt{2}^{k}}$, into Clifford+$T$ operators where $n\le…
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 consider the problem of synthesizing Clifford quantum circuits for devices with all-to-all qubit connectivity. We approach this task as a reinforcement learning problem in which an agent learns to discover a sequence of elementary…
In this paper, we study the problem of learning an unknown quantum circuit of a certain structure. If the unknown target is an $n$-qubit Clifford circuit, we devise an efficient algorithm to reconstruct its circuit representation by using…
Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Quantum multiparameter deformation of real Clifford algebras is proposed. The corresponding irreducible representations are found.
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group -a property that is essential…
The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, we present an introduction to the main…
We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
Given some group $G$ of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of $G$? We…
We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized…
We present the complete set of $N=1$, $D=4$ quantum algebras associated to massive superparticles. We obtain the explicit solution of these algebras realized in terms of unconstrained operators acting on the Hilbert space of superfields.…
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the…
Typically, quantum mechanics is thought of as a linear theory with unitary evolution governed by the Schr\"odinger equation. While this is technically true and useful for a physicist, with regards to computation it is an unfortunately…
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum circuits that can be simulated in polynomial time but still…
We report a study of the Majorana geometrical representation of a qutrit, where a pair of points on a unit sphere represents its quantum states. A canonical form for qutrit states is presented, where every state can be obtained from a…