Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Figure 2(a,b): noisy GHZ/W information comparisons

Open
QAlgorithms.Papers.Independent.Support50.P43.noisy_qubit_information

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ψ\psiψ be either the three-qubit GHZ vector (∣000⟩+∣111⟩)/2(|000\rangle+|111\rangle)/\sqrt2(∣000⟩+∣111⟩)/2​ or the W vector (∣001⟩+∣010⟩+∣100⟩)/3(|001\rangle+|010\rangle+|100\rangle)/\sqrt3(∣001⟩+∣010⟩+∣100⟩)/3​. For 0≤p≤10\le p\le10≤p≤1, put ρp=p∣ψ⟩⟨ψ∣+(1−p)18/8\rho_p=p|\psi\rangle\langle\psi|+(1-p)\mathbf1_8/8ρp​=p∣ψ⟩⟨ψ∣+(1−p)18​/8. Define I=S(AB)+S(AC)+S(BC)−2S(ABC)I= S(AB)+S(AC)+S(BC)-2S(ABC)I=S(AB)+S(AC)+S(BC)−2S(ABC), Ix=S(A)+S(B)+S(C)−S(ABC)I_x=S(A)+S(B)+S(C)-S(ABC)Ix​=S(A)+S(B)+S(C)−S(ABC), and Ic=S(A)+S(B)+S(C)−S(AB)−S(AC)−S(BC)+S(ABC)I_c=S(A)+S(B)+S(C)-S(AB)-S(AC)-S(BC)+S(ABC)Ic​=S(A)+S(B)+S(C)−S(AB)−S(AC)−S(BC)+S(ABC), evaluated on ρp\rho_pρp​ in bits. Let EN(A:BC)=log⁡2∥ρpTA∥1E_N(A:BC)=\log_2\|\rho_p^{T_A}\|_1EN​(A:BC)=log2​∥ρpTA​​∥1​, where TAT_ATA​ is computational partial transpose and ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the full trace norm. Then

Ic(ρ0)=Ic(ρ1)=0,0<p<1⟹Ic(ρp)<0,I(ρp)=0⟺p=0,p>0⟹I(ρp)>0,Ix(ρp)≤I(ρp),Ic(ρp)≤EN(A:BC)ρp,p>0⟹Ic(ρp)<EN(A:BC)ρp.\begin{gathered} I_c(\rho_0)=I_c(\rho_1)=0,\qquad 0<p<1\Longrightarrow I_c(\rho_p)<0,\\ I(\rho_p)=0\Longleftrightarrow p=0,\qquad p>0\Longrightarrow I(\rho_p)>0,\\ I_x(\rho_p)\le I(\rho_p),\qquad I_c(\rho_p)\le E_N(A:BC)_{\rho_p},\\ p>0\Longrightarrow I_c(\rho_p)<E_N(A:BC)_{\rho_p}. \end{gathered}Ic​(ρ0​)=Ic​(ρ1​)=0,0<p<1⟹Ic​(ρp​)<0,I(ρp​)=0⟺p=0,p>0⟹I(ρp​)>0,Ix​(ρp​)≤I(ρp​),Ic​(ρp​)≤EN​(A:BC)ρp​​,p>0⟹Ic​(ρp​)<EN​(A:BC)ρp​​.​

These are comparisons for the two displayed families, not for arbitrary mixed states.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P43

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- These accepted register types are definitionally the required finite tensor bases.

open QAlgorithms.Papers.Independent.Claimed50.P33 (RegisterBasis SubBasis)

open QAlgorithms.Papers.Independent.Information100.P21 (ghzKet)

