MétaCan
Menu
Back to cohort
Record W4417118409 · doi:10.1063/5.0280551

Magic state distillation without measurements and post-selection

2025· article· en· W4417118409 on OpenAlexaff
Sascha Heußen

Bibliographic record

VenueAPL Quantum · 2025
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsNexen (Canada)
Fundersnot available
KeywordsNoise (video)SubroutineDistillationState (computer science)Quantum computerSet (abstract data type)Protocol (science)QuantumQubit

Abstract

fetched live from OpenAlex

Magic state distillation (MSD) is a quantum algorithm that enables performing logical non-Clifford gates with, in principle, arbitrarily low noise levels. It is typically assumed herein that logical Clifford gates can be executed without noise. Therefore, MSD is a standard subroutine used to obtain a fault-tolerant universal set of quantum gate operations on error-corrected logical qubits. Well-known schemes conventionally rely on performing operator measurements and post-selection based on the measurement result, which makes distillation protocols non-deterministic in the presence of noise. In this work, we adapt the 15-to-1 MSD protocol such that it deterministically suppresses noise by using a coherent feedback network on the output states without the need to perform individual-qubit measurements. These advantages over textbook MSD come at the price of reducing the noise suppression per round from O(p3) to O(p2). Our technique can be applied to any MSD protocol with an acceptance rate of 1 in the absence of noise. It may be desirable to use our scheme if the coherent feedback network can be executed faster and more reliably than the measurements, and/or if logical clock cycles in the quantum processor should be kept synchronous at all times. Our result broadens the path of potential experimental realizations of MSD in near-term devices and advances the development of fault-tolerant quantum computers with practical use.

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.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: Empirical
Teacher disagreement score0.832
Threshold uncertainty score0.462

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.012
GPT teacher head0.250
Teacher spread0.238 · 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueAPL QuantumSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207