Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq.(36): subsystem concurrence quantity

Proved
QAlgorithms.Papers.Independent.Advance50.P50.subsystem_impurity

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 nonempty Q⊆SQ\subseteq SQ⊆S, a two-copy model with O~=2(I−SQ)\widetilde O=2(I-S_Q)O=2(I−SQ​) satisfies

h(ρ)=2(1−Tr⁡(ρQ2)).h(\rho)=2\bigl(1-\operatorname{Tr}(\rho_Q^2)\bigr).h(ρ)=2(1−Tr(ρQ2​)).

This preserves the displayed squared-concurrence quantity without taking a square root or asserting equality to an uninspected normalization. The full subsystem Q=SQ=SQ=S is allowed, giving zero for pure ρ\rhoρ.

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.(36): the displayed squared-concurrence quantity, without
identifying it with a square root or a differently normalized cited measure.
Printed: PDF p.14 Eq.(36) writes a tensor product over j in Q of SWAP^(j) tensor the complementary identity.
Changed: Use the single original two-copy register: swap exactly the sites in Q and act as identity on its complement. The response is 2*(1-Tr(rho_Q^2)); no named-measure or square-root equivalence is asserted.
Why: The text introduces this as the subsystem version of Eq.(34). Literal repetition of full-register complementary identities would change the Hilbert-space dimension. The physical site embedding is the dimension-consistent reading of that formula. -/
theorem subsystem_impurity {n : ℕ} (Q : Finset (Fin n)) (hQ : Q.Nonempty)
    (M : ExpectationModel (Qubits n) 2)
    (hobs : M.effective = (2 : ℂ) • (1 - subsystemSwap Q))
    (rho : Mat (Qubits n)) (hpure : IsPure rho) :
    M.response rho = 2 * (1 - purity (subsystemReduction (fun _ => Bool) rho Q)) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 14, Eq.(36): subsystem concurrence quantity
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 a nonempty subset of its nnn qubit sites, so these hypotheses require n>0n>0n>0. Let MMM consist of a unitary UUU and a Hermitian observable OOO on two nnn-qubit copies, and assume U†OU=2(I−SQ)U^\dagger OU=2(I-S_Q)U†OU=2(I−SQ​), where SQS_QSQ​ exchanges the two copies’ bits at every site in QQQ and leaves all other bits unchanged. For every pure matrix ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣ with ∥ψ∥=1\|\psi\|=1∥ψ∥=1,

Re⁡tr⁡ ⁣(U(ρ⊗ρ)U†O)=2(1−Re⁡tr⁡(ρQ2)),\operatorname{Re}\operatorname{tr}\!\left(U(\rho\otimes\rho)U^\dagger O\right) =2\left(1-\operatorname{Re}\operatorname{tr}(\rho_Q^2)\right),Retr(U(ρ⊗ρ)U†O)=2(1−Retr(ρQ2​)),

where (ρQ)x,y=∑zρx∪z,y∪z(\rho_Q)_{x,y}=\sum_z\rho_{x\cup z,y\cup z}(ρQ​)x,y​=∑z​ρx∪z,y∪z​, with x,yx,yx,y assignments on QQQ and zzz an assignment on its complement. The choice of QQQ as the full set of sites is included, in which case the complement has a single empty assignment.

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