Related papers: Translating between the roots of the identity in q…
The construction of unitary operator bases in a finite-dimensional Hilbert space is reviewed through a nonstandard approach combinining angular momentum theory and representation theory of SU(2). A single formula for the bases is obtained…
We revisit the notion of interacting Frobenius Hopf algebras for ZX-calculus in quantum computing, with focus on allowing the algebras to be noncommutative and coalgebras to be noncocommutative. We introduce the notion of *-structures in…
The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of…
We consider the problem of $\textit{subgroup testing}$ for a quantum circuit $C$: given access to $C$, determine whether it implements a unitary that is $a$-close or $b$-far from a subgroup $\mathcal{G}$ of the unitary group. It encompasses…
We give a finite presentation by generators and relations for the group O_n(Z[1/2]) of n-dimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentation for the group of n-dimensional orthogonal matrices of the…
Quantum computation started to become significant field of studies as it hold great promising towards the upgrade of our current computational power. Studying the evolution of quantum states serves as a good fundamental in understanding…
A set of generators of generalized Pauli matrices play a crucial role in quantum computation based on n level systems of an atom. In this paper we show how to construct them by making use of Rabi oscillations. We also construct the…
We introduce grading on certain finite dimensional simple Lie superalgebras of type $P(t)$ by elementary abelian 2-group. This grading gives rise to Pauli matrices and is a far generalization of $(\mathbb Z_2\times \mathbb Z_2)$-grading on…
We derive a basis for the vector space of bounded operators acting on a $d$-dimensional system Hilbert space $C^d$. In the context of quantum computation the basis elements are identified as the generalised Pauli matrices - the error…
This is a presentation of recent work on quantum permutation groups. Contains: a short introduction to operator algebras and Hopf algebras; quantum permutation groups, and their basic properties; diagrams, integration formulae, asymptotic…
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and random compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into…
Quantum computations that involve only Clifford operations are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…
We study non-associative twisted group algebras over $(\Z_2)^n$ with cubic twisting functions. We construct a series of algebras that extend the classical algebra of octonions in the same way as the Clifford algebras extend the algebra of…
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely…
The group of automorphisms of Euclidean (embedded in $\mathbb{R}^n$) dense lattices such as the root lattices $D_4$ and $E_8$, the Barnes-Wall lattice $BW_{16}$, the unimodular lattice $D_{12}^+$ and the Leech lattice $\Lambda_{24}$ may be…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
Unitary fusion categories formalise the algebraic theory of topological quantum computation. These categories come naturally enriched in a subcategory of the category of Hilbert spaces, and by looking at this subcategory, one can identify a…
It is known that every (single-qudit) Clifford operator maps the full set of generalized Pauli matrices (GPMs) to itself under unitary conjugation, which is an important quantum operation and plays a crucial role in quantum computation and…