Measuring an ideal EPR pair yields a perfect secret common bit
OpenQAlgorithms.Papers.Independent.Intakethird100.P06.idealEpr_perfectSecretBitLet Alice and Bob be qubits, let be any Hilbert space held by Eve, and let be any normalized positive trace-class density with exact marginal , where . Both parties measure in the displayed basis. Let be the unnormalized Eve block for outcomes , and let . Then is normalized and
Consequently the outcomes and each have probability , the outcomes and have probability zero, and the common bit is exactly independent of Eve. Eve need not purify , and her Hilbert dimension is unrestricted.
The operator identity captures perfect secrecy against every Eve measurement. It concerns a single ideal pair; it does not assert a noisy-protocol security theorem or a key rate.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P06
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P06
open scoped BigOperators
open QAlgorithms.Papers.Independent.Dependency50.P33 (NuclearExpansion)
open QAlgorithms.Papers.Independent.Frontier18.P09 (partialTraceRightCoeff)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Section II, arXiv:quant-ph/0307120v1, PDF p.6, using the exact state
(1) on p.5: both basis measurements give the same uniform bit independent of
Eve. The full unnormalized operator blocks encode secrecy against every Eve
measurement, in arbitrary Hilbert dimension, even when omega is mixed.
No noisy-protocol or asymptotic key-rate claim is made. -/
theorem idealEpr_perfectSecretBit {E : Type}
(omega : Matrix ((Opinion × Opinion) × E) ((Opinion × Opinion) × E) ℂ)
(hstate : IsCoordinateDensity omega) (hepr : partialTraceRightCoeff omega = eprDensity) :
IsCoordinateDensity (traceLeft omega) ∧
∀ a b : Opinion, eveBlock omega a b =
if a = b then (1 / 2 : ℂ) • traceLeft omega else 0 := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P06
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be the two-element set of one-bit strings, let be any type, and let be a complex matrix indexed by . Write when and , and zero otherwise. Assume that admits an expansion with and summable , that every finite quadratic form is real and nonnegative for every finite and every complex function , and that its real diagonal is summable with sum . Assume also that for every , using the total infinite-sum convention of zero for a nonsummable family. Define . Then admits an expansion with and summable , all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum ; moreover, for every , the matrix with entries equals if and equals the zero matrix otherwise. No finiteness or countability assumption is imposed on ; for empty , the assumed diagonal sum of is impossible.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.