• Corpus ID: 244709348

Approximate 3-designs and partial decomposition of the Clifford group representation using transvections

  title={Approximate 3-designs and partial decomposition of the Clifford group representation using transvections},
  author={Tanmay Singal and Min-Hsiu Hsieh},
X iv :2 11 1. 13 67 8v 1 [ qu an tph ] 2 6 N ov 2 02 1 Approximate 3-designs and partial decomposition of the Clifford group representation using transvections Tanmay Singal∗ Institute of Physics, Faculty of Physics, Astronomy and Informatics, Nicolaus Copernicus University, Grudziadzka 5/7, 87-100 Toruń, Poland Physics Division, National Center for Theoretical Sciences, Taipei 10617, Taiwan Department of Physics, National Taiwan University, No.1 Sec. 4., Roosevelt Road, Taipei 106, Taiwan… 


The generation of Sp(F2) by transvections
The Clifford group forms a unitary 3-design
  • Z. Webb
  • Mathematics
    Quantum Inf. Comput.
  • 2016
It is proved that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected and characterizing how well random Clifford elements approximateHaar- random unitaries.
Multiqubit Clifford groups are unitary 3-designs
Unitary $t$-designs are a ubiquitous tool in many research areas, including randomized benchmarking, quantum process tomography, and scrambling. Despite the intensive efforts of many researchers,
Approximate unitary 3-designs from transvection Markov chains
Unitary $t$-designs are probabilistic ensembles of unitary matrices whose first $t$ statistical moments match that of the full unitary group endowed with the Haar measure. In prior work, we showed
Schur–Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the
How to efficiently select an arbitrary Clifford group element
We give an algorithm which produces a unique element of the Clifford group on n qubits ( Cn ) from an integer 0≤i<Cn (the number of elements in the group). The algorithm involves O(n 3) operations
Evenly distributed unitaries: On the structure of unitary designs
We clarify the mathematical structure underlying unitary t-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any tth order polynomial over the design
Representations of the multi-qubit Clifford group
The Clifford group is a fundamental structure in quantum information with a wide variety of applications. We discuss the tensor representations of the $q$-qubit Clifford group, which is defined as
Exact and Approximate Unitary 2-Designs: Constructions and Applications
We consider an extension of the concept of spherical t-designs to the unitary group in order to develop a unified framework for analyzing the resource requirements of randomized quantum algorithms.
Kerdock Codes Determine Unitary 2-Designs
The design described here was originally discovered by Cleve et al. (2016), but the connection to classical codes is new, which significantly simplifies the description of the design and its translation to circuits.