No maximally entangled two-qubit Hardy state
OpenQAlgorithms.Papers.Independent.Intakethird100.P47.hardy_not_maximally_entangledFor the noncommuting local projective bases (3), let be a positive semidefinite two-qubit matrix of trace one satisfying all four positive-success Hardy conditions (1). Then . Since every satisfying density is pure, this excludes maximal entanglement in the source two-qubit setting.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P47
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Identify the Boolean values false and true with and , and let be the standard basis of . For every choice of complex numbers , indexed by , satisfying and for each , define and , with . For every positive semidefinite complex matrix indexed by with trace , define , where . If , , , and , then the matrix obtained by tracing over the first coordinate is not half the identity:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.