MétaCan
Menu
Back to cohort
Record W2511875207 · doi:10.1063/1.5003015

Almost all multipartite qubit quantum states have trivial stabilizer

2017· article· en· W2511875207 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Mathematical Physics · 2017
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of Calgary
FundersCanadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of CanadaAustrian Science Fund
KeywordsMultipartiteQubitQuantumMathematicsStabilizer (aeronautics)Quantum mechanicsPhysicsQuantum entanglement

Abstract

fetched live from OpenAlex

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.828
Threshold uncertainty score0.572

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.041
GPT teacher head0.306
Teacher spread0.265 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it