Equivalent primal and dual SDPs with strong duality
OpenQAlgorithms.Papers.Independent.Support50.P04.equivalent_sdps_strongDualityLet be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write and for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension , rate , and squared fidelity to the normalized maximally entangled target at least . A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. Let . Let be the unnormalized Choi matrix. Define . Set , where the comparison Choi operators satisfy , , and . In the minimization program, is a density matrix, , , , and . In the maximization program, , , , , , and . Then
Here permits in the inner comparison optimization. This gives both equivalent semidefinite formulations and equality of their values.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms
namespace QAlgorithms.Papers.Independent.Support50.P04
variable {A B E : Type} [Fintype A] [DecidableEq A]
variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- arXiv:1504.04617v2, PDF pp.21–22, Theorem 7, Eqs.(A3)–(A4).
Both SDP formulations and strong duality are retained; the appendix's TNI comparison
maps have the same value as TP comparison channels. Printed n/nu is renamed nu.
The proof's false norm equality ||J_N||=|A| needs only <=|A|, not an added assumption. -/
theorem equivalent_sdps_strongDuality [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
metaValue N epsilon = metaValue N epsilon true ∧
metaValue N epsilon = sdpMinValue N epsilon ∧
metaValue N epsilon = sdpMaxValue N epsilon := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite sets with decidable equality, let have a finite Kraus representation satisfying , and let . Write , , and
For each , define
The assertion is the following three equalities of real numbers:
Here are matrices on , while are matrices on ; every matrix inequality means that the difference is positive semidefinite, and . The statement asserts equality of these infimum and supremum values, without separately asserting attainment of any of them.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.