/-- Figure 2(a,b), PDF p.4: every caption comparison on exactly the two qubit
families, including strict negativity-versus-common-information comparison for p>0.
At p=0 the comparison is non-strict. Panel (c) is deferred. -/
theorem noisy_qubit_information (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
    ∀ psi : EuclideanSpace ℂ (HomBasis 3 2), psi = ghzKet 3 true ∨ psi = dickeQubitVector 3 1 →
    let rho := noisyQubits psi p
    ((p = 0 ∨ p = 1) → commonOn rho Finset.univ = 0) ∧
    ((0 < p ∧ p < 1) → commonOn rho Finset.univ < 0) ∧
    (alternativeOn rho Finset.univ = 0 ↔ p = 0) ∧
    (0 < p → 0 < alternativeOn rho Finset.univ) ∧
    conventionalOn rho Finset.univ ≤ alternativeOn rho Finset.univ ∧
    commonOn rho Finset.univ ≤ logarithmicNegativity rho ∧
    (0 < p → commonOn rho Finset.univ < logarithmicNegativity rho) := by sorry

end QAlgorithms.Papers.Independent.Support50.P43

end
Source
Multiparty Quantum Mutual Information: An alternative definition, arXiv:1504.07176v2, PDF p. 4, Figure 2(a,b) caption
Read-back

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

For every real ppp with 0≤p≤10\le p\le10≤p≤1 and every vector ψ∈C{0,1}3\psi\in\mathbb C^{\{0,1\}^3}ψ∈C{0,1}3 equal to either

∣000⟩+∣111⟩2or∣001⟩+∣010⟩+∣100⟩3,\frac{|000\rangle+|111\rangle}{\sqrt2} \quad\text{or}\quad \frac{|001\rangle+|010\rangle+|100\rangle}{\sqrt3},2​∣000⟩+∣111⟩​or3​∣001⟩+∣010⟩+∣100⟩​,

where ∣x⟩|x\rangle∣x⟩ denotes the vector with amplitude 111 at xxx and 000 elsewhere, set ρ=p∣ψ⟩⟨ψ∣+1−p8I8\rho=p|\psi\rangle\langle\psi|+\frac{1-p}{8}I_8ρ=p∣ψ⟩⟨ψ∣+81−p​I8​, with (∣ψ⟩⟨ψ∣)x,y=ψxψy‾(|\psi\rangle\langle\psi|)_{x,y}=\psi_x\overline{\psi_y}(∣ψ⟩⟨ψ∣)x,y​=ψx​ψy​​. For each subset S⊆{0,1,2}S\subseteq\{0,1,2\}S⊆{0,1,2}, let ρS\rho_SρS​ be the reduced matrix whose entry at labels a,ba,ba,b on SSS is the sum of ρx,y\rho_{x,y}ρx,y​ over all full labels x,yx,yx,y restricting to a,ba,ba,b on SSS and agreeing outside SSS, and put HS=−Re⁡tr⁡f(ρS)H_S=-\operatorname{Re}\operatorname{tr}f(\rho_S)HS​=−Retrf(ρS​), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus. Define

C=H{0}+H{1}+H{2}−H{0,1}−H{0,2}−H{1,2}+H{0,1,2},A=H{0,1}+H{0,2}+H{1,2}−2H{0,1,2},C=H_{\{0\}}+H_{\{1\}}+H_{\{2\}} -H_{\{0,1\}}-H_{\{0,2\}}-H_{\{1,2\}}+H_{\{0,1,2\}}, \qquad A=H_{\{0,1\}}+H_{\{0,2\}}+H_{\{1,2\}}-2H_{\{0,1,2\}},C=H{0}​+H{1}​+H{2}​−H{0,1}​−H{0,2}​−H{1,2}​+H{0,1,2}​,A=H{0,1}​+H{0,2}​+H{1,2}​−2H{0,1,2}​,

and V=H{0}+H{1}+H{2}−H{0,1,2}V=H_{\{0\}}+H_{\{1\}}+H_{\{2\}}-H_{\{0,1,2\}}V=H{0}​+H{1}​+H{2}​−H{0,1,2}​. Also define

E=log⁡2 ⁣(Re⁡tr⁡(ρT0)†ρT0),(ρT0)a,b=ρ(b0,a1,a2),(a0,b1,b2),E=\log_2\!\left(\operatorname{Re}\operatorname{tr} \sqrt{(\rho^{T_0})^\dagger\rho^{T_0}}\right), \qquad (\rho^{T_0})_{a,b} =\rho_{(b_0,a_1,a_2),(a_0,b_1,b_2)},E=log2​(Retr(ρT0​)†ρT0​​),(ρT0​)a,b​=ρ(b0​,a1​,a2​),(a0​,b1​,b2​)​,

where the matrix square root is given by continuous functional calculus. Then all of the following hold: if p=0p=0p=0 or p=1p=1p=1, then C=0C=0C=0; if 0<p<10<p<10<p<1, then C<0C<0C<0; A=0A=0A=0 if and only if p=0p=0p=0; if p>0p>0p>0, then A>0A>0A>0; V≤AV\le AV≤A; C≤EC\le EC≤E; and if p>0p>0p>0, then C<EC<EC<E. These assertions include both endpoints: p=0p=0p=0 gives ρ=I8/8\rho=I_8/8ρ=I8​/8, and p=1p=1p=1 gives ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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