X iv :2 11 1. 13 67 8v 2 [ qu an tph ] 1 9 Ju n 20 22 Approximate 3-designs and partial decomposition of the Clifford group representation using transvections Tanmay Singal∗ Institute of Physics,… Expand

It can be easily seen that, up to multiplication by a Clifford, every third level unitary is supported on a maximal commutative subgroup of the Pauli group, which implies the generalized semi-Clifford conjecture, proven by Beigi and Shor (2010).Expand

2021 IEEE Global Communications Conference (GLOBECOM)

2021

TLDR

A fast algorithm is provided that decomposes any Clifford gate as a minimal product of Clifford transvections and can be directly used for computing the support of any given Clifford gate.Expand

A fast algorithm is provided that decomposes any Clifford gate as a minimal product of Clifford transvections and can be directly used for finding all Pauli matrices that commute with any given Clifford gate.Expand

Abstract We give an intrinsic criterion to tell whether a reflection factorization in the general linear group is reduced, and give a formula for computing reflection length in the general affine… Expand

Let O(V,f) be the orthogonal group, where dim V is finite and f is a nonsingular symmetric bilinear form. Let K = GF(3) be the coordinate field. Let π be an element in the group G which is generated… Expand

This paper is concerned with the presentation of certain elements of the group SL(n, K) as products of a minimal number of transvections. To explain the terminology, let V be an n-dimensional left… Expand