Power costs are polynomials in every Hermitian operator basis
ProvedQAlgorithms.Papers.Independent.Support50.P35.power_cost_polynomialLet and , . Use complete norm-one Gellmann bases , with zero denoting the identity label. For real tensor coordinates , put . Then
For any complete Hermitian orthonormal basis of the bipartite operator space, there exists a real polynomial in its unscaled coordinates such that for every real . If , the same marginal formula holds with . The factor corrects Eqs.(58)--(59) because . This gives a polynomial extension of the pure-state entanglement cost in every such coordinate basis.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P35
noncomputable section
open scoped Matrix ComplexConjugate Topology Manifold
namespace QAlgorithms.Papers.Independent.Support50.P35
/-- PDF p.18, Eqs.(57)--(59): the corrected marginal/cost formula and a
real polynomial in ANY Hermitian orthonormal operator coordinates. -/
theorem power_cost_polynomial (M N a : ℕ) (hN : 0 < N) (hNM : N ≤ M) (ha : 1 < a)
(nu : Fin ((M * N) ^ 2) → Matrix (Fin M × Fin N) (Fin M × Fin N) ℂ)
(hnu : IsHermitianONBasis nu) :
(∀ c : FullIndex M × FullIndex N → ℝ,
traceRight (hermitianReconstruction (tensorGellmannBasis M N) c) = tensorMarginal c ∧
powerPurityCost a (traceRight (hermitianReconstruction (tensorGellmannBasis M N) c)) =
2 * (1 - (tensorMarginal c ^ a).trace.re)) ∧
(∃ P : MvPolynomial (Fin ((M * N) ^ 2)) ℝ,
∀ d : Fin ((M * N) ^ 2) → ℝ,
MvPolynomial.eval d P = powerPurityCost a (traceRight (hermitianReconstruction nu d)) ∧
traceRight (hermitianReconstruction nu d) = tensorMarginal
((basisChange (tensorGellmannBasis M N) nu).mulVec d)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P35
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers with and , let be complex matrices indexed by pairs from , each Hermitian, with , and spanning all Hermitian matrices over the reals. In dimension , use labels , , and two labels for each , and define , to be diagonal with its first entries , its next entry , and remaining entries zero, and the pair matrices to be and . Set , , , and . Then, for every real array ,
Furthermore, there exists a real multivariate polynomial in variables such that, for every ,
These identities hold for all real coordinates, without a density-matrix assumption; no degree bound on is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.