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.
- Theorem 4 β π‘ the rest is to be checked by hand
- Theorem 7 β π‘ the rest is to be checked by hand
- Corollary 8 β π‘ the rest is to be checked by hand
- Corollary 10 β π‘ the rest is to be checked by hand
- Proposition 11 β π‘ the rest is to be checked by hand
- Proposition 12 β π‘ the rest is to be checked by hand
- Corollary 13 β π‘ the rest is to be checked by hand
- Proposition 14 β π‘ the rest is to be checked by hand
- Proposition 15 β π‘ the rest is to be checked by hand
- Proposition 16 β π‘ the rest is to be checked by hand
- Proposition 17 β π‘ the rest is to be checked by hand
- Proposition 18 β π‘ the rest is to be checked by hand
π Every statement
| statement | status | relations |
|---|---|---|
| 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 here | uses Theorem 1 |
| Remark 3 Random pulses test the theorem; an elementary proof for equal rates | βͺ cited / no proof here | uses 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