Public-permutation symmetrization and common relabeling
ProvedQAlgorithms.Papers.Independent.Support50.P22.qkdSymmetrizationLet , , and let be a finite-dimensional classical-output CPTP QKD protocol with both keys, length branch, and full public transcript. Define the symmetrized channel by choosing each with probability , applying its tensor permutation to the input, and recording publicly:
For each , let relabel the public permutation as , leaving all other output registers untouched. Then and are CPTP, and
Here replaces the keys by an identical uniform pair while preserving length and transcript. This enforces the covariance needed for the QKD criterion without discarding the public permutation.
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
/-- Public-permutation symmetrization, PDF p.3 and p.4 footnote 16. Both
identities use the same relabeling, which leaves both keys unchanged.
In Theorem 1's orientation the corresponding channel is K_pi inverse. -/
theorem qkdSymmetrization (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) :
IsChannel (publicSymmetrize E) ∧
∀ pi : Equiv.Perm (Fin n), IsChannel (relabelPublic (B := KeyOut L C len) pi) ∧
(∀ X, relabelPublic pi (publicSymmetrize E (permuteInput pi X)) = publicSymmetrize E X) ∧
(∀ X, relabelPublic pi
(idTensorSuperop (R := Equiv.Perm (Fin n)) (keyReplacement len)
(publicSymmetrize E (permuteInput pi X))) =
idTensorSuperop (R := Equiv.Perm (Fin n)) (keyReplacement len)
(publicSymmetrize E X)) := 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 . Let , and let consist of with . Suppose is a complex linear channel from matrices on to matrices on , and is diagonal for every input . A channel means a finite Kraus map with . For each position permutation , set , define
and let . Here is zero unless , in which case it equals ; applies this replacement separately to every matrix block with fixed public labels . Then is a channel, and for every , is a channel and, for every input matrix ,
The statement includes and zero key lengths.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.