Related papers: Un-Weyl-ing the Clifford Hierarchy
Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary…
Symmetry groups are projectively represented in quantum mechanics, and crystalline symmetries are fundamental in condensed matter physics. Here, we systematically present a unified theory of quantum mechanical space groups from two…
This work reconsiders the holomorphic and anti-holomorphic Dirac operators of Hermitian Clifford analysis to determine whether or not they are the natural generalization of the orthogonal Dirac operator to spaces with complex structure. We…
Bell states and quantum teleportation play important roles in the study of quantum information and computation. But a comprehensive theoretical research on both of them remains to be performed. This work aims to investigate important…
The classical shadow estimation protocol is a noise-resilient and sample-efficient quantum algorithm for learning the properties of quantum systems. Its performance depends on the choice of a unitary ensemble, which must be chosen by a user…
We discuss how transformations in a three dimensional euclidean space can be described in terms of the Clifford algebra $\mathcal{C}\ell_{3,3}$ of the quadratic space $\mathbb{R}^{3,3}$. We show that this algebra describes in a unified way…
In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially…
The author's idea of {\it algebraic compositeness} of fundamental particles, allowing to understand the existence in Nature of three fermion generations, is revisited. It is based on two postulates. i) For all fundamental particles of…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may…
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…
This paper is divided in three parts. In the first part, I study the Clifford algebra associated to the hessian of a functional $f$ defined on an open subset of $\mathbb{R}^n$ \ and the Clifford algebra associated to the hessian of the…
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that these…
It shown that if a vector space carries commuting actions of two Clifford algebras, then the quadratic monomials using generators from either Clifford algebra determine a spinor representation of an orthogonal Lie algebra. Examples of this…
An important question of quantum information is to characterize genuinely quantum (beyond-Clifford) resources necessary for universal quantum computing. Here, we use the Pauli spectrum to quantify how magic, beyond Clifford, typical…
Galois qudits are $q$-dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field $\mathbb{F}_q$. They differ from the more familiar modular qudit, which are the same quantum system but whose choice…
We present a software library for the commutation of Pauli operators through quantum Clifford circuits, which is called Pauli tracking. Tracking Pauli operators allows one to reduce the number of Pauli gates that must be executed on quantum…
A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we…
Qudits with local dimension $d>2$ can have unique structure and uses that qubits ($d=2$) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group…
The Clifford group is the quotient of the normalizer of the Weyl-Heisenberg group in dimension $d$ by its centre. We prove that when $d$ is not prime the Clifford group is not a group unitary $2$-design. Furthermore, we prove that the…