Encoded recoupling and decoupling: An alternative to quantum error-correcting codes applied to trapped-ion quantum computation
Bibliographic record
Abstract
A recently developed theory for eliminating decoherence and design constraints in quantum computers, ``encoded recoupling and decoupling,'' is shown to be fully compatible with a promising proposal for an architecture enabling scalable ion-trap quantum computation [D. Kielpinski et al., Nature (London) 417, 709 (2002)]. Logical qubits are encoded into pairs of ions. Logic gates are implemented using the S\o{}rensen-M\o{}lmer (SM) scheme applied to pairs of ions at a time. The encoding offers continuous protection against collective dephasing. Decoupling pulses, that are also implemented using the SM scheme directly to the encoded qubits, are capable of further reducing various other sources of qubit decoherence, such as due to differential dephasing and due to decohered vibrational modes. The feasibility of using the relatively slow SM pulses in a decoupling scheme quenching the latter source of decoherence follows from the observed $1/f$ spectrum of the vibrational bath.
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.000 | 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.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".