MétaCan
Menu
Back to cohort

Designing Codes around Interactions: The Case of a Spin

2021· article· en· W3026839285 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

VenuePhysical Review Letters · 2021
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversité de Sherbrooke
FundersNatural Sciences and Engineering Research Council of CanadaCanada First Research Excellence Fund
KeywordsQubitComputer scienceEncoding (memory)Clifford algebraSpin (aerodynamics)Angular momentumGaussianQuadratic equationSet (abstract data type)Quantum computerQuantumQuantum mechanicsTopology (electrical circuits)PhysicsMathematicsAlgebra over a fieldPure mathematicsCombinatorics

Abstract

fetched live from OpenAlex

I present a new approach for designing quantum error-correcting codes guaranteeing a physically natural implementation of Clifford operations. Inspired by the scheme put forward by Gottesman, Kitaev, and Preskill for encoding a qubit in an oscillator in which Clifford operations may be performed via Gaussian unitaries, this approach yields new schemes for encoding a qubit in a large spin in which single-qubit Clifford operations may be performed via spatial rotations. I construct all possible examples of such codes, provide universal-gate-set implementations using quadratic angular-momentum Hamiltonians, and derive criteria for when these codes exactly correct physically relevant errors.

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.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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.953
Threshold uncertainty score0.253

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.000
Open science0.0000.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.023
GPT teacher head0.313
Teacher spread0.290 · 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