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.

🟒 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.

  1. Proposition 7.2 β€” 🟑 the rest is to be checked by hand
  2. Proposition 7.3 β€” πŸ”΅ written proof; its computations are checked by a program
  3. πŸ”¬ Check your link β€” the lab: the floor of YOUR link, a pulse, a verdict on your measurement, what to improve β€” πŸ”΄ written proof only
  4. Lemma 6.1 β€” 🟑 the rest is to be checked by hand
  5. Theorem 6.2 β€” πŸ”΄ written proof only
  6. Theorem 6.3 β€” πŸ”΅ written proof; its computations are checked by a program

πŸ“š Every statement

statementstatusrelations
lab:link
πŸ”¬ Check your link β€” the lab: the floor of YOUR link, a pulse, a verdict on your measurement, what to improve
πŸ”΄ by handuses 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
🟒 formaluses 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 partuses Theorem 4.1
Theorem 6.2
asymptotic floor: 1 βˆ’ P β‰₯ 2√(2Ξ³Ξ΄)/G (1 βˆ’ o(1)) over all controls
πŸ”΄ by handuses Theorem 4.1; uses Lemma 6.1
Theorem 6.3
the constant is attained: ramp–arc–unload gives 1 βˆ’ P ≀ β„“β‚€[1/(1βˆ’Ξ±) + 1.5Ξ²]
πŸ”΅ computationuses 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 partuses 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
πŸ”΅ computationuses 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