Approximate 3-designs and partial decomposition of the Clifford group representation using transvections
Tanmay Singal, Min-Hsiu Hsieh

TL;DR
This paper presents a scheme for implementing an approximate unitary 3-design using transvections in the Clifford group, analyzes its convergence properties, and explores its implications for representation theory.
Contribution
It introduces a novel scheme for asymptotic unitary 3-designs via transvections and provides a partial decomposition of the Clifford group's adjoint representation.
Findings
The scheme converges to a unitary 3-design as the number of implementations increases.
Approximate 3-designs can be achieved with complexity scaling as O(m + log(1/ε)).
The scheme also implements an approximate 2-design with logarithmic complexity.
Abstract
We study a scheme to implement an asymptotic unitary 3-design. The scheme implements a random Pauli once followed by the implementation of a random transvection Clifford by using state twirling. Thus the scheme is implemented in the form of a quantum channel. We show that when this scheme is implemented times, then, in the limit, the overall scheme implements a unitary -design. This is proved by studying the eigendecomposition of the scheme: the eigenspace of the scheme coincides with that of an exact unitary -design, and the remaining eigenvalues are bounded by a constant. Using this we prove that the scheme has to be implemented approximately times to obtain an -approximate unitary -design, where is the number of qubits, and is the diamond-norm distance of the exact unitary -design.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advanced Electron Microscopy Techniques and Applications · Mathematical Approximation and Integration
