Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered observable identities, Eqs.19–20

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.verificationObservable_identities

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ be a density matrix on key qubits A,BA,BA,B and positive finite shields A′,B′A',B'A′,B′. For arbitrary shield unitaries UijU_{ij}Uij​, let Uτ=∑ij∣ij⟩⟨ij∣⊗UijU_\tau=\sum_{ij}|ij\rangle\langle ij|\otimes U_{ij}Uτ​=∑ij​∣ij⟩⟨ij∣⊗Uij​, let ρ~=UτρUτ†\widetilde\rho=U_\tau\rho U_\tau^\daggerρ​=Uτ​ρUτ†​, and let σ=Tr⁡A′B′ρ~\sigma=\operatorname{Tr}_{A'B'}\widetilde\rhoσ=TrA′B′​ρ​. For each of the five key observables O=Z⊗ZO=Z\otimes ZO=Z⊗Z, R1,R2,I1,I2R_1,R_2,I_1,I_2R1​,R2​,I1​,I2​, define O^=Uτ†(O⊗I)Uτ\widehat O=U_\tau^\dagger(O\otimes I)U_\tauO=Uτ†​(O⊗I)Uτ​. Here RkR_kRk​ is the difference of the real plus/minus Bell projectors in the even or odd key pair. For IkI_kIk​ the first tilde Bell vector has relative phase −i-i−i and the second has phase +i+i+i. Then

Tr⁡(O^ρ)=Tr⁡((O⊗I)ρ~)=Tr⁡(OTr⁡A′B′ρ~)=Tr⁡(Oσ).\operatorname{Tr}(\widehat O\rho)=\operatorname{Tr}((O\otimes I)\widetilde\rho)=\operatorname{Tr}(O\operatorname{Tr}_{A'B'}\widetilde\rho)=\operatorname{Tr}(O\sigma).Tr(Oρ)=Tr((O⊗I)ρ​)=Tr(OTrA′B′​ρ​)=Tr(Oσ).

The parity observable is unchanged by conjugation. For the even ordered pair (00,11)(00,11)(00,11) and the odd ordered pair (01,10)(01,10)(01,10), these expectations are 2Re⁡σuv2\operatorname{Re}\sigma_{uv}2Reσuv​ and 2Im⁡σuv2\operatorname{Im}\sigma_{uv}2Imσuv​, respectively. Each of the four computational projectors is also unchanged by conjugation and its expectation equals the corresponding diagonal entry of σ\sigmaσ. 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).

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
Formal statement
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
Source
Low dimensional bound entanglement with one-way distillable cryptographic key, arXiv:quant-ph/0506203v1, PDF p. 4, Unnumbered observable identities, Eqs.19–20
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every positive integers a,ba,ba,b, every positive semidefinite trace-one matrix ρ\rhoρ on a key register {0,1}2\{0,1\}^2{0,1}2 and shield Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, and every family UkU_kUk​ of shield unitaries indexed by key values, let W=∑k∣k⟩⟨k∣⊗UkW=\sum_k|k\rangle\langle k|\otimes U_kW=∑k​∣k⟩⟨k∣⊗Uk​, ρ~=WρW†\widetilde\rho=W\rho W^\daggerρ​=WρW†, σ=Tr⁡shieldρ~\sigma=\operatorname{Tr}_{\mathrm{shield}}\widetilde\rhoσ=Trshield​ρ​, and O^=W†(O⊗I)W\widehat O=W^\dagger(O\otimes I)WO=W†(O⊗I)W. Put D∣i,j⟩=∣i,j⟩D|i,j\rangle=|i,j\rangleD∣i,j⟩=∣i,j⟩ if i=ji=ji=j and D∣i,j⟩=−∣i,j⟩D|i,j\rangle=-|i,j\rangleD∣i,j⟩=−∣i,j⟩ otherwise. For each Boolean ooo, let uo=∣0,1⟩, vo=∣1,0⟩u_o=|0,1\rangle,\ v_o=|1,0\rangleuo​=∣0,1⟩, vo​=∣1,0⟩ when ooo is true and uo=∣0,0⟩, vo=∣1,1⟩u_o=|0,0\rangle,\ v_o=|1,1\rangleuo​=∣0,0⟩, vo​=∣1,1⟩ when ooo is false, and define

Ro=Π(uo+vo)/2−Π(uo−vo)/2,Io=Π(uo−ivo)/2−Π(uo+ivo)/2,Πv=vv†.R_o=\Pi_{(u_o+v_o)/\sqrt2}-\Pi_{(u_o-v_o)/\sqrt2},\qquad I_o=\Pi_{(u_o-\mathrm i v_o)/\sqrt2}-\Pi_{(u_o+\mathrm i v_o)/\sqrt2}, \quad \Pi_v=vv^\dagger.Ro​=Π(uo​+vo​)/2​​−Π(uo​−vo​)/2​​,Io​=Π(uo​−ivo​)/2​​−Π(uo​+ivo​)/2​​,Πv​=vv†.

The five indexed key observables are (O0,O1,O2,O3,O4)=(D,Rfalse,Ifalse,Rtrue,Itrue)(O_0,O_1,O_2,O_3,O_4)=(D,R_{\mathrm{false}},I_{\mathrm{false}},R_{\mathrm{true}},I_{\mathrm{true}})(O0​,O1​,O2​,O3​,O4​)=(D,Rfalse​,Ifalse​,Rtrue​,Itrue​). The assertion is the conjunction of D^=D⊗I\widehat D=D\otimes ID=D⊗I; for every i=0,…,4i=0,\ldots,4i=0,…,4, the complex trace identities

tr⁡(O^iρ)=tr⁡((Oi⊗I)ρ~),tr⁡((Oi⊗I)ρ~)=tr⁡(Oiσ),tr⁡(Oiσ)=tr⁡(Oiσ);\operatorname{tr}(\widehat O_i\rho) =\operatorname{tr}((O_i\otimes I)\widetilde\rho),\qquad \operatorname{tr}((O_i\otimes I)\widetilde\rho)=\operatorname{tr}(O_i\sigma),\qquad \operatorname{tr}(O_i\sigma)=\operatorname{tr}(O_i\sigma);tr(Oi​ρ)=tr((Oi​⊗I)ρ​),tr((Oi​⊗I)ρ​)=tr(Oi​σ),tr(Oi​σ)=tr(Oi​σ);

for every key basis value kkk, Π∣k⟩^=Π∣k⟩⊗I\widehat{\Pi_{|k\rangle}}=\Pi_{|k\rangle}\otimes IΠ∣k⟩​​=Π∣k⟩​⊗I and tr⁡(Π∣k⟩^ρ)=σkk\operatorname{tr}(\widehat{\Pi_{|k\rangle}}\rho)=\sigma_{kk}tr(Π∣k⟩​​ρ)=σkk​; and, for both Boolean values ooo,

Re⁡tr⁡(R^oρ)=2Re⁡σuo,vo,Re⁡tr⁡(I^oρ)=2Im⁡σuo,vo.\operatorname{Re}\operatorname{tr}(\widehat R_o\rho) =2\operatorname{Re}\sigma_{u_o,v_o},\qquad \operatorname{Re}\operatorname{tr}(\widehat I_o\rho) =2\operatorname{Im}\sigma_{u_o,v_o}.Retr(Ro​ρ)=2Reσuo​,vo​​,Retr(Io​ρ)=2Imσuo​,vo​​.

The third trace identity for each iii explicitly equates an expression with itself.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me