Quick Navigation
Topics
Quantum Algorithms
On character table of Clifford groups
arXiv
Authors: Chin-Yen Lee, Wei-Hsuan Yu, Yung-Ning Peng, Ching-Jui Lai
Year
2023
Paper ID
54434
Status
Preprint
Abstract Read
~2 min
Abstract Words
142
Citations
N/A
Abstract
Based on a presentation of mathcal{C}n and the help of [GAP], we construct the character table of the Clifford group mathcal{C}n 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 [HWW, WF] and reveal some new phenomena. We prove that when n geq 3, (1) the trivial character is the only linear character for mathcal{C}n and hence mathcal{C}n equals to its commutator subgroup, (2) the n-qubit Pauli group mathcal{P}n is the only proper non-trivial normal subgroup of mathcal{C}n, (3) the matrix representation mathcal{M}2n is a faithful representation for mathcal{C}n. As a byproduct, we give a presentation of the finite symplectic group Sp(2n,2) in terms of generators and relations.
Why This Paper Matters
- It adds a 2023 reference point for readers tracking recent quantum research.
- Based on a presentation of mathcalCn and the help of [GAP], we construct the character table of the Clifford group mathcalCn for n=1,2,3.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.