Two-qubit formulas with a common optimal ensemble
OpenQAlgorithms.Papers.Independent.Intakethird100.P21.two_qubitsFor two qubits and , let be the isotropic density. Its I-concurrence and tangle are
On the raw profiles satisfy and . There exists one finite normalized pure-state decomposition attaining both mixed roofs, and every positive-weight member has pure concurrence and pure tangle .
The concurrence corrects the source's printed sign typo. This special dimension has coincident tangle and squared mixed concurrence.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , let , , and . For a unit vector , define , , and ; define and as the respective infima of the average costs and over finite ensembles of unit vectors with nonnegative weights summing to and average matrix , where has entries . Then
Independently, for every (t\in[1/2,1]P_2(t)2(1-\mu_0^2-\mu_1^2)\mu_0,\mu_1\ge0\mu_0+\mu_1=1\sqrt{\mu_0}+\sqrt{\mu_1}=\sqrt{2t}P_2(t)=(2t-1)^2\sqrt{P_2(t)}=2t-1(w_k,\psi_k)w_k\ge0\sum_kw_k=1\psi_k\rho_F\tauT(\rho_F)cC(\rho_F)\tau(\psi_k)=T(\rho_F)c(\psi_k)=C(\rho_F)$. Components of zero weight are not subject to these last equalities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.