Related papers: Clifford operators in SU(N)1; N not odd prime

We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[1/sqrt(2),i]. Moreover, we show that one ancilla always suffices. These facts were…

A variety of physical phenomena, such as amplification, absorption, and radiation, can be effectively described using non-Hermitian operators. However, the introduction of non-uniform non-Hermiticity can lead to the formation of exceptional…

The Clifford hierarchy is a fundamental structure in quantum computation, classifying unitary operators based on their commutation relations with the Pauli group. Despite its significance, the mathematical structure of the hierarchy is not…

Given two parallelisms of a projective space we describe a construction, called blending, that yields a (possibly new) parallelism of this space. For a projective double space $(\mathbb{P},\parallel_\ell,\parallel_r)$ over a quaternion skew…

We give details of a formerly known relation between ternary quadratic forms and quaternion orders through the even Clifford algebra. Based on this and classifications of ternary quadratic forms we give a completely explicit classification…

The theory of representations of Clifford algebras is extended to employ the division algebra of the octonions or Cayley numbers. In particular, questions that arise from the non-associativity and non-commutativity of this division algebra…

We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra…

We consider the problem of Clifford testing, which asks whether a black-box $n$-qubit unitary is a Clifford unitary or at least $\varepsilon$-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this…

We introduce the so-called Clifford-Gegenbauer polynomials in the framework of Dunkl operators, as well on the unit ball B(1), as on the Euclidean space $R^m$. In both cases we obtain several properties of these polynomials, such as a…

Formulas of Rodrigues-type for the Macdonald polynomials are presented. They involve creation operators, certain properties of which are proved and other conjectured. The limiting case of the Jack polynomials is discussed.

The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…

We give explicit formulas for all odd order differential intertwinors on the subbundle of the bundle of spinor-$k$-forms that are annihilated by the Clifford multiplication over the odd dimensional standard sphere. The Dirac and…

Even and odd q-deformed charge coherent states are constructed, their (over)completeness proved and their generation explored. A $D$-algebra realization of the SU$_q$(1,1) generators is given in terms of them. They are shown to exhibit…

Clifford-Legendre and Clifford-Gegenbauer polynomials are eigenfunctions of certain differential operators acting on functions defined on $m$-dimensional euclidean space ${\mathbb R}^m$ and taking values in the associated Clifford algebra…

When visualised as an operation on the Bloch sphere, the qubit "pi-over-eight" gate corresponds to one-eighth of a complete rotation about the vertical axis. This simple gate often plays an important role in quantum information theory,…

Non-stabilizer eigenstates of Clifford operators are natural candidates for endpoints of magic state distillation routines. We provide an explicit bestiary of all inequivalent non-stabilizer Clifford eigenstates for qutrits and ququints.…

We show that any $n$-qubit Clifford unitary can be implemented using at most $2n$ multi-qubit joint measurements. All the multi-qubit joint measurements used for implementing the Clifford unitary can be chosen to form at most two sets of…

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

This paper discusses the question of how to recognize whether an operad is E_n (ie. equivalent to the little n-cubes operad). A construction is given which produces many new examples of E_n operads. This construction is developed in the…

NOTE: PAPER WITHDRAWN (See Comments) The Clifford and Local Clifford groups for $d > 2$ dimensional systems have been topics of recent interest due to their applications in graph states, quantum codes, and possible applications in fast…