Collective-input mixture bound (5)
ProvedQAlgorithms.Papers.Independent.Support50.P22.collectiveMixtureLet , , and . Let be a finite-dimensional classical-output CPTP QKD map with variable key length and complete public transcript, and let be its length- and transcript-preserving ideal key replacement. Let . Suppose that for every normalized pure density ,
Then the maximum over these pure states is attained and, for the mixed Haar extension ,
The maximum ranges over all unit vectors modulo the irrelevant phase of their densities. This transfers the collective-input bound to the mixed extension while retaining the adversary's register.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P22
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
open MeasureTheory
namespace QAlgorithms.Papers.Independent.Support50.P22
attribute [local instance] Classical.decEq Classical.propDecidable
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Information100.P69 (diamond)
open QAlgorithms.Papers.Independent.Dependency50.P18 (ClassicalOutput)
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P22.postselectionMatrixMeasurableSpace
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P22.postselectionMatrixBorelSpace
/-- Collective-input mixture bound, equation (5), PDF p.3. A maximizing pure
state is attained and dominates EVERY pure input, retaining the entire max
chain without an empty or unbounded real supremum. This input is the mixed
Haar extension, not its purification with an additional N. -/
theorem collectiveMixture (n d : ℕ) (hd : 0 < d)
{L C : Type} [Fintype L] [DecidableEq L] [Nonempty L]
[Fintype C] [DecidableEq C] [Nonempty C]
(len : L → ℕ)
(E : Matrix (Copies (Fin d) n) (Copies (Fin d) n) ℂ →ₗ[ℂ]
Matrix (KeyOut L C len) (KeyOut L C len) ℂ)
(hE : IsChannel E) (hclass : ClassicalOutput E)
(epsilonBar : ℝ) (hepsilon : 0 ≤ epsilonBar)
(hcollective : ∀ phi : EuclideanSpace ℂ (Fin d × Fin d), IsState phi →
traceNorm (tensorId (E - idealProtocol len E)
(pairedPower n d (pureDensity phi))) ≤ epsilonBar) :
∃ phiMax : EuclideanSpace ℂ (Fin d × Fin d), IsState phiMax ∧
(∀ phi : EuclideanSpace ℂ (Fin d × Fin d), IsState phi →
traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phi))) ≤
traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phiMax)))) ∧
traceNorm (tensorId (E - idealProtocol len E) (tauPair n d hd)) ≤
traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phiMax))) ∧
traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phiMax))) ≤
epsilonBar := by sorry
end QAlgorithms.Papers.Independent.Support50.P22
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let with , let be finite nonempty types with decidable equality, and fix . Put and let consist of , where . Let be a complex linear channel from matrices on to matrices on , and assume its output is diagonal for every input matrix. A channel here has a finite Kraus expression with . Define by discarding all output off-diagonal entries and, at fixed , assigning each equal key pair the diagonal value , with zero on unequal keys. For , define the matrix
on , and let , where is the law obtained by reshaping , for a Haar-distributed unitary on , into a array. Write
where the tensor extension applies the map to the first-register matrix in every fixed second-register block. For a real , assume for every with . Then there exists a vector with such that every unit vector satisfies , and
The statement includes , when the products defining are empty products equal to ; key lengths may also be zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.