Related papers: On Groups in the Qubit Clifford Hierarchy
In this paper we present new formulas, which represent commutators and anticommutators of Clifford algebra elements as sums of elements of different ranks. Using these formulas we consider subalgebras of Lie algebras of pseudounitary…
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous polynomials degree by degree and construct…
Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…
We introduce unitary-gate randomized benchmarking (URB) for qudit gates by extending single-and multi-qubit URB to single- and multi-qudit gates. Specifically, we develop a qudit URB procedure that exploits unitary 2-designs. Furthermore,…
Recently an algorithm has been constructed that shows the binary icosahedral group $\2I$ together with a $T$-like gate forms the most efficient single-qubit universal gate set. To carry out the algorithm fault tolerantly requires a code…
In this paper we start from a basic notion of process, which we structure into two groupoids, one orthogonal and one symplectic. By introducing additional structure, we convert these groupoids into orthogonal and symplectic Clifford…
This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…
Let $n\geq 8$ be divisible by 4. The Clifford-cyclotomic gate set $\mathcal{G}_n$ is the universal gate set obtained by extending the Clifford gates with the $z$-rotation $T_n = \mathrm{diag}(1,\zeta_n)$, where $\zeta_n$ is a primitive…
Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be…
Quantum error-correcting codes are essential to the implementation of fault-tolerant quantum computation. Homological products of classical codes offer a versatile framework for constructing quantum error-correcting codes with desirable…
We study a sequence of quantum gates in finite-dimensional Hilbert spaces given by the normalized eigenvectors of the unitary operators. The corresponding sequence of the Hamilton operators is also given. From the Hamilton operators we…
We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. In particular, we derive formulas for evaluation, composition, and inversion. Our results…
An algebraic description of basic discrete symmetries (space inversion P, time reversal T, charge conjugation C and their combinations PT, CP, CT, CPT) is studied. Discrete subgroups {1,P,T,PT} of orthogonal groups of multidimensional…
For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. However, many of the necessary qutrit gates in these…
Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…
We define a general notion of centrally $\Gamma$-graded sets and groups and of their graded products, and prove some basic results about the corresponding categories: most importantly, they form braided monoidal categories. Here, $\Gamma$…
It is shown how to construct *-homomorphic quantum stochastic Feller cocycles for certain unbounded generators, and so obtain dilations of strongly continuous quantum dynamical semigroups on C* algebras; this generalises the construction of…
We define a normal form for Clifford circuits, and we prove that every Clifford operator has a unique normal form. Moreover, we present a rewrite system by which any Clifford circuit can be reduced to normal form. This yields a presentation…
This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal $Z$-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize…
We introduce a concept of an embedding of a quadratic space in an associative algebra. The general properties of such embeddings are analyzed by linking it to the Clifford algebra. Conversely, there isa simple description of the standard…