The stabilizer for $n$-qubit symmetric states
Xian Shi

TL;DR
This paper investigates the stabilizer groups of n-qubit symmetric states, showing nontrivial stabilizers for small n, providing examples of states with trivial stabilizers, and confirming that for large diversity numbers, the stabilizer is trivial.
Contribution
It characterizes when n-qubit symmetric states have trivial stabilizer groups, extending previous results to include states with high diversity numbers.
Findings
Stabilizer groups are nontrivial for n ≤ 4.
Constructs classes of symmetric states with trivial stabilizers.
States with diversity number > 5 have trivial stabilizers.
Abstract
The stabilizer group for an -qubit state is the set of all invertible local operators (ILO) such that Recently, G. Gour \cite{GKW} presented that almost all -qubit state own a trivial stabilizer group when In this article, we consider the case when the stabilizer group of an -qubit symmetric pure state is trivial. First we show that the stabilizer group for an n-qubit symmetric pure state is nontrivial when . Then we present a class of -qubit symmetric states with the trivial stabilizer group. At last, we prove that an -qubit symmetric pure state owns a trivial stabilizer group when its diversity number is bigger than 5, which confirms the main result of \cite{GKW} partly.
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 Information and Cryptography · Spectral Theory in Mathematical Physics · Quantum Computing Algorithms and Architecture
