Orthogonality of the Fourier components
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.fourier_orthogonalLet . 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.
For an information input , put , , and . Dot products are modulo two and inner products conjugate the first argument.
For distinct ,
Some components may vanish. The conclusion is pairwise orthogonality, which is the source's explicit meaning of “orthogonal basis.”
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
/-- Lemma 3.1, PDF p.6; Appendix D, pp.15--16: pairwise orthogonality, the
source's explicit 'i.e.' conclusion. Zero Fourier vectors remain permitted. -/
theorem fourier_orthogonal {n d : ℕ} (hn : 1 ≤ n)
(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))
(k l : Qubits n) (hkl : k ≠ l) :
inner ℂ (probeFourierComponent (conditionedSymmetric U e0 iT jT) k)
(probeFourierComponent (conditionedSymmetric U e0 iT jT) l) = 0 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For natural numbers with , a unitary matrix indexed by , an index , length- strings , and distinct length- strings , use XOR addition, concatenation , and with exponent modulo . Define
and assume , where have length , has length , and . Set
Then the two vectors indexed by satisfy
No nonzero or unit-norm condition is imposed on either Fourier component.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.