Theorem 4.1: full tensor-Pauli private channel
ProvedQAlgorithms.Papers.Independent.Advance50.P18.theorem_4_1Let and let , , , and . For , set . The fixed, ancilla-free encoder that chooses uniformly and applies is a private quantum channel on all unit -qubit vectors. In particular,
The source’s Kraus coefficient is ; its square is the key probability . Each keyed unitary can be inverted exactly. This is the full quantum one-time pad.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P18
namespace QAlgorithms.Papers.Independent.Advance50.P18
open scoped ComplexConjugate
noncomputable section
variable {K I A : Type*} [Fintype K] [DecidableEq K]
[Fintype I] [DecidableEq I] [Fintype A] [DecidableEq A]
/-- PDF p.5, Theorem 4.1: the uniform full tensor-Pauli ensemble is a PQC. -/
theorem theorem_4_1 (n : ℕ) :
BarePQC (allPure (Qubits n)) (fullPauli n) (sourceMixedIdentity (Qubits n)) := by sorry
end
end QAlgorithms.Papers.Independent.Advance50.P18
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , consider keys with weights and matrices on Boolean strings of length given by
where the single-bit coordinate order is . The theorem asserts that these weights are nonnegative and sum to , every is unitary, the matrix is positive semidefinite with trace , and every vector in the complex Euclidean space on the -bit strings with norm satisfies
with stars denoting conjugate transposes. This includes : the sole empty key has weight , the empty product gives matrix , and the asserted output is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.