Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.3: when the constant output must be maximally mixed

Proved
QAlgorithms.Papers.Independent.Advance50.P18.theorem_4_3

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

prove2quantum

Let SSS be a set of unit nnn-qubit vectors and let (pi,Ui)(p_i,U_i)(pi​,Ui​) be an ancilla-free private quantum channel with fixed output density ρ0\rho_0ρ0​. Suppose that I2n/2nI_{2^n}/2^nI2n​/2n is a finite probability mixture of the projectors ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|∣ψ⟩⟨ψ∣ with ψ∈S\psi\in Sψ∈S. Then

ρ0=I2n/2n.\rho_0=I_{2^n}/2^n.ρ0​=I2n​/2n.

The mixture hypothesis concerns density matrices constructed from source vectors, rather than membership of a mixed density in a set of vectors. This identifies when the constant output of an ancilla-free channel is forced to be maximally mixed.

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.5, Theorem 4.3: without an ancilla, a maximally mixed source mixture
forces the fixed output to be maximally mixed. -/
theorem theorem_4_3 (n N : ℕ) (S : Set ((EuclideanSpace ℂ (Qubits n))))
    (E : KeyedUnitaryEnsemble (Fin N) (Qubits n)) (rho0 : (Matrix (Qubits n) (Qubits n) ℂ))
    (h : BarePQC S E rho0) (hmix : IsSourceMixture S (sourceMixedIdentity (Qubits n))) :
    rho0 = sourceMixedIdentity (Qubits n) := 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. 5, Theorem 4.3: when the constant output must be maximally mixed
Read-back

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

For all natural numbers n,Nn,Nn,N, let Qn={0,1}nQ_n=\{0,1\}^nQn​={0,1}n, let S⊆CQnS\subseteq\mathbb C^{Q_n}S⊆CQn​, let an ensemble consist of real numbers pkp_kpk​ and complex matrices UkU_kUk​ indexed by 0≤k<N0\leq k<N0≤k<N, and let ρ0\rho_0ρ0​ be a complex matrix indexed by QnQ_nQn​. Suppose pk≥0p_k\geq0pk​≥0, ∑k<Npk=1\sum_{k<N}p_k=1∑k<N​pk​=1, every UkU_kUk​ is unitary, ρ0\rho_0ρ0​ is positive semidefinite with trace 111, and every ψ∈S\psi\in Sψ∈S has norm 111 and satisfies

∑k<NpkUk∣ψ⟩⟨ψ∣Uk†=ρ0.\sum_{k<N}p_kU_k|\psi\rangle\langle\psi|U_k^\dagger=\rho_0.k<N∑​pk​Uk​∣ψ⟩⟨ψ∣Uk†​=ρ0​.

Suppose also that there exist a natural number rrr, real weights qj≥0q_j\geq0qj​≥0 for 0≤j<r0\leq j<r0≤j<r with ∑j<rqj=1\sum_{j<r}q_j=1∑j<r​qj​=1, and vectors ψj∈S\psi_j\in Sψj​∈S, each of norm 111, such that

2−nI=∑j<rqj∣ψj⟩⟨ψj∣.2^{-n}I=\sum_{j<r}q_j|\psi_j\rangle\langle\psi_j|.2−nI=j<r∑​qj​∣ψj​⟩⟨ψj​∣.

Here ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|∣ψ⟩⟨ψ∣ has entries ψ(b)ψ(c)‾\psi(b)\overline{\psi(c)}ψ(b)ψ(c)​. Then ρ0=2−nI\rho_0=2^{-n}Iρ0​=2−nI. Zero weights are permitted, but their associated vectors must still belong to SSS and be normalized. The hypotheses cannot hold with N=0N=0N=0, r=0r=0r=0, or S=∅S=\varnothingS=∅. The case n=0n=0n=0, where QnQ_nQn​ is a singleton, is included.

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