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.
π’ 4 formalπ‘ 2 formal in partπ΅ 2 computationπ΄ 2 by handβͺ 2 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.
- Proposition 7.2 β π‘ the rest is to be checked by hand
- Proposition 7.3 β π΅ written proof; its computations are checked by a program
- π¬ Check your link β the lab: the floor of YOUR link, a pulse, a verdict on your measurement, what to improve β π΄ written proof only
- Lemma 6.1 β π‘ the rest is to be checked by hand
- Theorem 6.2 β π΄ written proof only
- Theorem 6.3 β π΅ written proof; its computations are checked by a program
π Every statement
| statement | status | relations |
|---|---|---|
| lab:link π¬ Check your link β the lab: the floor of YOUR link, a pulse, a verdict on your measurement, what to improve | π΄ by hand | uses Proposition 7.2; uses Proposition 7.3; uses Lemma 7.1 |
| Theorem 4.1 the loss floor: P(T) β€ e^{βΞ³T}/[1 + (ΞΊβΞ³)/(GΒ²T)] for every pulse and every duration | π’ formal | β |
| Remark 4.2 ramped couplings: GΒ²T β J(T) = β«mΒ², minimal time 2β(A/S) or A/G + G/S | βͺ cited / no proof here | β |
| Lemma 5.1 the window lemma: |Ξ¦(w(T)) β Ξ¦(w(0))| β€ Gβ«wΒ², Ξ¦(u) = (arcsin u β uβ(1βuΒ²))/2 | π’ formal | β |
| Theorem 5.2 the end qubits must be occupied: Gβ«(xΒ² + zΒ²) β₯ [Ξ¦(xβ) β Ξ¦(x_T)] + [Ξ¦(z_T) β Ξ¦(zβ)], β₯ Ο/2 for a complete transfer | π’ formal | uses Lemma 5.1 |
| Lemma 6.1 frontier for partial transfer: GΒ²TΒ·Δ¨ β₯ Ξ¨(GT, Ξ΅) β 2 formal: the two inequalities from the reduced inequalities; Ξ¨ and its limit 2 are on paper | π‘ formal in part | uses Theorem 4.1 |
| Theorem 6.2 asymptotic floor: 1 β P β₯ 2β(2Ξ³Ξ΄)/G (1 β o(1)) over all controls | π΄ by hand | uses Theorem 4.1; uses Lemma 6.1 |
| Theorem 6.3 the constant is attained: rampβarcβunload gives 1 β P β€ ββ[1/(1βΞ±) + 1.5Ξ²] | π΅ computation | uses Theorem 6.2 |
| Lemma 7.1 coherence is an amplitude: same no-jump equations with rates 2/Tβ; 1 β F_B = (1 β P)/6 + (1 β c)/3 | π’ formal | β |
| Proposition 7.2 windows with a rate per element: the floor of a real device (with f_A(T)Β² in the balance) formal: the emitter and receiver windows and the norm chain with one common excess rate; the three-rate balance, f_A(T)Β² and J_B are on paper | π‘ formal in part | uses Lemma 7.1; uses Theorem 5.2; uses Lemma 5.1 |
| Proposition 7.3 reciprocity: P_{BβA}[H] = P_{AβB}[H_rev], same coherence; the direction is not a design choice | π΅ computation | uses Lemma 7.1 |
| Remark 9.1 a joint bound |g_A|Β² + |g_B|Β² β€ GΒ² changes the constant | βͺ cited / no proof here | β |
π·οΈ 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