B and P steps: conditional Pauli error transformations
OpenQAlgorithms.Papers.Independent.Intakenext100.P80.bp_error_updatesLet independent input EPR pairs have Bell-diagonal Pauli noise with probabilities , where , and put . A B step applies the bilateral controlled-NOT to two pairs, measures the target pair in the basis, and retains the control pair exactly when the two measurement outcomes agree. Let be its acceptance probability per two-pair block, and let be the conditional error probabilities of the retained pair. A P step applies the three-pair phase repetition-code procedure, corrects the surviving pair by precisely when both relative phase syndromes disagree, and retains it for every syndrome. Write for its output error probabilities. Then
These transformations describe the effective noise after a purification round. Independence is an assumption of this calculation, rather than a restriction on the adversaries in the paper's separate QKD security results.
Formalization Note Both step maps are computed from branch amplitudes of the specified circuits and Born probabilities. They are not defined by the displayed polynomials.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P80
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P80
open scoped ComplexConjugate
/-- Appendix C, PDF p.22, Eqs.(15)--(22); physical steps are defined on
PDF pp.16,18. For independent Bell-diagonal noise, the circuit-derived B
and P outputs have exactly these Pauli rates. B survival is per two-pair
block, rather than the retained/input population fraction. -/
theorem bp_error_updates (q : PauliRates) (hq : IsPauliRates q) :
bSurvival q = 1 - 2 * (q.qX + q.qY) * (1 - q.qX - q.qY) ∧
(bStep q).qX = (q.qX ^ 2 + q.qY ^ 2) / bSurvival q ∧
(bStep q).qY = 2 * q.qX * q.qY / bSurvival q ∧
(bStep q).qZ = 2 * identityRate q * q.qZ / bSurvival q ∧
(pStep q).qX = 3 * identityRate q ^ 2 * (q.qX + q.qY) +
6 * identityRate q * q.qX * q.qZ + 3 * q.qX ^ 2 * q.qY + q.qX ^ 3 ∧
(pStep q).qY = 6 * identityRate q * q.qY * q.qZ +
3 * q.qX * (q.qY ^ 2 + q.qZ ^ 2) + 3 * q.qY * q.qZ ^ 2 + q.qY ^ 3 ∧
(pStep q).qZ = 3 * identityRate q * (q.qY ^ 2 + q.qZ ^ 2) +
6 * q.qX * q.qY * q.qZ + 3 * q.qY ^ 2 * q.qZ + q.qZ ^ 3 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P80
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real triple satisfying , , , and , the following seven equalities hold simultaneously. To specify all quantities, put ; identify Booleans with , write for exclusive-or, and set , , , , , and . Define
Thus the output coordinates are , and the output coordinates are . The asserted equalities are
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.