Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, unnumbered: security extends to mixtures of source states

Proved
QAlgorithms.Papers.Independent.Advance50.P18.mixture_extension

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let SSS be a set of unit nnn-qubit vectors, and let a private quantum channel use a finite key law pip_ipi​, fixed full-space unitaries UiU_iUi​, a fixed mixed ancilla ρa\rho_aρa​, and fixed full output ρ0\rho_0ρ0​. Let ρ\rhoρ be any finite mixture of source states: ρ=∑jqj∣ψj⟩⟨ψj∣\rho=\sum_j q_j|\psi_j\rangle\langle\psi_j|ρ=∑j​qj​∣ψj​⟩⟨ψj​∣, where ψj∈S\psi_j\in Sψj​∈S, qj≥0q_j\ge0qj​≥0, and ∑jqj=1\sum_jq_j=1∑j​qj​=1. Then the same channel satisfies

∑ipiUi(ρ⊗ρa)Ui†=ρ0.\sum_i p_iU_i(\rho\otimes\rho_a)U_i^\dagger=\rho_0.i∑​pi​Ui​(ρ⊗ρa​)Ui†​=ρ0​.

For every key iii, conjugating its encoded state by Ui†U_i^\daggerUi†​ recovers ρ⊗ρa\rho\otimes\rho_aρ⊗ρa​ exactly. Thus the same key distribution and ancilla securely convey every mixture of SSS-states. This conclusion does not enlarge a restricted source to all density matrices.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P18
Formal statement
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
Source
Private Quantum Channels and the Cost of Randomizing Quantum Information, arXiv:quant-ph/0003101v2, PDF p. 4, §3, unnumbered: security extends to mixtures of source states
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let n,a,Nn,a,Nn,a,N be arbitrary natural numbers, let SSS be any set of complex vectors indexed by nnn-bit Boolean strings, let E=(pi,Ui)i=0N−1E=(p_i,U_i)_{i=0}^{N-1}E=(pi​,Ui​)i=0N−1​ be an ensemble acting on pairs of an nnn-bit string and an aaa-bit string, and let anc\mathrm{anc}anc and ρ0\rho_0ρ0​ be complex matrices on the aaa-bit strings and on those pairs, respectively. Assume that all pi≥0p_i\geq0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, every UiU_iUi​ is unitary, both anc\mathrm{anc}anc and ρ0\rho_0ρ0​ are positive semidefinite with trace 111, and every ψ∈S\psi\in Sψ∈S has norm 111 and satisfies

∑i=0N−1piUi((ψψ∗)⊗anc)Ui∗=ρ0,(ψψ∗)b,c=ψbψc‾.\sum_{i=0}^{N-1}p_iU_i\bigl((\psi\psi^*)\otimes\mathrm{anc}\bigr)U_i^*=\rho_0, \qquad (\psi\psi^*)_{b,c}=\psi_b\overline{\psi_c}.i=0∑N−1​pi​Ui​((ψψ∗)⊗anc)Ui∗​=ρ0​,(ψψ∗)b,c​=ψb​ψc​​.

Let ρ\rhoρ be any complex matrix on the nnn-bit strings for which there exist a natural number rrr, real weights qjq_jqj​, and vectors ψj\psi_jψj​, indexed by 0≤j<r0\leq j<r0≤j<r, such that every qj≥0q_j\geq0qj​≥0, ∑jqj=1\sum_jq_j=1∑j​qj​=1, every ψj\psi_jψj​ belongs to SSS and has norm 111, and ρ=∑jqjψjψj∗\rho=\sum_jq_j\psi_j\psi_j^*ρ=∑j​qj​ψj​ψj∗​. Membership and normalization are required even for indices with qj=0q_j=0qj​=0. Then

∑i=0N−1piUi(ρ⊗anc)Ui∗=ρ0,\sum_{i=0}^{N-1}p_iU_i(\rho\otimes\mathrm{anc})U_i^*=\rho_0,i=0∑N−1​pi​Ui​(ρ⊗anc)Ui∗​=ρ0​,

and, for every i∈{0,…,N−1}i\in\{0,\ldots,N-1\}i∈{0,…,N−1}, including keys of weight zero,

Ui∗(Ui(ρ⊗anc)Ui∗)Ui=ρ⊗anc.U_i^*\bigl(U_i(\rho\otimes\mathrm{anc})U_i^*\bigr)U_i =\rho\otimes\mathrm{anc}.Ui∗​(Ui​(ρ⊗anc)Ui∗​)Ui​=ρ⊗anc.

Here stars denote conjugate transposes and ⊗\otimes⊗ is the matrix Kronecker product. Zero-length registers are allowed. The ensemble assumptions cannot hold when N=0N=0N=0; the mixture assumptions cannot hold with r=0r=0r=0 or with SSS empty.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me