Approximate 3-designs and partial decomposition of the Clifford group representation using transvections
arXiv:2111.13678
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. Also, the scheme implements an asymptotic unitary -design with the following convergence rate: it has to be sampled times to be an -approximate unitary -design. Since transvection Cliffords are a conjugacy class of the Clifford group, the eigenspaces of the scheme's quantum channel coincide with the irreducible invariant subspaces of the adjoint representation of the Clifford group. Some of the subrepresentations we obtain are the same as were obtained in J. Math. Phys. 59, 072201 (2018), whereas the remaining are new invariant subspaces. Thus we obtain a partial decomposition of the adjoint representation for copies for the Clifford group. Thus, aside from providing a scheme for the implementation of unitary -design, this work is of interest for studying representation theory of the Clifford group, and the potential applications of this topic. The paper ends with open questions regarding the scheme and representation theory of the Clifford group.
arXiv commentA misconception in the introduction was identified and has been edited out. Remark 7 has been edited to better explain why the scheme is optimal. Multiple lemmas have been added in the appendix to establish the equivalence of a subrepresenation with one given in J. Math. Phys. 59, 072201 (2018). 32 pages + 66 pages in appendices; comments and suggestions are welcome
References in corpus (18)
- Black holes as mirrors: quantum information in random subsystems
- Quantum computation with ions in thermal motion
- The foundations of statistical mechanics from entanglement: Individual states vs. averages
- Randomized Benchmarking of Quantum Gates
- Demonstration of a small programmable quantum computer with atomic qubits
- Foundation of Statistical Mechanics under experimentally realistic conditions
- Scalable Noise Estimation with Random Unitary Operators
- Towards the fast scrambling conjecture
- Characterization of addressability by simultaneous randomized benchmarking
- Estimating the Coherence of Noise
- Multiqubit Clifford groups are unitary 3-designs
- Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
- Efficient Arbitrary Simultaneously Entangling Gates on a trapped-ion quantum computer
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Compiling quantum algorithms for architectures with multi-qubit gates
- Unconditionally Secure Key Distribution In Higher Dimensions By Depolarization
- Decoupling with unitary approximate two-designs
- From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters