Related papers: Translating between the roots of the identity in q…

We consider the algebra of N x N matrices as a reduced quantum plane on which a finite-dimensional quantum group H acts. This quantum group is a quotient of U_q(sl(2,C)), q being an N-th root of unity. Most of the time we shall take N=3; in…

The q-generalizations of the two fundamental statements of matrix algebra -- the Cayley-Hamilton theorem and the Newton relations -- to the cases of quantum matrix algebras of an "RTT-" and of a "Reflection equation" types have been…

We construct new families of spin chain Hamiltonians that are local, integrable and translationally invariant. To do so, we make use of the Clifford group that arises in quantum information theory. We consider translation invariant Clifford…

In this paper, we develop a Lie group theoretic approach for parametric representation of unitary matrices. This leads to develop a quantum neural network framework for quantum circuit approximation of multi-qubit unitary gates. Layers of…

We define a translation based cipher over an arbitrary finite field, and study the permutation group generated by the round functions of such a cipher. We show that under certain cryptographic assumptions this group is primitive. Moreover,…

We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…

The quantum permutation group of the set $X_n=\{1,..., n\}$ corresponds to the Hopf algebra $A_{aut}(X_n)$. This is an algebra constructed with generators and relations, known to be isomorphic to $\cc (S_n)$ for $n\leq 3$, and to be…

The teleportation model of quantum computation introduced by Gottesman and Chuang (1999) motivated the development of the Clifford hierarchy. Despite its intrinsic value for quantum computing, the widespread use of magic state distillation,…

This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. Generalizing the idea behind Pauli tableaux, we introduce a type system and lambda…

In this article we construct a large family of $R$-matrices for various extensions of small quantum groups by grouplike elements. The extensions are in correspondence to lattices between root and weight lattice and admit $R$-matrices in…

Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. Let $P$ be the transition matrix between the canonical basis and a PBW basis of ${\mathbf U}_q^-$. In the case ${\mathbf U}_q^-$ is symmetric, Antor gave a simple…

The quantum group SL_q(2,R) at roots of unity is introduced by means of duality pairings with the quantum algebra U_q(sl(2,R)). Its irreducible representations are constructed through the universal T-matrix. An invariant integral on this…

This paper describes an ACL2 interpreter for "netlists" describing quantum circuits. Several quantum gates are implemented, including the Hadamard gate H, which rotates vectors by 45 degrees, necessitating the use of irrational numbers, at…

Transformations on quantum states form a basic building block of every quantum information system. From photonic polarization to two-level atoms, complete sets of quantum gates for a variety of qubit systems are well known. For multi-level…

In this paper we use the recent developments in the representation theory of locally compact quantum groups, to assign, to each locally compact quantum group $\mathbb{G}$, a locally compact group $\tilde \mathbb{G}$ which is the quantum…

Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, omega^dagger H, and S. All of these gates have matrix entries in the ring Z[1/2,i], the smallest subring of the complex numbers containing 1/2 and i.…

We present an abstract model of quantum computation, the "Pauli Fusion" model, whose primitive operations correspond closely to generators of the ZX calculus (a formal graphical language for quantum computing). The fundamental operations of…

It is shown that ternary qubit trees with the same number of nodes can be transformed by the naturally defined sequence of Clifford gates into each other or into standard representation as 1D chain corresponding to Jordan-Wigner transform.

Let $K \langle X\rangle$ be the free associative algebra freely generated over the field $K$ by the countable set $X = \{x_1, x_2, \ldots\}$. If $A$ is an associative $K$-algebra, we say that a polynomial $f(x_1,\ldots, x_n) \in K \langle…

Hamiltonian simulation is a key quantum algorithm for modeling complex systems. To implement a Hamiltonian simulation, it is typically decomposed into a list of Pauli strings, each corresponds to an RZ rotation gate with many Clifford…