p. 3, step-outcome rule — each Bell outcome has probability 1/16; the step applies U(β) if i₁ = j₁ and U(−β) = U(β)† if i₁ ≠ j₁
ProvedEntanglingOps.BinaryPhase.step_outcome_rulebell-measurementloccnonlocal-gatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1
Fix a real and let systems and be in the state of Eq. (10). Measure and in the Bell basis , where , , , ; on outcome for apply to , and on outcome for apply to . Let be the resulting operator from to . Then:
- for all outcomes , there is with and
- ;
- on every density matrix of , each of the 16 outcomes has probability .
So all outcomes are equally probable, and the step applies the gate in 8 of the 16 cases and its inverse in the others. This is the elementary step of the protocol.
Differences from the source:
- generalization: the step with resource ψ_{α_N} → every real β; reason: the protocol's step k uses β = 2^{k−1}α_N; β = α_N is an instance
- reading: Bell basis |Ψ_{i1,i2}⟩ = 𝟙 ⊗ σ_{i1,i2}|Ψ⟩ with |Ψ⟩ not defined → |Ψ⟩ := |Φ⟩ of Eq. (5) at d = 2, i.e. |Φ⁺⟩ (bellVec); reason: the only reading under which the page's rule (i)/(ii) holds: with |Ψ⁺⟩ all 16 outcomes violate it, with |Φ⟩ all 16 satisfy it
- encoding: 'the resulting operation will be U(α_N)' (resp. U(−α_N)) → the step's Kraus operator equals c·U(±β) with |c|² = 1/16; reason: the post-measurement state is K ρ K†/Tr(K ρ K†) = U ρ U†; the scalar is the outcome's amplitude
- encoding: labels (i1,i2) ∈ {1,2}², steps k = 1, …, N → 0-based labels in Fin 2 × Fin 2 and 0-based list positions (the paper's step k is position k − 1, with resource ψ_{2^{k−1}α_N}); reason: Lean indexing convention; same objects
Preamble
import Mathlib import Definitions.Def_EntanglingOps_BinaryPhase_Model
Formal statement
namespace EntanglingOps.BinaryPhase
open Matrix
open scoped Kronecker ComplexOrder
/-- p. 3, the step-outcome rule: with the resource `|ψ_β⟩`, each of the 16 Bell outcomes
`(i, j)` (Alice's on `A₂A₃`, Bob's on `B₂B₃`), followed by the corrections `σ_i` on `A₁` and
`σ_j` on `B₁`, acts on `A₃B₃ → A₁B₁` as `c · U(β)` if `i₁ = j₁` and `c · U(−β)` if `i₁ ≠ j₁`,
with `|c|² = 1/16`; `U(β)† = U(−β)`; and every outcome has probability `1/16` on every input
density matrix. Stated for every real `β` (the paper's step uses `β = α_N`). -/
theorem step_outcome_rule :
(∀ (β : ℝ) (i j : Fin 2 × Fin 2), ∃ c : ℂ, Complex.normSq c = 1 / 16 ∧
stepKraus β i j = c • gate (if i.1 = j.1 then β else -β)) ∧
(∀ β : ℝ, (gate β)ᴴ = gate (-β)) ∧
(∀ (β : ℝ) (i j : Fin 2 × Fin 2) (ρ : Matrix (Fin 2 × Fin 2) (Fin 2 × Fin 2) ℂ),
ρ.PosSemidef → ρ.trace = 1 →
(Matrix.trace (stepKraus β i j * ρ * (stepKraus β i j)ᴴ)).re = 1 / 16) := by sorry
end EntanglingOps.BinaryPhase
Source
Cirac, Dür, Kraus, Lewenstein, Entangling operations and their implementation using a small amount of entanglement, arXiv:quant-ph/0007057v1, p. 3, protocol paragraph ('Note that all outcomes of the measurement are equally probable … (ii) U(α_N)† = U(−α_N) if i1 ≠ j1')
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.