Hardy success probability of the constructed state
OpenQAlgorithms.Papers.Independent.Intakethird100.P47.hardy_success_probabilityFor each party , let satisfy and . The unprimed measurement basis is , and the primed basis is , . Write for the last vector obtained by the ordered Gram–Schmidt construction (2)–(4), and for its Born probabilities.
Order the product vectors as , , , , and denote their Gram–Schmidt vectors by . Then
The denominator is strictly positive. This evaluates the success probability of the source's explicitly constructed state.
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: all equalities in the displayed Hardy success formula following (4).
Strict alpha bounds in HardyParameters exclude the zero denominator. -/
theorem hardy_success_probability (d : HardyParameters) :
let q := hardyBehavior d (pureDensity (psiH d)) false false false false
q = ‖inner ℂ (psiH d) (hardyPhi d 3)‖ ^ 2 ∧
q = 1 - ∑ i : Fin 3, ‖inner ℂ (hardyGS d (Fin.castSucc i)) (hardyPhi d 3)‖ ^ 2 ∧
q = (‖d.alpha false * d.alpha true‖ ^ 2 * ‖d.beta false * d.beta true‖ ^ 2) /
(1 - ‖d.alpha false * d.alpha true‖ ^ 2) ∧
0 < 1 - ‖d.alpha false * d.alpha true‖ ^ 2 := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P47
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every parameter record consisting of complex functions on the Booleans with and for each Boolean , write false as and true as , let be the standard basis of , and set , . Define , , , and , where tensor coordinates are products of the corresponding coordinates. Set and, for , set
For any vector , let , and define . Then all three equalities and the strict inequality below hold:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.