MétaCan
Menu
Back to cohort

Quantum computation with cat qubits

2023· article· en· W4380716178 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.

Bibliographic record

VenueSciPost Physics Lecture Notes · 2023
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversité de Sherbrooke
FundersSorbonne UniversitéCentre National de la Recherche ScientifiqueQuantICYale University
KeywordsQubitQuantum computerComputer scienceQuantum error correctionDissipationError detection and correctionQuantum informationQuantumPhotonElectronic engineeringUniversal setSet (abstract data type)Computer engineeringPhysicsQuantum mechanicsAlgorithmEngineering

Abstract

fetched live from OpenAlex

These are the lecture notes from the 2019 Les Houches Summer School on “Quantum Information Machines”. After a brief introduction to quantum error correction and bosonic codes, we focus on the case of cat qubits stabilized by a nonlinear multi-photon driven dissipation process. We argue that such a system can be seen as a self-correcting qubit where bit-flip errors are robustly and exponentially suppressed. Next, we provide some experimental directions to engineer such a multi-photon driven dissipation process with superconducting circuits. Finally, we analyze various logical gates that can be implemented without re-introducing bit-flip errors. This set of bias-preserving gates pave the way towards a hardware-efficient and fault-tolerant quantum processor.

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.915
Threshold uncertainty score0.540

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.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.015
GPT teacher head0.245
Teacher spread0.231 · 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