Explicit Hadamard example, Eqs.13–15: Bell flags and preparation
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.hadamard_bellFlag_preparationUse the normalized Bell vectors , , , and . Write and set
For , , and , all are nonnegative, their sum is one, all are unit vectors, all are density matrices, and
Randomly selecting and separately preparing these two factors therefore prepares . The product cut here is , and does not assert physical Alice–Bob separability. Eq. (5)'s repeated ket is corrected according to Eqs. (7) and (14).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
noncomputable section
open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P37
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Dependency50.P24
(Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)
/-- PDF p.3, Eqs.(13)--(15): the exact Bell-flag mixture and normalized
preparation law. Separate preparation refers to AB versus A'B', not Alice versus Bob.
Eq.(5)'s repeated |01> is corrected to |10>, as Eqs.(7),(14) require. -/
theorem hadamard_bellFlag_preparation :
rhoHadamard = ∑ i : Fin 4, (hadamardWeight i : ℂ) •
Matrix.kronecker (pureDensity (((![pairKet false 1, pairKet false (-1), pairKet true 1, pairKet true (-1)]) i))) (hadamardFlag i) ∧
(∀ i, 0 ≤ hadamardWeight i) ∧ (∑ i, hadamardWeight i) = 1 ∧
(∀ i, ‖((![pairKet false 1, pairKet false (-1), pairKet true 1, pairKet true (-1)]) i)‖ = 1 ∧ IsDensityMatrix (hadamardFlag i)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Use the basis on each of two four-dimensional registers, called key and shield, and write . Define , when and , and zero otherwise, and , where all four indices range over . For a shield matrix , define to have key blocks
with all other key blocks zero. Let , acting on the key register, set and , and define
Let , ,
and let , , , , with shield matrices
and weights . The assertion is that , that every is nonnegative and their sum is one, and that, for each of the four indices, and is positive semidefinite with trace one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.