MétaCan
Menu
Back to cohort
Record W4416087063 · doi:10.21105/joss.09125

mdopt: A code-agnostic tensor-network decoder for quantum error-correcting codes

2025· article· W4416087063 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

VenueThe Journal of Open Source Software · 2025
Typearticle
Language
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversité de Sherbrooke
FundersNatural Sciences and Engineering Research Council of CanadaAlliance de recherche numérique du CanadaCanada First Research Excellence Fund
KeywordsQuantumDecoding methodsEncoding (memory)Code (set theory)Block code

Abstract

fetched live from OpenAlex

mdopt is an open-source Python library for code-agnostic decoding of quantum error-correcting codes using tensor networks (in particular, MPS and MPO).Given only the parity-check matrices and a noise model, mdopt builds a tensor-network representation of the decoding problem in the form of MPS-MPO evolution and contracts it to approximate (or, for small instances, exact) maximum-likelihood posteriors over logical operators.Depending on the number of logical qubits, the code either reads out the posterior maximum directly or uses a DMRG-like variational algorithm to find the most likely logical correction.The library targets researchers who wish to benchmark codes and noise models beyond simple settings, while retaining a clear and reproducible workflow in pure Python.

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.008
metaresearch head score (Gemma)0.004
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication, Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.634
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0080.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.002
Science and technology studies0.0030.000
Scholarly communication0.0020.001
Open science0.0090.003
Research integrity0.0000.002
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.026
GPT teacher head0.310
Teacher spread0.284 · 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