Related papers: The Clifford group forms a unitary 3-design

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…

It is shown that classical Clifford algebras are group algebras of cyclic subgroups of arrowy rermutations. It is established that Euclidean 3-space, Pauli and Dirac algebras and groups of global guage transformations are corollary from the…

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…

This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

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 problem of constructing strong approximate unitary $k$-designs on $D$-dimensional grids (and more generally on Cartesian products of graphs), building on the work of Schuster et al. arXiv:2509.26310 which establishes strong…

We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n-qubit Pauli group. Analyzing the structure of the Pauli group's centralizer, also known as the…

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 investigate the construction and properties of Clifford algebras by a similar manner as our previous construction of the octonions, namely as a twisting of group algebras of Z_2^n by a cocycle. Our approach is more general than the usual…

Albuquerque and Majid have shown how to view Clifford algebras $\cl_{p,q}$ as twisted group rings whereas Chernov has observed that Clifford algebras can be viewed as images of group algebras of certain 2-groups modulo an ideal generated by…

We give an algorithm which produces a unique element of the Clifford group $\mathcal{C}_n$ on $n$ qubits from an integer $0\le i < |\mathcal{C}_n|$ (the number of elements in the group). The algorithm involves $O(n^3)$ operations. It is a…

Random quantum circuits are proficient information scramblers and efficient generators of randomness, rapidly approximating moments of the unitary group. We study the convergence of local random quantum circuits to unitary $k$-designs.…

We introduce magic-augmented Clifford circuits -- architectures in which Clifford circuits are preceded and/or followed by constant-depth circuits of non-Clifford (``magic") gates -- as a resource-efficient way to realize approximate…

We define and study the ternary analogues of Clifford algebras. It is proved that the ternary Clifford algebra with $N$ generators is isomorphic to the subalgebra of the elements of grade zero of the ternary Clifford algebra with $N+1$…

The Clifford spectrum is a form of joint spectrum for noncommuting matrices. This theory has been applied in photonics, condensed matter and string theory. In applications, the Clifford spectrum can be efficiently approximated using…

We provide a generalized definition for the quantized Clifford algebra introduced by Hayashi using another parameter $k$ that we call the twist. For a field of characteristic not equal to $2$, we provide a basis for our quantized Clifford…

A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be…

In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…

We construct $\varepsilon$-approximate unitary $k$-designs on $n$ qubits in circuit depth $O(\log k \log \log n k / \varepsilon)$. The depth is exponentially improved over all known results in all three parameters $n$, $k$, $\varepsilon$.…