Tunable coupling between three qubits as a building block for a superconducting quantum computer
Bibliographic record
Abstract
Large-scale quantum computers will consist of many interacting qubits. In this paper we expand the two flux qubit coupling scheme first devised by P. Plourde et al. [Phys. Rev. B 70, 140501 (2004)] and realized by T. Hime et al. [Science 314, 1427 (2006)] to a three-qubit, two-coupler scenario. We study L-shaped and line-shaped coupler geometries, and show how the interaction strength between qubits changes in terms of the couplers' dimensions. We explore two cases: the ``on-state'' where the interaction energy between two nearest-neighbor qubits is high, and the ``off-state'' where it is turned off. In both situations we study the undesirable crosstalk with the third qubit. Finally, we use the grape algorithm to find efficient pulse sequences for two-qubit gates subject to our calculated physical constraints on the coupling strength.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".