Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hadamard-degrading-map

Proved
QAlgorithms.Papers.Independent.Gap20.P04.hadamardDegrading

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let U:A′→B⊗EU:A'\to B\otimes EU:A′→B⊗E be a normalized finite-dimensional isometry with U(b,e),i=ξb(e)ζb(i)‾U_{(b,e),i}=\xi_b(e)\overline{\zeta_b(i)}U(b,e),i​=ξb​(e)ζb​(i)​, where ∥ξb∥=1\|\xi_b\|=1∥ξb​∥=1. Let N\mathcal NN and Nc\mathcal N^cNc be its receiver and complementary channels. Then for every matrix σ\sigmaσ,

N(σ)bc=⟨ζb∣σ∣ζc⟩⟨ξc∣ξb⟩.\mathcal N(\sigma)_{bc}=\langle\zeta_b|\sigma|\zeta_c\rangle\langle\xi_c|\xi_b\rangle.N(σ)bc​=⟨ζb​∣σ∣ζc​⟩⟨ξc​∣ξb​⟩.

Let M\mathcal MM measure the orthonormal receiver basis and P\mathcal PP prepare ∣ξb⟩⟨ξb∣|\xi_b\rangle\langle\xi_b|∣ξb​⟩⟨ξb​∣ at outcome bbb. Their composition is an entanglement-breaking CPTP map with normalized Kraus operators Kb=∣ξb⟩⟨b∣K_b=|\xi_b\rangle\langle b|Kb​=∣ξb​⟩⟨b∣, and

D=P∘M,D∘N=Nc.\mathcal D=\mathcal P\circ\mathcal M,\qquad \mathcal D\circ\mathcal N=\mathcal N^c.D=P∘M,D∘N=Nc.

This is the explicit factorized degrading construction for representation (8), not an identification of all degradable channels with Hadamard channels.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P04

open QAlgorithms

open QAlgorithms.Papers.Independent.Claimed50.P24
  (Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
   dephasingDilation dephasingGamma cloningDilation)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel dilationPower)

open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)

open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)

open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I B E J D F : Type}

variable [Fintype I] [Fintype B] [Fintype E]

variable [Fintype J] [Fintype D] [Fintype F]

variable [DecidableEq I] [DecidableEq B] [DecidableEq E]

variable [DecidableEq J] [DecidableEq D] [DecidableEq F]

variable [Nonempty I] [Nonempty B] [Nonempty E]

variable [Nonempty J] [Nonempty D] [Nonempty F]

/-- PDF p.5, (8)--(9): explicit measurement-preparation degrading map for the given
rank-one complementary representation. Coefficients use <xi_c|xi_b>, fixing conjugation. -/
theorem hadamardDegrading (U : Dilation I B E) (hU : PhysicalDilation U)
    (xi : B → EuclideanSpace ℂ E) (hxi : ∀ b, ‖xi b‖ = 1)
    (zeta : B → EuclideanSpace ℂ I)
    (hrep : ∀ b e i, U (b,e) i = xi b e * conj (zeta b i)) :
    (∀ rho, receiverChannel U rho = hadamardCoefficient zeta xi rho) ∧
    IsKrausFamily (degradingKraus xi) ∧
    IsChannel (basisStatePreparation xi ∘ measureBasis) ∧
    ChannelEB (basisStatePreparation xi ∘ measureBasis) ∧
    (∀ rho, (basisStatePreparation xi ∘ measureBasis) rho = krausApply (degradingKraus xi) rho) ∧
    (∀ rho, (basisStatePreparation xi ∘ measureBasis) (receiverChannel U rho) = complementaryChannel U rho) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 5, Hadamard-degrading-map
Read-back

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

Let I,B,EI,B,EI,B,E be finite nonempty index types with decidable equality, and let U:CI→CB×EU:\mathbb C^I\to\mathbb C^{B\times E}U:CI→CB×E satisfy U†U=1U^\dagger U=1U†U=1. Let ξb∈CE\xi_b\in\mathbb C^Eξb​∈CE be unit vectors and ζb∈CI\zeta_b\in\mathbb C^Iζb​∈CI arbitrary vectors, with

U(b,a),i=ξb(a)ζb(i)‾for every b,a,i.U_{(b,a),i}=\xi_b(a)\overline{\zeta_b(i)} \quad\text{for every }b,a,i.U(b,a),i​=ξb​(a)ζb​(i)​for every b,a,i.

Define B(ρ)=Tr⁡E(UρU†)\mathcal B(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)B(ρ)=TrE​(UρU†), E(ρ)=Tr⁡B(UρU†)\mathcal E(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)E(ρ)=TrB​(UρU†), Kb(a,c)=1c=bξb(a)K_b(a,c)=\mathbf1_{c=b}\xi_b(a)Kb​(a,c)=1c=b​ξb​(a), and

D(ρ)=∑bρbb∣ξb⟩⟨ξb∣.D(\rho)=\sum_b\rho_{bb}|\xi_b\rangle\langle\xi_b|.D(ρ)=b∑​ρbb​∣ξb​⟩⟨ξb​∣.

Then, for every input matrix ρ\rhoρ,

B(ρ)bc=(∑i,jζb(i)‾ ρijζc(j))(∑aξc(a)‾ξb(a)).\mathcal B(\rho)_{bc} =\left(\sum_{i,j}\overline{\zeta_b(i)}\,\rho_{ij}\zeta_c(j)\right) \left(\sum_a\overline{\xi_c(a)}\xi_b(a)\right).B(ρ)bc​=(i,j∑​ζb​(i)​ρij​ζc​(j))(a∑​ξc​(a)​ξb​(a)).

Also ∑bKb†Kb=1\sum_bK_b^\dagger K_b=1∑b​Kb†​Kb​=1; DDD, equivalently first deleting all off-diagonal entries and then preparing the indicated weighted vector projectors, is a channel, meaning it admits a finite Kraus representation with ∑jLj†Lj=1\sum_jL_j^\dagger L_j=1∑j​Lj†​Lj​=1; applying DDD to the second factor of every unit-vector projector on CB⊗CB\mathbb C^B\otimes\mathbb C^BCB⊗CB yields a finite convex combination of products of positive semidefinite trace-one matrices; and, for every matrix ρ\rhoρ on BBB and every matrix σ\sigmaσ on III,

D(ρ)=∑bKbρKb†,D(B(σ))=E(σ).D(\rho)=\sum_bK_b\rho K_b^\dagger,\qquad D(\mathcal B(\sigma))=\mathcal E(\sigma).D(ρ)=b∑​Kb​ρKb†​,D(B(σ))=E(σ).

These matrix identities are quantified over all matrices, without a positivity or normalization restriction.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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