MétaCan
Menu
Back to cohort

Reproducibility in Quantum Computing

2021· article· en· W3194891683 on OpenAlexaboutno aff
Samudra Dasgupta, Travis S. Humble

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsnot available
FundersOffice of ScienceUT-Battelle
KeywordsComputer scienceReproducibilityQuantum computerNoise (video)FidelityComputationHellinger distanceComputer engineeringAlgorithmComputational scienceTheoretical computer scienceQuantumMathematicsArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

Reproducibility is important for validating the performance of applications in quantum computing as a measure of consistency in computation. Current noisy, intermediate-scale devices quantum (NISQ) devices are strongly affected by intrinsic noise that leads to a variety of computational error mechanisms. Here we assess reproducibility of NISQ computing by focusing on a specific simple error mechanism that arises during noisy readout. Using an asymmetric channel for binary readout, we develop an analytic bound on the Hellinger distance between computational outputs for different readout parameters. We validate this model using characterization and testing of the IBM toronto device, which displays a range of readout parameters. We find that to ensure reproducibility, one must avoid using register elements characterized by fidelity asymmetry exceeding a threshold.

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

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.001
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.016
GPT teacher head0.258
Teacher spread0.242 · 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 designSimulation or modeling
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

Citations4
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207