Appendix E, Eq. (26) — Bob's and Alice's guessing probabilities
ProvedOCB2012.eq26_and_alice_guessWith the process matrix of Eq. (7), Alice's CJ matrices (Eq. (20)) and Bob's (Eqs. (21)–(23)), for any qubit density matrix :
- (Eq. (26)) for all bits ,
- with uniform,
Both are equalities of complex numbers.
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_OCB2012_defs open Matrix open scoped Kronecker ComplexOrder
namespace OCB2012
theorem eq26_and_alice_guess (ρ : Matrix Qubit Qubit ℂ) (hρ : PeresTerno.IsDensityMatrix ρ) :
(∀ a b y : Bool, ∑ x : Bool, prob W7 (ξ x a) (η ρ y b true) =
(((1 / 2 : ℝ) * (1 + (if xor y a then -1 else 1) / Real.sqrt 2) : ℝ) : ℂ)) ∧
(1 / 4 : ℂ) * ∑ a : Bool, ∑ b : Bool, ∑ y : Bool, prob W7 (ξ b a) (η ρ y b false) =
(((2 + Real.sqrt 2) / 4 : ℝ) : ℂ) := by sorry
end OCB2012Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of OCB2012.eq26_and_alice_guess.
Setting and conventions. A qubit index set is . Bits are Booleans; write , , and define the sign if is false and if is true (so under false , true ). denotes exclusive or. The fixed complex matrices are
with rows/columns indexed by , so (the projector onto basis vector , false , true ) and with , . Kronecker products are . Four-qubit operators are matrices indexed by , the factors being called in that order.
Definitions used (unfolded).
- The matrix (a fixed complex matrix):
- Alice's matrices, for bits (first argument, the factor) and (second argument, the factor):
- Bob's matrices, depending on a complex matrix and bits :
Note does not depend on , and does not depend on .
- For a matrix and matrices (on ) and (on ), (a complex number; no real part is taken).
- is a density matrix means: is positive semidefinite (Hermitian with for all ) and .
The statement. For every complex matrix that is a density matrix, both of the following hold (a conjunction):
- For all bits ,
an equality of complex numbers whose right-hand side is the real number when and when , embedded in . The sum is over the first argument of (Alice's bit); is the second argument of ; is the first bit argument of ; the third argument of is fixed to true. The right-hand side depends neither on nor on , so the claim is that the left side takes this value for every and every density matrix .
- With the third argument fixed to false,
an equality of complex numbers (right side real), each sum running over both Boolean values (8 terms total). Here the first argument of is (the same that is the second argument of ), and the second is ; is summed and is not compared with anything. Since does not involve , this second conjunct does not depend on or on the density-matrix hypothesis at all.
Edge cases and remarks. The only hypothesis is that is a density matrix; such exist (e.g. ), so the statement is not vacuous. No other assumption is placed on (it is a fixed concrete matrix; nothing about its being a process matrix is assumed or asserted), nor on beyond their explicit formulas. Division by is genuine (). All equalities are exact equalities in , so in particular they assert that the left-hand sides have zero imaginary part.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.