§4.3, closing claim, p. 12 — after commit-and-open, Bob's state is negligibly close to one satisfying the benign bounds (1) for any β > 0
ProvedCommitOpen.Benign.forces_benignFix the test fraction and any . There is a negligible function with the following property.
Let be the number of EPR pairs, the size of the test set and . Let and be the outcomes and bases Bob committed to, and let be any unit vector of (Alice's qubits and a finite-dimensional register of a dishonest Bob): the joint state right before Step 2 of the verification of Fig. 4. Then there is, for each test , a unit vector such that:
- (closeness) the real state and the ideal state satisfy ;
- (bounds (1)) running Steps 2 and 3 on the ideal state, every branch Alice accepts satisfies the bounds of Definition 4.1: for every test , every choice of Alice's bases and every outcome with for all whose part has positive probability,
and for every and every of positive probability,
This is the claim the paper's proof of Theorem 4.2 reduces to (p. 9): the dishonest Bob of the compiled protocol is -benign for every . Its computational wrapper (dual-mode commitments, the CRS model) is not part of this statement.
Formalization Note. depends on and only, and is chosen before , , , Bob's register and the state; the ideal vectors depend on the test only, not on or . Closeness is stated before Steps 2–3 and the bounds on the ideal state after them, as in the paper's construction of (p. 12); the trace distance does not increase under these steps, which is not restated. Rejecting branches carry no constraint ("either aborts, or else", Definition 4.1). Alice's measurement of in and of in is one measurement in the mixed basis; the conditioning includes . is Bob's (unnormalized) state given , which for a pure joint state is the pointwise purification of Definition 4.1. and , equal to the paper's and when is an integer. The joint state is pure without loss of generality (p. 10).
import Mathlib import Definitions.Def_CommitOpen_Benign_Model
namespace CommitOpen.Benign
theorem forces_benign (α β : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hβ : 0 < β) :
∃ ν : ℕ → ℝ, Negligible ν ∧
∀ (m : ℕ) (xhat θhat : Fin m → Bool) (E : Type) [Fintype E] [DecidableEq E]
(φ : EuclideanSpace ℂ ((Fin m → Bool) × E)), ‖φ‖ = 1 →
∃ φt : Test m ⌊α * m⌋₊ → EuclideanSpace ℂ ((Fin m → Bool) × E),
(∀ t, ‖φt t‖ = 1) ∧
traceDistance (cqState (fun _ : Test m ⌊α * m⌋₊ => φ)) (cqState φt) ≤ ν m ∧
∀ (t : Test m ⌊α * m⌋₊) (θ x : Fin m → Bool),
(∀ i ∈ t.1.2, x i = xhat i) →
0 < ∑ y ∈ agreeOn t.1.1 x, outcomeProb (mixBasis t.1.1 θhat θ) (φt t) y →
maxEntropy (bobState (mixBasis t.1.1 θhat θ) (φt t) t.1.1 x) ≤
β * ((m - ⌊α * m⌋₊ : ℕ) : ℝ) ∧
∀ I : Finset (Fin m), I ⊆ t.1.1ᶜ →
0 < ∑ y ∈ agreeOn Iᶜ x, outcomeProb (mixBasis t.1.1 θhat θ) (φt t) y →
(hammingOn I θ θhat : ℝ) - β * ((m - ⌊α * m⌋₊ : ℕ) : ℝ) ≤
condMinEntropy (outcomeProb (mixBasis t.1.1 θhat θ) (φt t)) I x := by sorry
end CommitOpen.Benign
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.