MétaCan
Menu
Back to cohort
Record W3098843617

On polynomial invariants of several qubits

2013· article· en· W3098843617 on OpenAlexaff
Andreas Osterloh

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsMathematicsQubitQuantum entanglementMultipartiteInvariant theoryConnection (principal bundle)PolynomialIdeal (ethics)Discrete mathematicsPure mathematicsCombinatoricsAlgebra over a fieldQuantum mechanicsPhysicsQuantumMathematical analysisGeometry
DOInot available

Abstract

fetched live from OpenAlex

Abstract. It is a recent observation that entanglement classification for qubits is closely related to local SL(2,C)-invariants including the invariance under qubit permutations [1, 2, 3], which has been termed SL ∗ invariance. In order to single out the SL ∗ invariants, we analyze the SL(2,C)-invariants of four resp. five qubits and decompose them into irreducible modules for the symmetric group S4 resp. S5 of qubit permutations. A classifying set of measures of genuine multipartite entanglement is given by the ideal of the algebra of SL ∗-invariants vanishing on arbitrary product states. We find that low degree homogeneous components of this ideal can be constructed in full by using the approach introduced in Refs. [2, 4]. Our analysis highlights an intimate connection between this latter procedure and the standard methods to create invariants, such as the Ω-process [5]. As the degrees of invariants increase, the alternative method proves to be particularly efficient.

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 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.000
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.837
Threshold uncertainty score0.951

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.006
GPT teacher head0.189
Teacher spread0.184 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Quick stats

Citations59
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicQuantum Information and CryptographyFrench-language works237,207