Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No maximally entangled two-qubit Hardy state

Open
QAlgorithms.Papers.Independent.Intakethird100.P47.hardy_not_maximally_entangled

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

prove2quantum

For the noncommuting local projective bases (3), let ρ\rhoρ be a positive semidefinite two-qubit matrix of trace one satisfying all four positive-success Hardy conditions (1). Then Tr⁡Aρ≠I2/2\operatorname{Tr}_A\rho\ne I_2/2TrA​ρ=I2​/2. Since every satisfying density is pure, this excludes maximal entanglement in the source two-qubit setting.

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

open scoped ComplexConjugate

open scoped BigOperators

/-- II A, PDF p.3, citing [15]: no maximally entangled two-qubit state satisfies
Hardy's positive-success constraints for the bases (3). Its Bob marginal is not I2/2;
purity of any satisfying density is asserted separately in hardy_no_mixed_state. -/
theorem hardy_not_maximally_entangled (d : HardyParameters)
    (rho : Matrix (Bool × Bool) (Bool × Bool) ℂ)
    (hrho : IsDensityMatrix rho) (hHardy : HardyConditions (hardyBehavior d rho)) :
    traceLeft rho ≠ (1 / 2 : ℂ) • (1 : Matrix Bool Bool ℂ) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P47
Source
Device-independent quantum key distribution based on measurement inputs, arXiv:1308.6447v3, PDF p. 3, II A: no maximally entangled qubit Hardy state [15]
Read-back

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

Identify the Boolean values false and true with 000 and 111, and let e0,e1e_0,e_1e0​,e1​ be the standard basis of C2\mathbb C^2C2. For every choice of complex numbers αP,βP\alpha_P,\beta_PαP​,βP​, indexed by P∈{0,1}P\in\{0,1\}P∈{0,1}, 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, define uP=αPe0+βPe1u_P=\alpha_Pe_0+\beta_Pe_1uP​=αP​e0​+βP​e1​ and vP=βP‾e0−αP‾e1v_P=\overline{\beta_P}e_0-\overline{\alpha_P}e_1vP​=βP​​e0​−αP​​e1​, with (r⊗s)a,b=rasb(r\otimes s)_{a,b}=r_as_b(r⊗s)a,b​=ra​sb​. For every positive semidefinite complex matrix ρ\rhoρ indexed by {0,1}2\{0,1\}^2{0,1}2 with trace 111, define qρ(w)=Re⁡tr⁡((ww∗)ρ)q_\rho(w)=\operatorname{Re}\operatorname{tr}((ww^*)\rho)qρ​(w)=Retr((ww∗)ρ), where (ww∗)z,z′=wzwz′‾(ww^*)_{z,z'}=w_z\overline{w_{z'}}(ww∗)z,z′​=wz​wz′​​. If qρ(e0⊗e0)>0q_\rho(e_0\otimes e_0)>0qρ​(e0​⊗e0​)>0, qρ(u0⊗e0)=0q_\rho(u_0\otimes e_0)=0qρ​(u0​⊗e0​)=0, qρ(e0⊗u1)=0q_\rho(e_0\otimes u_1)=0qρ​(e0​⊗u1​)=0, and qρ(v0⊗v1)=0q_\rho(v_0\otimes v_1)=0qρ​(v0​⊗v1​)=0, then the matrix obtained by tracing over the first coordinate is not half the identity:

(∑a∈{0,1}ρ(a,b),(a,b′))b,b′∈{0,1}≠12I2.\left(\sum_{a\in\{0,1\}}\rho_{(a,b),(a,b')}\right)_{b,b'\in\{0,1\}} \ne \frac12 I_2.​a∈{0,1}∑​ρ(a,b),(a,b′)​​b,b′∈{0,1}​=21​I2​.
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