Conjugate-basis error law
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.conjugate_error_lawLet . 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.
Change the information input and output bases to their conjugates, leaving the attack, test bases, and transcript fixed. If is the resulting error probability, averaged over uniform information inputs, then
The conjugate coefficients are computed from by . This connects the Fourier spectrum to the counterfactual disturbance of the same attack.
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.2, PDF p.7, Eq.(5); Appendix E, pp.16--17: the error law in the
conjugate information bases of the SAME conditional attack equals d_c squared. -/
theorem conjugate_error_law {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))
(c : Qubits n) :
probeErrorProbability (conjugateProbes (conditionedSymmetric U e0 iT jT)) c =
fourierWeight (conditionedSymmetric U e0 iT jT) c := 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 a unitary matrix indexed by , choose , and choose . Write for bitwise XOR, for concatenation, and . For and , define
Assume , and define vectors by . Define
Then
The choice of requires , and the normalization uses the test weight with the information input fixed to the all-zero string.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.