Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2309.14850 · Journal of Mathematical Physics

On character table of Clifford groups

Chin-Yen Lee, Wei-Hsuan Yu, Yung-Ning Peng, Ching-Jui Lai

Published Feb 1, 2025• 5 citations
arXivHTMLPDF

Abstract

Based on a presentation of Cn and the help of [The GAP Group 2022, https://www.gap-system.org] we construct the character table of the Clifford group Cn for n = 1, 2, 3. As an application, we can efficiently decompose the (higher power of) tensor product of the matrix representation in those cases. Our results recover some known results in Helsen et al. [J. Math. Phys. 59, 072201 (2018)] and Wallman and Flammia [New J. Phys. 16(10), 103032 (2014)] and reveal some new phenomena. We prove that when n ≥ 3, (1) the trivial character is the only linear character for Cn and hence Cn equals to its commutator subgroup, (2) the n-qubit Pauli group Pn is the only proper non-trivial normal subgroup of Cn, (3) the matrix representation M2n is a faithful representation for Cn. As a byproduct, we give a presentation of the finite symplectic group Sp(2n, 2) in terms of generators and relations.

DOI
10.1063/5.0204167

Related papers

Representations of the multi-qubit Clifford group

Jonas Helsen, Joel J. Wallman, Stephanie Wehner

The q-qubit Clifford group, that is, the normalizer of the q-qubit Pauli group in U(2q), is a fundamental structure in quantum information with a wide variety of applications. We characterize all irreducible subrepresentations of the two-copy representation φ⊗2 of the Clifford group on the two-fold tensor product of the space of linear operators M2q⊗2. In the companion paper [Helsen et al., e-print arXiv:1701.04299 (2017)], we apply this result to improve the statistics of randomized benchmarking, a method for characterizing quantum systems.

arXiv:1609.08188•Journal of Mathematical Physics•Jul 1, 2018•35 citations

Generalized Clifford groups and simulation of associated quantum circuits

Stephen R. L. Clark, Richard Jozsa, Noah Linden

Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup $G$ of $U(d)$. In particular we seek $G$ such that $G\otimes G$ has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case $d = 2$ we exhaustively treat all finite irreducible subgroups of $U(2)$ and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups generated by X and the $n^{\rm th}$ root of $Z$ for $n \in \N$.

arXiv:quant-ph/0701103•Quantum Information and Computation•Jan 1, 2008•29 citations

The Clifford theory of the n-qubit Clifford group

Kieran Mastel

The n-qubit Pauli group and its normalizer, the n-qubit Clifford group, have applications in quantum error correction and device characterization. Recent applications have used the representation theory of the Clifford group. We apply the tools of (the coincidentally named) Clifford theory to examine the representation theory of the Clifford group using the much simpler representation theory of the Pauli group. We find an unexpected correspondence between irreducible characters of the n-qubit Clifford group and those of the (n+1)-qubit Clifford group.

arXiv:2307.05810•Journal of Mathematical Physics•Feb 1, 2026•13 citations

Structure of Clifford groups of composite finite quantum systems

Miroslav Korbelář, Jiří Tolar

In this paper the Clifford groups of general multipartite quantum systems with configuration space $\mathbb{Z}_{n_1}\oplus\cdots\oplus\mathbb{Z}_{n_k}$, $k\geq 1$ are studied. It is known that the Clifford group is a natural semidirect product provided the dimension $N=n_1\cdots n_k$ of the corresponding Hilbert space is an odd number. For even $N$ special results on the Clifford groups are scattered in the mathematical literature, but they do not concern the semidirect product structure. Using the relation of generators of the associated symplectic group $\mathrm{Sp}_{[n_1,\dots,n_k]}$ we prove that for even $N=n_1\cdots n_k$ both Clifford group and the projective Clifford group are natural semidirect products if and only if $N$ is not divisible by four.

math-phCross-listedarXiv:2606.08215•Journal of Physics A Mathematical and Theoretical•Jun 9, 2026•0 citations

Duality theory for Clifford tensor powers

Felipe Montealegre‐Mora, David Gross

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 η-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 η 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.

arXiv:2208.01688•Journal of Mathematical Physics•Sep 1, 2025•9 citations

Classification of the subgroups of the two-qubit Clifford group

Eric Kubischta, Ian Teixeira

We perform a complete classification of all 56 subgroups of the two-qubit Clifford group containing the two-qubit Pauli group. We provide generators for these groups using gates familiar to the quantum information community and we reference these groups against the group libraries provided in GAP. We also list several families of groups in higher levels of the two-qubit Clifford hierarchy.

arXiv:2409.14624•Journal of Mathematical Physics•Dec 1, 2025•6 citations
Based on a presentation of Cn and the help of [The GAP Group 2022, https://www.gap-system.org] we construct the character table of the Clifford group Cn for n = 1, 2, 3. As an application, we can efficiently decompose the (higher power of) tensor product of the matrix representation in those cases. Our results recover some known results in Helsen et al. [J. Math. Phys. 59, 072201 (2018)] and Wallman and Flammia [New J. Phys. 16(10), 103032 (2014)] and reveal some new phenomena. We prove that when n ≥ 3, (1) the trivial character is the only linear character for Cn and hence Cn equals to its commutator subgroup, (2) the n-qubit Pauli group Pn is the only proper non-trivial normal subgroup of Cn, (3) the matrix representation M2n is a faithful representation for Cn. As a byproduct, we give a presentation of the finite symplectic group Sp(2n, 2) in terms of generators and relations.
The q-qubit Clifford group, that is, the normalizer of the q-qubit Pauli group in U(2q), is a fundamental structure in quantum information with a wide variety of applications. We characterize all irreducible subrepresentations of the two-copy representation φ⊗2 of the Clifford group on the two-fold tensor product of the space of linear operators M2q⊗2. In the companion paper [Helsen et al., e-print arXiv:1701.04299 (2017)], we apply this result to improve the statistics of randomized benchmarking, a method for characterizing quantum systems.
Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup GGG of U(d)U(d)U(d). In particular we seek GGG such that G⊗GG\otimes GG⊗G has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case d=2d = 2d=2 we exhaustively treat all finite irreducible subgroups of U(2)U(2)U(2) and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups generated by X and the nthn^{\rm th}nth root of ZZZ for n∈Nn \in \Nn∈N.
The n-qubit Pauli group and its normalizer, the n-qubit Clifford group, have applications in quantum error correction and device characterization. Recent applications have used the representation theory of the Clifford group. We apply the tools of (the coincidentally named) Clifford theory to examine the representation theory of the Clifford group using the much simpler representation theory of the Pauli group. We find an unexpected correspondence between irreducible characters of the n-qubit Clifford group and those of the (n+1)-qubit Clifford group.
In this paper the Clifford groups of general multipartite quantum systems with configuration space Zn1⊕⋯⊕Znk\mathbb{Z}_{n_1}\oplus\cdots\oplus\mathbb{Z}_{n_k}Zn1​​⊕⋯⊕Znk​​, k≥1k\geq 1k≥1 are studied. It is known that the Clifford group is a natural semidirect product provided the dimension N=n1⋯nkN=n_1\cdots n_kN=n1​⋯nk​ of the corresponding Hilbert space is an odd number. For even NNN special results on the Clifford groups are scattered in the mathematical literature, but they do not concern the semidirect product structure. Using the relation of generators of the associated symplectic group Sp[n1,…,nk]\mathrm{Sp}_{[n_1,\dots,n_k]}Sp[n1​,…,nk​]​ we prove that for even N=n1⋯nkN=n_1\cdots n_kN=n1​⋯nk​ both Clifford group and the projective Clifford group are natural semidirect products if and only if NNN is not divisible by four.
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 η-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 η 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.