Blueprint
Referee viewπŸ”Ž what to check by hand

πŸ”Ž What does a referee have to check by hand?

Every statement of the paper with what supports it: a proof assistant, a program, a citation, or only the written proof. What is left is the list a referee has to read by hand, in an order where each statement comes after what it uses.

🟒 3 formal🟑 12 formal in partβšͺ 3 cited / no proof here

πŸ“‹ To check by hand, in order

Each statement comes after what it uses. 🟑: only the part not formalized; πŸ”΅: the argument, not its computations.

  1. Theorem 4 β€” 🟑 the rest is to be checked by hand
  2. Theorem 7 β€” 🟑 the rest is to be checked by hand
  3. Corollary 8 β€” 🟑 the rest is to be checked by hand
  4. Corollary 10 β€” 🟑 the rest is to be checked by hand
  5. Proposition 11 β€” 🟑 the rest is to be checked by hand
  6. Proposition 12 β€” 🟑 the rest is to be checked by hand
  7. Corollary 13 β€” 🟑 the rest is to be checked by hand
  8. Proposition 14 β€” 🟑 the rest is to be checked by hand
  9. Proposition 15 β€” 🟑 the rest is to be checked by hand
  10. Proposition 16 β€” 🟑 the rest is to be checked by hand
  11. Proposition 17 β€” 🟑 the rest is to be checked by hand
  12. Proposition 18 β€” 🟑 the rest is to be checked by hand

πŸ“š Every statement

statementstatusrelations
Theorem 1
Relaxation only: no pulse transfers more population than the resonant swap (closed form)
🟒 formalβ€”
Theorem 4
With Markovian dephasing too: the resonant swap still bounds the transferred population
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Remark 6
The relaxation bound holds under any dephasing, Markovian or not
βšͺ cited / no proof hereβ€”
Theorem 7
At a prescribed duration: a Lyapunov function bounds the population by the resonant pulse
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Corollary 8
Exact envelopes B_p, B_c: resonant pulse followed by a wait in the less lossy element
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Corollary 9
The write channel: infidelity r from population and coherence, and the bounds on r_opt
🟒 formalβ€”
Corollary 10
The chain r_sep ≀ r_time ≀ r_opt ≀ r_res, with certified numbers
formal: the named pieces are machine-checked; the statement as a whole is certified by computation
🟑 formal in partβ€”
Proposition 11
Strong dephasing (β‰₯ 4G): r_opt = 5/12, not attained; the certified equal-rate threshold
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 12
Very unequal dephasing: the threshold is Ο†_q Ο†_m = 3GΒ² (one storage function)
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Corollary 13
Unequal dephasing: a sufficient region below |Ο†_q βˆ’ Ο†_m| = 2√5 G where r_opt = 5/12, not attained
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 14
Quasi-static offsets: the square pulse error and two bounds
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 15
The price of one stopping time: r_res βˆ’ r_sep = Φ²/(48GΒ²) at second order
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 16
When the resonant pulse is exactly optimal: 4 min(Ξ·_q, Ξ·_m) > Ο†_q + Ο†_m along a small-rate direction
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 17
The memory cycle with a reset between write and read
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 18
The cycle without reset, to first order: the optimum never completes the swap and goes below the reset floor
formal: the named pieces are machine-checked; the statement as a whole is a written proof
🟑 formal in partβ€”
Proposition 19
Equal relaxation rates: an elementary proof of the population bound
🟒 formalβ€”
Remark 2
Stopping rule: stop the resonant pulse when |a|/|b| = Ξ³_m/(2G)
βšͺ cited / no proof hereuses Theorem 1
Remark 3
Random pulses test the theorem; an elementary proof for equal rates
βšͺ cited / no proof hereuses Theorem 4

🏷️ The labels

🟒 formal: the whole statement is machine-checked
🟑 formal in part: the rest is to be checked by hand
πŸ”΅ computation: written proof; its computations are checked by a program
πŸ”΄ by hand: written proof only
βšͺ cited / no proof here: a result of others, or a question