Duality theory for Clifford tensor powers

Abstract

The representation theory of the Clifford group is playing an increasingly prominent role in quantum information theory, including in such diverse use cases as the construction of protocols for quantum system certification, quantum simulation, and quantum cryptography. In these applications, the tensor powers of the defining representation seem particularly important. The representation theory of these tensor powers is understood in two regimes. 1. For odd qudits in the case where the power t is not larger than the number of systems n: Here, a duality theory between the Clifford group and certain discrete orthogonal groups can be used to make fairly explicit statements about the occurring irreps (this theory is related to Howe duality and the eta-correspondence). 2. For qubits: Tensor powers up to t=4 have been analyzed on a case-by-case basis. In this paper, we provide a unified framework for the duality approach that also covers qubit systems. To this end, we translate the notion of rank of symplectic representations to representations of the qubit Clifford group, and generalize the eta correspondence between symplectic and orthogonal groups to a correspondence between the Clifford and certain orthogonal-stochastic groups. As a sample application, we provide a protocol to efficiently implement the complex conjugate of a black-box Clifford unitary evolution.

47 pages

References in corpus (20)

• Hudson's Theorem for finite-dimensional quantum systems
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Multiqubit Clifford groups are unitary 3-designs
• Wigner function negativity and contextuality in quantum computation on rebits
• Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
• Universal simulation of Hamiltonian dynamics for qudits
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Multipartite Entanglement in Stabilizer Tensor Networks
• Recovering quantum gates from few average gate fidelities
• Probabilistic exact universal quantum circuits for transforming unitary operations
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Permutation Symmetry Determines the Discrete Wigner Function
• Multi-qubit Randomized Benchmarking Using Few Samples
• An Ideal Characterization of the Clifford Operators
• Guaranteed recovery of quantum processes from few measurements
• Performance analysis of multi-shot shadow estimation
• Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
• Rank-deficient representations in the Theta correspondence over finite fields arise from quantum codes
• On character table of Clifford groups