§3, unnumbered: security extends to mixtures of source states
ProvedQAlgorithms.Papers.Independent.Advance50.P18.mixture_extensionLet be a set of unit -qubit vectors, and let a private quantum channel use a finite key law , fixed full-space unitaries , a fixed mixed ancilla , and fixed full output . Let be any finite mixture of source states: , where , , and . Then the same channel satisfies
For every key , conjugating its encoded state by recovers exactly. Thus the same key distribution and ancilla securely convey every mixture of -states. This conclusion does not enlarge a restricted source to all density matrices.
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.4, §3: the same scheme and fixed output work on all finite mixtures of S-states;
conjugation by the inverse keyed unitary recovers the message and its original ancilla. -/
theorem mixture_extension (n a N : ℕ) (S : Set ((EuclideanSpace ℂ (Qubits n))))
(E : KeyedUnitaryEnsemble (Fin N) (Qubits n × Qubits a))
(anc : (Matrix (Qubits a) (Qubits a) ℂ)) (rho0 : (Matrix (Qubits n × Qubits a) (Qubits n × Qubits a) ℂ))
(h : PQC S E anc rho0) (rho : (Matrix (Qubits n) (Qubits n) ℂ)) (hmix : IsSourceMixture S rho) :
encrypt E (Matrix.kronecker rho anc) = rho0 ∧
∀ i : Fin N, (E.U i).conjTranspose *
(E.U i * Matrix.kronecker rho anc * (E.U i).conjTranspose) * E.U i =
Matrix.kronecker rho anc := by sorry
end
end QAlgorithms.Papers.Independent.Advance50.P18
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be arbitrary natural numbers, let be any set of complex vectors indexed by -bit Boolean strings, let be an ensemble acting on pairs of an -bit string and an -bit string, and let and be complex matrices on the -bit strings and on those pairs, respectively. Assume that all , , every is unitary, both and are positive semidefinite with trace , and every has norm and satisfies
Let be any complex matrix on the -bit strings for which there exist a natural number , real weights , and vectors , indexed by , such that every , , every belongs to and has norm , and . Membership and normalization are required even for indices with . Then
and, for every , including keys of weight zero,
Here stars denote conjugate transposes and is the matrix Kronecker product. Zero-length registers are allowed. The ensemble assumptions cannot hold when ; the mixture assumptions cannot hold with or with empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.