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.
π’ 1 formalπ‘ 5 formal in partβͺ 5 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.
- Corollary 2 β π‘ the rest is to be checked by hand
- Proposition 3 β π‘ the rest is to be checked by hand
- Proposition 5 β π‘ the rest is to be checked by hand
- Lemma 6 β π‘ the rest is to be checked by hand
- Proposition 8 β π‘ the rest is to be checked by hand
π Every statement
| statement | status | relations |
|---|---|---|
| Theorem 1 Robustness costs exposure and time: the disk inequality and the minimal duration T_0 + arccos(|ΞΆ|/z_0)/G | π’ formal | β |
| Corollary 2 A robust transfer costs at least max(β(Ξ³_q Ξ³_m), (Ο/2) min Ξ³)/G in extra exposure formal: the named pieces are machine-checked; the statement as a whole is a written proof | π‘ formal in part | uses Theorem 1 |
| Proposition 3 Fixed phase: the exact minimal exposure cost, from the shortest Dubins U-turn formal: the named pieces are machine-checked; the statement as a whole is a written proof | π‘ formal in part | β |
| Proposition 5 Second-order error under quasi-static noise, for every pulse; when the square pulse is optimal formal: the named pieces are machine-checked; the statement as a whole is a written proof | π‘ formal in part | β |
| Lemma 6 Planar exposure bound for pulses of fixed phase formal: the named pieces are machine-checked; the statement as a whole is a written proof | π‘ formal in part | β |
| Remark 7 The exact planar section: a Dubins car that turns back | βͺ cited / no proof here | β |
| Proposition 8 Slow noise together with memory loss: square-pulse optimality and the large-noise asymptotics formal: the named pieces are machine-checked; the statement as a whole is a written proof | π‘ formal in part | β |
| Remark 9 Relaxation of the qubit too: the bound and the sufficient condition for the square pulse | βͺ cited / no proof here | β |
| Remark 10 Correlated offsets: the same formula, and when correlation makes the square pulse optimal | βͺ cited / no proof here | β |
| Remark 11 One sufficient condition for square-pulse optimality, covering relaxation of both elements and correlated offsets | βͺ cited / no proof here | β |
| Remark 4 Two representative pulses cancel the leakage in the least time Ο/G | βͺ cited / no proof here | uses Theorem 1 |
π·οΈ 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