The error-register purification dominates the mixed probes
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.purification_dominatesLet . 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.
Writing , we have
The information inequality holds for any normalized prior on . Here optimizes the mutual information over finite POVMs. This supplies an information upper bound by enlarging Eve's hypothetical system, without claiming a physical cloning operation.
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
/-- Section 3.2, PDF p.6: the error-labelled purification has exactly Eve's
mixed-state marginal and dominates its accessible information. Priors include
the uniform code/syndrome ensembles used later; no cloning operation is claimed. -/
theorem purification_dominates {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)) :
let E := conditionedSymmetric U e0 iT jT
(∀ i, traceRight (pureDensity (errorPurification E i)) = probeDensity E i) ∧
∀ p : Law (Qubits n),
ensembleAccessibleInfo p.prob (probeDensity E) id ≤
ensembleAccessibleInfo p.prob (fun i => pureDensity (errorPurification E i)) id := 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 , and length- strings , use XOR addition, concatenation , and the sign with exponent modulo . Let
and assume . On the index set , define
For every length- string , tracing out the coordinate of the matrix gives exactly , that is,
Furthermore, for every probability law on ,
Here, for any family of matrices on a finite index set, is the real supremum over all positive integers and positive semidefinite matrices with of , where , , , and with . The law may assign zero probability to any inputs.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.