Measurement-Free Code-Switching Protocol for Low-Overhead Quantum Computation Using Permutation-Invariant Codes
Bibliographic record
Abstract
Transversal gates on quantum error correction codes have been a promising approach for fault-tolerant quantum computing, but are limited by the Eastin-Knill no-go theorem. Existing solutions such as gate teleportation and magic state distillation are resource-intensive. We present a measurement-free code-switching protocol for universal quantum computation, switching between a stabilizer code for transversal Clifford gates and a permutation-invariant (PI) code for transversal non-Clifford gates that are logical Z rotations for any rational multiple of π . The novel non-Clifford gates enabled by this code-switching protocol provide for a lower gate count implementation of a universal gate set relative to the Clifford + T gate set. To achieve this, we present a protocol for performing controlled- gates between the codes using near-term quantum control operations that employ a catalytic bosonic mode. We also present a new class of PI codes with tunable code distance, supporting transversal non-Clifford gates, and demonstrate their reduced gate count overhead relative to a comparable stabilizer code to stabilizer code-switching scheme.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".