Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

White-noise Hardy statistics with signed functionals

Open
QAlgorithms.Papers.Independent.Intakethird100.P47.noisy_hardy_statistics

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For each party P∈{A,B}P\in\{A,B\}P∈{A,B}, let αP,βP∈C\alpha_P,\beta_P\in\mathbb CαP​,βP​∈C satisfy ∣αP∣2+∣βP∣2=1|\alpha_P|^2+|\beta_P|^2=1∣αP​∣2+∣βP​∣2=1 and 0<∣αP∣<10<|\alpha_P|<10<∣αP​∣<1. The unprimed measurement basis is ∣0⟩,∣1⟩|0\rangle,|1\rangle∣0⟩,∣1⟩, and the primed basis is ∣0′⟩P=αP∣0⟩+βP∣1⟩|0'\rangle_P=\alpha_P|0\rangle+\beta_P|1\rangle∣0′⟩P​=αP​∣0⟩+βP​∣1⟩, ∣1′⟩P=βP‾∣0⟩−αP‾∣1⟩|1'\rangle_P=\overline{\beta_P}|0\rangle-\overline{\alpha_P}|1\rangle∣1′⟩P​=βP​​∣0⟩−αP​​∣1⟩. Write ∣ψH⟩|\psi_H\rangle∣ψH​⟩ for the last vector obtained by the ordered Gram–Schmidt construction (2)–(4), and pH(a,b∣A,B)p_H(a,b\mid A,B)pH​(a,b∣A,B) for its Born probabilities.

Let 0≤η≤10\le\eta\le10≤η≤1, let q=pH(00∣00)q=p_H(00\mid00)q=pH​(00∣00), and measure the state ρ(η)=(1−η)I4/4+η∣ψH⟩⟨ψH∣\rho(\eta)=(1-\eta)I_4/4+\eta|\psi_H\rangle\langle\psi_H|ρ(η)=(1−η)I4​/4+η∣ψH​⟩⟨ψH​∣ in these bases. This is a density matrix, with

pη(00∣00)=ηq+1−η4,pη(00∣10)=pη(00∣01)=pη(11∣11)=1−η4.p_\eta(00\mid00)=\eta q+\frac{1-\eta}{4},\qquad p_\eta(00\mid10)=p_\eta(00\mid01)=p_\eta(11\mid11)=\frac{1-\eta}{4}.pη​(00∣00)=ηq+41−η​,pη​(00∣10)=pη​(00∣01)=pη​(11∣11)=41−η​.

For H=(p(00∣00),−p(00∣10),−p(00∣01),−p(11∣11))H=(p(00\mid00),-p(00\mid10),-p(00\mid01),-p(11\mid11))H=(p(00∣00),−p(00∣10),−p(00∣01),−p(11∣11)), as defined by the coefficients after (12),

H(pη)=(ηq+1−η4,−1−η4,−1−η4,−1−η4).H(p_\eta)=\left(\eta q+\frac{1-\eta}{4},-\frac{1-\eta}{4},-\frac{1-\eta}{4},-\frac{1-\eta}{4}\right).H(pη​)=(ηq+41−η​,−41−η​,−41−η​,−41−η​).

This keeps event probabilities and signed functionals distinct, with η=1\eta=1η=1 the ideal state.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P47
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P47

open scoped ComplexConjugate

open scoped BigOperators

/-- IV B–C, PDF pp.5–6, (13),(16): event probabilities and signed H values.
Printed (16) has positive h2,h3,h4; changed to negative values, forced by the negative
coefficients defining H in (12), p.5. eta remains visibility, with eta=1 ideal.
This source correction requires independent moderation. -/
theorem noisy_hardy_statistics (d : HardyParameters) (eta : ℝ)
    (heta : 0 ≤ eta ∧ eta ≤ 1) :
    let p := hardyBehavior d (noisyHardy d eta)
    let q := hardyBehavior d (pureDensity (psiH d)) false false false false
    IsDensityMatrix (noisyHardy d eta) ∧
    p false false false false = eta * q + (1 - eta) / 4 ∧
    p true false false false = (1 - eta) / 4 ∧
    p false true false false = (1 - eta) / 4 ∧
    p true true true true = (1 - eta) / 4 ∧
    hardyStatistics p = ![eta * q + (1 - eta) / 4,
      -(1 - eta) / 4, -(1 - eta) / 4, -(1 - eta) / 4] := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P47
Source
Device-independent quantum key distribution based on measurement inputs, arXiv:1308.6447v3, PDF p. 6, IV B–C: noisy statistics (13), (16), with signed H convention
Read-back

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

