Whole-key information versus disturbance
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.whole_key_information_disturbanceLet . Fix an unrestricted joint unitary attack on the ideal two-level signals and a probe initially in a fixed pure basis state. Fix the preparation/measurement bases, a balanced test/information partition, and announced test strings whose probability is positive. Symmetrize the attack coherently by Eq. (2), then condition on this test outcome using its actual probability. Write for the resulting normalized information-register probe coefficients, with Alice's information bits uniform. These coefficients are constructed from the unitary, rather than postulated to have any Fourier or information property. The public classical channel is unjammable and Eve has access only to the quantum channel and the public transcript.
Fix a binary code , a uniform announced syndrome coset , and PA rows that are jointly independent modulo . All choices are fixed independently of the unrevealed coset element; this implies . Let be the final key and
For every real , The whole-key accessible information of the purified ensemble satisfies
where is the conjugate-information-basis error law of the same conditional attack. The minimum accounts for disclosure of every other PA bit before bounding a single bit.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P77
open scoped BigOperators ComplexConjugate ComplexOrder
open QAlgorithms
-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)
open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.9, Eq.(8): purified whole-key information versus disturbance, with all other
key bits disclosed in the distance. PA independence means full rank modulo ECC;
all public choices are fixed independently of the unknown uniform coset element. -/
theorem whole_key_information_disturbance {n d m : ℕ} (hn : 1 ≤ n) (hm : 1 ≤ m)
(U : Matrix.unitaryGroup (Fin d × Qubits (n + n)) ℂ) (e0 : Fin d)
(iT jT : Qubits n)
(hpos : 0 < testProbability (coherentBitSymmetrize (attackProbes U e0)) iT jT (fun _ => false))
(C : Submodule (ZMod 2) (Fin n → ZMod 2)) (i0 : Fin n → ZMod 2)
(V : Fin m → Fin n → ZMod 2) (hV : IndependentPA C V)
(alpha : ℝ) (ha : 0 < alpha) :
wholeKeyInformation (conditionedSymmetric U e0 iT jT) C i0 V ≤
m * (alpha + conjugateTail (conditionedSymmetric U e0 iT jT)
(keyDistance C V) / alpha) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , with , let be unitary on the basis , choose , and choose . With bitwise XOR , concatenation , and , define
where range over -bit strings, over -bit strings, and ; assume . Let , , and , and assume that for every , implies , where . For , let be the bit string for , put , and define the Boolean key to be true exactly when . Let be the real supremum, over all finite measurements with a positive number of positive semidefinite effects summing to the identity, of the mutual information of
where mutual information is , with base-two Shannon entropy and . Define
Then, for every real ,
Both minima are over nonempty finite sets, and the assumed independence modulo makes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.