MétaCan
Menu
Back to cohort
Record W4298263856 · doi:10.48550/arxiv.1406.0798

W-like states are not Necessary for Totally Correct Quantum Anonymous\n Leader Election

2014· preprint· en· W4298263856 on OpenAlexaff
Alexander Norton

Bibliographic record

VenuearXiv (Cornell University) · 2014
Typepreprint
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsMcGill University
Fundersnot available
KeywordsProtocol (science)State (computer science)Quantum stateQuantumComputationResource (disambiguation)Quantum computerComputer scienceMathematicsQuantum mechanicsPhysicsAlgorithmComputer networkMedicine

Abstract

fetched live from OpenAlex

I show that W-like entangled quantum states are not a necessary quantum\nresource for totally correct anonymous leader election protocols. This is\nproven by defining a symmetric quantum state that is n-partite SLOCC\ninequivalent to the W state, and then constructing a totally correct anonymous\nleader election protocol using this state. This result, which contradicts the\nprevious necessity result of D'Hondt and Panangaden, furthers our understanding\nof how non-local quantum states can be used as a resource for distributed\ncomputation.\n

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 imitation

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

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation 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.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.014
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0020.005
Scholarly communication0.0020.007
Open science0.0010.004
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.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.039
GPT teacher head0.192
Teacher spread0.153 · 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 source (direct Gemma or distilled Codex), 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

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207