For every parameter record ddd consisting of functions α,β:{0,1}→C\alpha,\beta:\{0,1\}\to\mathbb Cα,β:{0,1}→C satisfying ∣αP∣2+∣βP∣2=1|\alpha_P|^2+|\beta_P|^2=1∣αP​∣2+∣βP​∣2=1 and 0<∣αP∣<10<|\alpha_P|<10<∣αP​∣<1 for each PPP, and every real η\etaη with 0≤η≤10\le\eta\le10≤η≤1, the following holds, including both endpoints of this interval. Write false as 000 and true as 111, let e0,e1e_0,e_1e0​,e1​ be the standard basis of C2\mathbb C^2C2, and put aP=αPe0+βPe1a_P=\alpha_Pe_0+\beta_Pe_1aP​=αP​e0​+βP​e1​, bP=βP‾e0−αP‾e1b_P=\overline{\beta_P}e_0-\overline{\alpha_P}e_1bP​=βP​​e0​−αP​​e1​. Define (ϕ0,ϕ1,ϕ2,ϕ3)=(b0⊗b1,e0⊗a1,a0⊗e0,e0⊗e0)(\phi_0,\phi_1,\phi_2,\phi_3)=(b_0\otimes b_1,e_0\otimes a_1,a_0\otimes e_0,e_0\otimes e_0)(ϕ0​,ϕ1​,ϕ2​,ϕ3​)=(b0​⊗b1​,e0​⊗a1​,a0​⊗e0​,e0​⊗e0​), where tensor coordinates are products of coordinates, and define v0=ϕ0v_0=\phi_0v0​=ϕ0​ and

vr=(1−∑s<r∣⟨vs,ϕr⟩∣2)−1(ϕr−∑s<r⟨vs,ϕr⟩vs)(r=1,2,3),ψ=v3.v_r= \left(\sqrt{1-\sum_{s<r}|\langle v_s,\phi_r\rangle|^2}\right)^{-1} \left(\phi_r-\sum_{s<r}\langle v_s,\phi_r\rangle v_s\right) \quad(r=1,2,3), \qquad \psi=v_3.vr​=​1−s<r∑​∣⟨vs​,ϕr​⟩∣2​​−1(ϕr​−s<r∑​⟨vs​,ϕr​⟩vs​)(r=1,2,3),ψ=v3​.

For any vector uuu, write Ru(x,y)=u(x)u(y)‾R_u(x,y)=u(x)\overline{u(y)}Ru​(x,y)=u(x)u(y)​. Set ρη=1−η4I+ηRψ\rho_\eta=\frac{1-\eta}{4}I+\eta R_\psiρη​=41−η​I+ηRψ​, where III is the identity on C{0,1}2\mathbb C^{\{0,1\}^2}C{0,1}2. Define ℓP,0,a=ea\ell_{P,0,a}=e_aℓP,0,a​=ea​, ℓP,1,0=aP\ell_{P,1,0}=a_PℓP,1,0​=aP​, ℓP,1,1=bP\ell_{P,1,1}=b_PℓP,1,1​=bP​, put p(A,B,a,b)=Re⁡tr⁡(Rℓ0,A,a⊗ℓ1,B,bρη)p(A,B,a,b)=\operatorname{Re}\operatorname{tr}(R_{\ell_{0,A,a}\otimes\ell_{1,B,b}}\rho_\eta)p(A,B,a,b)=Retr(Rℓ0,A,a​⊗ℓ1,B,b​​ρη​), and set q=Re⁡tr⁡(Rϕ3Rψ)q=\operatorname{Re}\operatorname{tr}(R_{\phi_3}R_\psi)q=Retr(Rϕ3​​Rψ​). Then ρη\rho_\etaρη​ is positive semidefinite with trace 111, and

p(0,0,0,0)=ηq+1−η4,p(1,0,0,0)=p(0,1,0,0)=p(1,1,1,1)=1−η4.p(0,0,0,0)=\eta q+\frac{1-\eta}{4},\qquad p(1,0,0,0)=p(0,1,0,0)=p(1,1,1,1)=\frac{1-\eta}{4}.p(0,0,0,0)=ηq+41−η​,p(1,0,0,0)=p(0,1,0,0)=p(1,1,1,1)=41−η​.

Moreover, the four-entry function indexed in order by 0,1,2,30,1,2,30,1,2,3, whose entries are p(0,0,0,0)p(0,0,0,0)p(0,0,0,0), −p(1,0,0,0)-p(1,0,0,0)−p(1,0,0,0), −p(0,1,0,0)-p(0,1,0,0)−p(0,1,0,0), and −p(1,1,1,1)-p(1,1,1,1)−p(1,1,1,1), equals

(ηq+1−η4, −1−η4, −1−η4, −1−η4).\left(\eta q+\frac{1-\eta}{4},\ -\frac{1-\eta}{4},\ -\frac{1-\eta}{4},\ -\frac{1-\eta}{4}\right).(ηq+41−η​, −41−η​, −41−η​, −41−η​).
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me