Universal Bell-diagonal QBER coefficient relations
ProvedQAlgorithms.Papers.Independent.Intake100.P90.bellQber_constraintsLet sum to one, in the source's order . Measure the Bell-diagonal density matrix in the computational basis on Alice and Bob, and let be the actual probability that their outcomes disagree. Then
These universal relations apply in particular to the normalized output in . Additional protocol constraints from remain in force; the relations do not characterize all attainable attacks.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P90
noncomputable section
open scoped ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intake100.P90
/-- PDF p.3: the two universal Bell/QBER relations. Additional restrictions
from the protocol's D1 remain possible; this is not a feasible-set converse. -/
theorem bellQber_constraints (w : Fin 4 → ℝ)
(hw : ∀ l, 0 ≤ w l) (hsum : ∑ l, w l = 1) :
let Q := sourceZDisagreement (sourceBellDiagonal w)
Q = w 2 + w 3 ∧ w 0 = 1 - Q - w 1 ∧ w 3 = Q - w 2 := by sorry
end QAlgorithms.Papers.Independent.Intake100.P90
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonnegative real numbers with . In the Boolean-pair basis, identifying false and true with and , define , , , and , where is the coordinate vector at . Let and , with . Then the three equalities hold simultaneously:
Zero weights, including cases in which or , are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.