Unnumbered observable identities, Eqs.19–20
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.verificationObservable_identitiesLet be a density matrix on key qubits and positive finite shields . For arbitrary shield unitaries , let , let , and let . For each of the five key observables , , define . Here is the difference of the real plus/minus Bell projectors in the even or odd key pair. For the first tilde Bell vector has relative phase and the second has phase . Then
The parity observable is unchanged by conjugation. For the even ordered pair and the odd ordered pair , these expectations are and , respectively. Each of the four computational projectors is also unchanged by conjugation and its expectation equals the corresponding diagonal entry of . Thus the four joint outcomes of one local computational measurement setting recover all four diagonal entries; a single parity mean does not. The identities use genuine arbitrary controlled unitaries and do not depend on the faulty printed Eq. (21).
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.4, Eqs.(19)--(20): all five conjugation/trace identities, both complex
coherences, and the FOUR joint outcomes of the local Z measurement setting.
The phase labels are fixed in imagCoherence so the imaginary sign is positive.
The parity mean alone is not asserted to determine four probabilities. -/
theorem verificationObservable_identities {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
(rho : Op (Key 2 × (Fin a × Fin b))) (hrho : IsDensityMatrix rho)
(U : Key 2 → Matrix.unitaryGroup (Fin a × Fin b) ℂ) :
physicalObservable U (Matrix.diagonal (fun k : Key 2 => if k.1 = k.2 then (1 : ℂ) else -1)) = Matrix.kronecker (Matrix.diagonal (fun k : Key 2 => if k.1 = k.2 then (1 : ℂ) else -1)) (1 : Op (Fin a × Fin b)) ∧
(∀ i : Fin 5,
(physicalObservable U (keyObservable i) * rho).trace =
(Matrix.kronecker (keyObservable i) (1 : Op (Fin a × Fin b)) * twist U rho).trace ∧
(Matrix.kronecker (keyObservable i) (1 : Op (Fin a × Fin b)) * twist U rho).trace =
(keyObservable i * traceRight (twist U rho)).trace ∧
(keyObservable i * traceRight (twist U rho)).trace =
(keyObservable i * traceRight (twist U rho)).trace) ∧
(∀ k : Key 2,
physicalObservable U (Matrix.single k k 1) =
Matrix.kronecker (Matrix.single k k 1) (1 : Op (Fin a × Fin b)) ∧
(physicalObservable U (Matrix.single k k 1) * rho).trace = traceRight (twist U rho) k k) ∧
(∀ odd : Bool,
(physicalObservable U (realCoherence odd) * rho).trace.re =
2 * (traceRight (twist U rho) (0, if odd then 1 else 0) (1, if odd then 0 else 1)).re ∧
(physicalObservable U (imagCoherence odd) * rho).trace.re =
2 * (traceRight (twist U rho) (0, if odd then 1 else 0) (1, if odd then 0 else 1)).im) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integers , every positive semidefinite trace-one matrix on a key register and shield , and every family of shield unitaries indexed by key values, let , , , and . Put if and otherwise. For each Boolean , let when is true and when is false, and define
The five indexed key observables are . The assertion is the conjunction of ; for every , the complex trace identities
for every key basis value , and ; and, for both Boolean values ,
The third trace identity for each explicitly equates an expression with itself.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.