Positive feasible SDP metaconverse
OpenQAlgorithms.Papers.Independent.Support50.P04.sdp_metaconverseLet 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 . There is at least one normalized with a feasible test, and
The positivity clause makes the logarithmic converse a genuine finite bound.
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 p.12, Corollary 2, Eqs.(33)–(34).
Gamma feasibility and strict positivity are conclusions, not assumptions smuggling
in the converse. The positive logarithm argument avoids Real.log's default at zero. -/
theorem sdp_metaconverse [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
(∃ rho : Matrix A A ℂ, IsDensityMatrix rho ∧
∃ Lambda, GammaTests N epsilon rho Lambda) ∧
0 < metaValue N epsilon ∧ metaValue N epsilon ≤ 1 ∧
cppBoundary N 1 epsilon ≤ ((-QAlgorithms.Papers.Independent.Information100.P80.log2 (metaValue N epsilon) : ℝ) : EReal) := 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 admit a finite Kraus representation with , and let . Define the unnormalized Choi matrix by , and define
The assertion is that is nonempty, , and
as an extended-real inequality. Here is the supremum of real rates for which positive integers , a channel encoding dimensions into , and a channel decoding into dimensions achieve and entanglement fidelity at least . The effective channel retains the -dimensional memory, applies to the register, and then decodes; its entanglement fidelity is its overlap, on one half of the normalized maximally entangled state, with that same state. The decoder must factor through separate isometric embeddings into positive dimensions , a two-factor map , the partial trace over the first factor, and a channel on the second factor. The map , viewed as a one-outcome instrument, is required to arise as a limit of total maps of a continuing sequence of finite protocols, initially having a positive number of rounds and extended by one round at every history at each stage. A round uses a countably indexed completely positive instrument at one party and outcome-dependent channels at the other; branch sums are summable on every input and preserve trace in total. The convergence norm is the supremum of the output trace norm over density inputs with an equally dimensional reference. Channels throughout mean maps with finite Kraus families satisfying the completeness equation; density matrices are positive semidefinite with trace one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.