Blueprint

🗺️ Map of Quantum state transfer through a lossy bus: fundamental error limits for every control pulse, with application to IBM's meter-scale interconnects

🏷️ Quantum state transfer · quantum interconnects · optimal control bounds
12 results ✅ 0 entirely in Lean ◐ 3 partly in Lean ✅ 4 in Isabelle 💻 7 checked by a program written proof only (a result can carry several tags)

Dependencies in the written proof: an arrow A → B means that this proof of B uses A. Every result rests on its written proof; the tags record what was checked besides, and each statement's “Evidence & scope” block says how far. The colour of a box is its strongest tag, in the order above; the tags in the box give the rest. Boxes with a thick border are the main results; click a box to read the statement.

cluster_0 The floor cluster_1 The end qubits must be occupied cluster_2 Partial transfer and the asymptotic constant cluster_3 Dephasing cluster_4 Prior work and what is new cluster_5 The lab: check your link thm:floor Theorem 4.1 the loss floor: P(T) ≤ e^(−γT)/[1 + (κ−γ)/(G²T)] for every pulse and every duration ✅ Isabelle · 💻 program lem:frontier Lemma 6.1 frontier for partial transfer: G²T·Ĩ ≥ Ψ(GT, ε) → 2 ◐ part in Isabelle · 💻 program thm:floor->lem:frontier thm:asymptotic Theorem 6.2 asymptotic floor: 1 − P ≥ 2√(2γδ)/G (1 − o(1)) over all controls thm:floor->thm:asymptotic rem:ramp Remark 4.2 ramped couplings: G²T → J(T) = ∫m², minimal time 2√(A/S) or A/G + G/S ◐ part in Isabelle · after publication lem:window Lemma 5.1 the window lemma: |Φ(w(T)) − Φ(w(0))| ≤ G∫w², Φ(u) = (arcsin u − u√(1−u²))/2 ✅ Isabelle thm:endpoints Theorem 5.2 the end qubits must be occupied: G∫(x² + z²) ≥ [Φ(x₀) − Φ(x_T)] + [Φ(z_T) − Φ(z₀)], ≥ π/2 for a complete transfer ✅ Isabelle · 💻 program lem:window->thm:endpoints prop:windows Proposition 7.2 windows with a rate per element: the floor of a real device (with f_A(T)² in the balance) ◐ part in Isabelle · 💻 program lem:window->prop:windows thm:endpoints->prop:windows lem:frontier->thm:asymptotic rem:joint Remark 9.1 a joint bound |g_A|² + |g_B|² ≤ G² changes the constant lem:frontier->rem:joint thm:attain Theorem 6.3 the constant is attained: ramp–arc–unload gives 1 − P ≤ ℓ₀[1/(1−α) + 1.5β] 💻 program thm:asymptotic->thm:attain lem:coherence Lemma 7.1 coherence is an amplitude: same no-jump equations with rates 2/T₂; 1 − F_B = (1 − P)/6 + (1 − c)/3 ✅ Isabelle · 💻 program lem:coherence->prop:windows prop:reciprocity Proposition 7.3 reciprocity: P_(B←A)[H] = P_(A←B)[Hᵣev], same coherence; the direction is not a design choice 💻 program lem:coherence->prop:reciprocity lab:link Remark Lab 🔬 Check your link — the lab: the floor of YOUR link, a pulse, a verdict on your measurement, what to improve

What the paper contributes

A qubit hands its state to another qubit through a lossy bus (a resonator, a waveguide or a cable mode), with each coupler bounded by $G$. The paper gives error floors that hold for every control pulse, every duration and any number of bus modes, and applies them to IBM’s meter-scale interconnect.

  • A floor at every duration (Theorem 4.1, Isabelle): $P(T)\le e^{-\gamma T}/[1+(\kappa-\gamma)/(G^2T)]$.
  • The end qubits cannot be bypassed (Theorem 5.2, Isabelle): the excitation must sit in the end qubits for an integrated time whose lower bound tends to $\pi/(2G)$ for a complete transfer.
  • The asymptotic constant (Theorems 6.2 and 6.3): the perturbative optimum $2\sqrt{2\gamma(\kappa-\gamma)}/G$ becomes a lower bound over all controls, and an explicit pulse attains it with explicit error terms.
  • Dephasing and real devices (Section 7): the coherence with the vacuum is an amplitude with rates $2/T_2$; a version with a rate for each element gives the floor of a real device; reciprocity makes the direction irrelevant.
  • IBM’s links (Section 8): floors $6.03$–$10.05\times10^{-4}$ on $1-F_B$, certified with ball arithmetic, against measured errors $11$–$16$ times larger; which hardware change lowers the floor; three other platforms.

The lab Check your link computes the floor of your own link with the same code as the paper’s tables.

Open in the laboratory, with the values of the paper: IBM Q240–Q247 · IBM Q241–Q246 · IBM Q242–Q245 · IBM Q243–Q244 · Heya et al. · Chang et al. · Burkhart et al. (1 − P) · unequal couplers (10.9 / 7.1 MHz) · g/2π = 22.5 MHz · towards 10⁻⁴ (design map). Each opens the three labs of the section with those values: the floor, the bound at the measured duration, the pulses, the error budget, the design map and the sliders.

🚀 Start here: Theorem 4.1: the loss floor: P(T) ≤ e^(−γT)/[1 + (κ−γ)/(G²T)] for every pulse and every duration.

Main results:

  • Theorem 4.1: the loss floor: P(T) ≤ e^(−γT)/[1 + (κ−γ)/(G²T)] for every pulse and every duration
  • Theorem 5.2: the end qubits must be occupied: G∫(x² + z²) ≥ [Φ(x₀) − Φ(x_T)] + [Φ(z_T) − Φ(z₀)], ≥ π/2 for a complete transfer
  • Theorem 6.2: asymptotic floor: 1 − P ≥ 2√(2γδ)/G (1 − o(1)) over all controls
  • Theorem 6.3: the constant is attained: ramp–arc–unload gives 1 − P ≤ ℓ₀[1/(1−α) + 1.5β]
  • Lemma 7.1: coherence is an amplitude: same no-jump equations with rates 2/T₂; 1 − F_B = (1 − P)/6 + (1 − c)/3
  • Proposition 7.2: windows with a rate per element: the floor of a real device (with f_A(T)² in the balance)
  • Proposition 7.3: reciprocity: P_(B←A)[H] = P_(A←B)[Hᵣev], same coherence; the direction is not a design choice
  • Remark Lab: 🔬 Check your link — the lab: the floor of YOUR link, a pulse, a verdict on your measurement, what to improve

🧭 Fields: where the paper lives and what it connects

Tools taken from other branches

What the results serve

  • Hardware design of modular quantum computers ← which parameter lowers the floor of a link most (coupling, worse-qubit dephasing, coupler slope), before any pulse is designed — Proposition 7.2, Proposition 7.3