Almost all multipartite qubit quantum states have trivial stabilizer
Bibliographic record
Abstract
The stabilizer group of an n-qubit state |ψ is the set of all matrices of the form g=g1⊗⋯⊗gn, with g1,…,gn being any 2 × 2 invertible complex matrices that satisfy g|ψ=|ψ. We show that for 5 or more qubits, except for a set of states of zero measure, the stabilizer group of multipartite entangled states is trivial, that is, containing only the identity element. We use this result to show that for 5 or more qubits, the action of deterministic local operations and classical communication (LOCC) can almost always be simulated simply by local unitary (LU) operations. This proves that almost all n-qubit states with n≥5 can neither be reached nor be converted into any other (n-partite entangled), LU-inequivalent state via deterministic LOCC. We also find a simple and elegant expression for the maximal probability to convert one multi-qubit entangled state to another for this generic set of states.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".