Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Two-qubit formulas with a common optimal ensemble

Open
QAlgorithms.Papers.Independent.Intakethird100.P21.two_qubits

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For two qubits and 0≤F≤10\le F\le10≤F≤1, let ρ2,F=FP2+(1−F)(I−P2)/3\rho_{2,F}=FP_2+(1-F)(I-P_2)/3ρ2,F​=FP2​+(1−F)(I−P2​)/3 be the isotropic density. Its I-concurrence and tangle are

C(ρ2,F)=max⁡(0,2F−1),τ(ρ2,F)=max⁡(0,2F−1)2.C(\rho_{2,F})=\max(0,2F-1),\qquad \tau(\rho_{2,F})=\max(0,2F-1)^2.C(ρ2,F​)=max(0,2F−1),τ(ρ2,F​)=max(0,2F−1)2.

On [1/2,1][1/2,1][1/2,1] the raw profiles satisfy c2(F)=2F−1c_2(F)=2F-1c2​(F)=2F−1 and q2(F)=(2F−1)2q_2(F)=(2F-1)^2q2​(F)=(2F−1)2. There exists one finite normalized pure-state decomposition attaining both mixed roofs, and every positive-weight member has pure concurrence C(ρ2,F)C(\rho_{2,F})C(ρ2,F​) and pure tangle τ(ρ2,F)\tau(\rho_{2,F})τ(ρ2,F​).

The concurrence corrects the source's printed sign typo. This special dimension has coincident tangle and squared mixed concurrence.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P21

open scoped Matrix ComplexConjugate

open Filter

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P03
  (PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.10, (3.37): corrected concurrence is 2F-1 above 1/2;
the printed 1-2F gives -1 at F=1. Optimal ensembles are existential,
and every positive-weight component has the same pure cost. -/
theorem two_qubits (F : ℝ) (hF : F ∈ Set.Icc (0 : ℝ) 1) :
    tangle (isotropicDensityAtFidelity 2 F) = (if F ≤ 1/2 then 0 else (2*F-1)^2) ∧
    concurrence (isotropicDensityAtFidelity 2 F) = (if F ≤ 1/2 then 0 else 2*F-1) ∧
    (∀ F ∈ Set.Icc (1/2 : ℝ) 1, constrainedSchmidtTangle 2 F = (2*F-1)^2 ∧ rawC 2 F = 2*F-1) ∧
    (∃ e : PureEnsemble (Fin 2 × Fin 2), IsOptimalPureEnsemble pureTangle (isotropicDensityAtFidelity 2 F) e ∧
      IsOptimalPureEnsemble pureConcurrence (isotropicDensityAtFidelity 2 F) e ∧
      ∀ k, 0 < e.weight k → pureTangle (e.vector k) = tangle (isotropicDensityAtFidelity 2 F) ∧
        pureConcurrence (e.vector k) = concurrence (isotropicDensityAtFidelity 2 F)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P21

end
Source
I-concurrence and tangle for isotropic states, arXiv:quant-ph/0208002v1, PDF p. 10, §3.4.1, (3.37): two-qubit formulas and constant-tangle optimal ensembles
Read-back

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

For every real F∈[0,1]F\in[0,1]F∈[0,1], let Ω2=(∣0,0⟩+∣1,1⟩)/2\Omega_2=(|0,0\rangle+|1,1\rangle)/\sqrt2Ω2​=(∣0,0⟩+∣1,1⟩)/2​, Φ2=∣Ω2⟩⟨Ω2∣\Phi_2=|\Omega_2\rangle\langle\Omega_2|Φ2​=∣Ω2​⟩⟨Ω2​∣, and ρF=FΦ2+(1−F)(I−Φ2)/3\rho_F=F\Phi_2+(1-F)(I-\Phi_2)/3ρF​=FΦ2​+(1−F)(I−Φ2​)/3. For a unit vector ψ∈C2⊗C2\psi\in\mathbb C^2\otimes\mathbb C^2ψ∈C2⊗C2, define (Aψ)ij=∑bψ(i,b)ψ(j,b)‾(A_\psi)_{ij}=\sum_b\psi(i,b)\overline{\psi(j,b)}(Aψ​)ij​=∑b​ψ(i,b)ψ(j,b)​, τ(ψ)=2(1−Re⁡tr⁡(Aψ2))\tau(\psi)=2(1-\operatorname{Re}\operatorname{tr}(A_\psi^2))τ(ψ)=2(1−Retr(Aψ2​)), and c(ψ)=τ(ψ)c(\psi)=\sqrt{\tau(\psi)}c(ψ)=τ(ψ)​; define T(σ)T(\sigma)T(σ) and C(σ)C(\sigma)C(σ) as the respective infima of the average costs τ\tauτ and ccc over finite ensembles of unit vectors with nonnegative weights summing to 111 and average matrix σ\sigmaσ, where ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|∣ψ⟩⟨ψ∣ has entries ψ(u)ψ(v)‾\psi(u)\overline{\psi(v)}ψ(u)ψ(v)​. Then

T(ρF)={0F≤12,$2F−1)2F>12,C(ρF)={0F≤12,2F−1F>12.T(\rho_F)= \begin{cases}0&F\le\tfrac12,\$2F-1)^2&F>\tfrac12,\end{cases} \qquad C(\rho_F)= \begin{cases}0&F\le\tfrac12,\\2F-1&F>\tfrac12.\end{cases}T(ρF​)={0​F≤21​,$2F−1)2​F>21​,​C(ρF​)={02F−1​F≤21​,F>21​.​

Independently, for every (t\in[1/2,1],if, if ,ifP_2(t)istheinfimumofis the infimum ofistheinfimumof2(1-\mu_0^2-\mu_1^2)overoverover\mu_0,\mu_1\ge0withwithwith\mu_0+\mu_1=1andandand\sqrt{\mu_0}+\sqrt{\mu_1}=\sqrt{2t},then, then ,thenP_2(t)=(2t-1)^2andandand\sqrt{P_2(t)}=2t-1.Thereexistsasinglefiniteensemble. There exists a single finite ensemble .Thereexistsasinglefiniteensemble(w_k,\psi_k),with, with ,withw_k\ge0,, ,\sum_kw_k=1,andunitvectors, and unit vectors ,andunitvectors\psi_k,whoseaveragematrixis, whose average matrix is ,whoseaveragematrixis\rho_F,whoseaverage, whose average ,whoseaverage\tau−costequals-cost equals −costequalsT(\rho_F),andwhoseaverage, and whose average ,andwhoseaveragec−costequals-cost equals −costequalsC(\rho_F);everycomponentofstrictlypositiveweightsatisfiesboth; every component of strictly positive weight satisfies both ;everycomponentofstrictlypositiveweightsatisfiesboth\tau(\psi_k)=T(\rho_F)andandandc(\psi_k)=C(\rho_F)$. Components of zero weight are not subject to these last equalities.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me