Blueprint
Robust qubit–memory transfer against quasi-static frequency noise costs time and exposure: exact bounds from Dubins curves📱 5 short screens

📱 The paper in five short screens, for a phone or a first look: the result, what it says in words, how it is proved, what has been checked, and where to try it. Nothing here loads Python.

🎯 The result 1 / 5

Theorem 1.

MarAthm:popsame-setting Robust_Disk.robust_disk, Robust_Disk.robust_disk_G, Robust_Disk.exposure_bound_general, Robust_Core.angle_bound, Robust_Core.equatorial_crossing, Robust_Core.frontier_general, Memory_Robust.concavity_step, Memory_Robust.tent_integral, Memory_Robust.frontier_step, Memory_Robust.disk_from_two_bounds, Memory_Robust.bang_bang_equality, Memory_Robust.turn_wait_turn_equality, Memory_Robust.robust_cost_amgm, Memory_Robust.min_robust_A For every complete transfer without losses, with \(|g|\le G\) and any detuning:

  1. \(A\ge A_0\), \(B\ge A_0\) and

    \[ \bigl(|\zeta |-z_0\bigr)^2\le (A-A_0)(B-A_0); \]
  2. if \(|\zeta |\le z_0\), then

    \[ T\ge T_0+\frac1G\arccos \frac{|\zeta |}{z_0}. \]

(b) is sharp for every \(|\zeta |\le z_0\): equality holds for \(g=+G\) during \((\pi +d)/(2G)\) followed by \(g=-G\) during \(d/(2G)\), \(d=\arccos (|\zeta |/z_0)\), and for its time reverse. (a) is an equality on the branch \(|\zeta |\ge z_0\): for \(+G\) during \(\alpha /(2G)\), no coupling and no detuning during \(w\), and \(+G\) again during \((\pi -\alpha )/(2G)\), for every \(\alpha \in [0,\pi ]\) and \(w\ge 0\) (the square pulse is \(w=0\)).

💬 In plain words 2 / 5

An unknown static frequency offset leaves a first-order error measured by the leakage $\zeta$. Reducing it has a price that no pulse escapes: the exposures $A,B$ must exceed $A_0$ enough to satisfy $(|\zeta|-z_0)^2\le(A-A_0)(B-A_0)$, and the duration must exceed $T_0$ by $\arccos(|\zeta|/z_0)/G$. A fully robust transfer ($\zeta=0$) therefore takes at least $\pi/G$, twice the resonant swap.

🛠️ How it is proved 3 / 5

🛡️ What is checked 4 / 5

🟢 1 formal · 🟡 5 formal in part · ⚪ 5 cited / no proof here.

Proof: in this note · Formalized: Isabelle/HOL, by the author (public formalizations repository) · Covers: the whole statement · Cite: Theorem 1, p. 4, doi:10.5281/zenodo.24250503

🔎 What a referee has to check by hand →

🧪 Try it 5 / 5

Labs in your browser (they load Python the first time):

📕 The paper (PDF)📘 The full blueprint

📎 Cite: doi:10.5281/zenodo.24250503