Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq.(37): concentratable entanglement response

Proved
QAlgorithms.Papers.Independent.Advance50.P50.concentratable_response

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

prove2quantum

An nnn-qubit input ρ\rhoρ is a positive semidefinite, trace-one matrix on the fixed computational basis, of dimension d=2nd=2^nd=2n. A kkk-copy model has a fixed input-independent unitary UUU, a Hermitian observable OOO, effective observable O~=U†OU\widetilde O=U^\dagger O UO=U†OU, and exact response h(ρ)=Tr⁡[Uρ⊗kU†O]h(\rho)=\operatorname{Tr}[U\rho^{\otimes k}U^\dagger O]h(ρ)=Tr[Uρ⊗kU†O]. Let ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣ be a pure nnn-qubit density matrix with ∥ψ∥=1\|\psi\|=1∥ψ∥=1, and let ρQ=Tr⁡S∖Qρ\rho_Q=\operatorname{Tr}_{S\setminus Q}\rhoρQ​=TrS∖Q​ρ for S={1,…,n}S=\{1,\ldots,n\}S={1,…,n}. For two copies, SQS_QSQ​ swaps the copies at precisely the sites in QQQ and acts as identity elsewhere. For any Q⊆SQ\subseteq SQ⊆S, let the effective observable be identity minus 2−∣Q∣2^{-|Q|}2−∣Q∣ times the tensor product of (I+SWAP)(I+\mathrm{SWAP})(I+SWAP) on each paired site in QQQ and identity on the remaining sites. Then

h(ρ)=1−12∣Q∣∑A⊆QTr⁡(ρA2).h(\rho)=1-\frac1{2^{|Q|}}\sum_{A\subseteq Q}\operatorname{Tr}(\rho_A^2).h(ρ)=1−2∣Q∣1​A⊆Q∑​Tr(ρA2​).

The empty subsystem reduction is the scalar trace one. Hence Q=∅Q=\varnothingQ=∅ gives zero, with a nonzero denominator. This is the purity formula associated with the concentratable-entanglement observable, without an added identification axiom.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Advance50.P50

open MeasureTheory ProbabilityTheory

open scoped ComplexConjugate ENNReal

-- Exact accepted primitives; no paper-local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)

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

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

-- Matrices carry the associative commutator bracket X*Y-Y*X.

attribute [local instance 100] LieRing.ofAssociativeRing

/-- PDF p.14, Eq.(37): the tensor observable gives the subset-purity formula.
Q may be empty; then the response is zero. -/
theorem concentratable_response {n : ℕ} (Q : Finset (Fin n))
    (M : ExpectationModel (Qubits n) 2) (hobs : M.effective = concentratableObservable Q)
    (rho : Mat (Qubits n)) (hpure : IsPure rho) :
    M.response rho = 1 - ((2 : ℝ) ^ Q.card)⁻¹ *
      ∑ A ∈ Q.powerset, purity (subsystemReduction (fun _ => Bool) rho A) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 14, Eq.(37): concentratable entanglement response
Read-back

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

Let n≥0n\ge0n≥0 be an integer and QQQ any subset of its qubit sites, including the empty subset. Let MMM consist of a unitary UUU and a Hermitian observable OOO on two nnn-qubit copies, and assume

U†OU=I−2−∣Q∣∏j∈Q(I+S{j}),U^\dagger OU=I-2^{-|Q|}\prod_{j\in Q}(I+S_{\{j\}}),U†OU=I−2−∣Q∣j∈Q∏​(I+S{j}​),

where S{j}S_{\{j\}}S{j}​ exchanges the two copies’ bits at site jjj, and the empty product is the identity. For every pure matrix ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣ with ∥ψ∥=1\|\psi\|=1∥ψ∥=1,

Re⁡tr⁡ ⁣(U(ρ⊗ρ)U†O)=1−2−∣Q∣∑A⊆QRe⁡tr⁡(ρA2).\operatorname{Re}\operatorname{tr}\!\left(U(\rho\otimes\rho)U^\dagger O\right) =1-2^{-|Q|}\sum_{A\subseteq Q}\operatorname{Re}\operatorname{tr}(\rho_A^2).Retr(U(ρ⊗ρ)U†O)=1−2−∣Q∣A⊆Q∑​Retr(ρA2​).

Here (ρA)x,y=∑zρx∪z,y∪z(\rho_A)_{x,y}=\sum_z\rho_{x\cup z,y\cup z}(ρA​)x,y​=∑z​ρx∪z,y∪z​, where zzz ranges over assignments on the complement of AAA. The sum includes A=∅A=\varnothingA=∅, whose reduction is the one-dimensional matrix with entry tr⁡ρ=1\operatorname{tr}\rho=1trρ=1. In particular, Q=∅Q=\varnothingQ=∅, including the case n=0n=0n=0, gives response 000.

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