MétaCan
Menu
Back to cohort

Designing High-Fidelity Single-Shot Three-Qubit Gates: A Machine-Learning Approach

2016· article· en· W2272691542 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 Applied · 2016
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsCanadian Institute for Advanced ResearchUniversity of Calgary
FundersOffice of Naval ResearchNatural Sciences and Engineering Research Council of CanadaMitacsGordon and Betty Moore FoundationUniversity of CalgaryNational Science Foundation
KeywordsScheme (mathematics)Series (stratigraphy)QuantumFidelityYield (engineering)Quantum computer

Abstract

fetched live from OpenAlex

To build a quantum computer, one can simplify the design of multi-qubit elements (logic gates) by treating them as series of well known one- and two-qubit gates---at the price of a slower processor. What if there were a handy means for $d\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}t$ multi-qubit design? The authors show numerically that, under existing experimental constraints, their recently developed SuSSADE scheme can yield three-qubit gates for single-shot entangling operations with fidelity greater than 99.9%. This powerful approach brings us that much closer to a fault-tolerant solid-state quantum computer.

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.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: Methods · Consensus signal: none
Teacher disagreement score0.895
Threshold uncertainty score0.902

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.029
GPT teacher head0.259
Teacher spread0.230 · 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