Optimized smooth-min-entropy achievability
OpenQAlgorithms.Papers.Independent.Support50.P04.optimized_smooth_achievabilityLet 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. Fix , , and one isometry ; and are respectively the receiver and environment partial traces of that same dilation. For a normalized center , define as the supremum of real for which there exist of trace at most one and a normalized density such that and . Supremums are taken in the extended reals. For every normalized input on , put . Then
The one-bit term accounts for integer message rounding.
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.13–14, Corollary 5, Eq.(46).
Printed ball F>=(1-delta)^2; changed to F>=1-delta^2 to match the named purified
distance and the square-root conversion used in (45),(51). Entire expression /n. -/
theorem optimized_smooth_achievability [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ) (hU : Uᴴ * U = 1)
(n : ℕ) (hn : 0 < n) (epsilon : ℝ) (he0 : 0 < epsilon) (he1 : epsilon < 1) :
smoothInner (QAlgorithms.Papers.Independent.Information100.P67.complementaryChannel U) n epsilon ≤
unassistedBoundary (QAlgorithms.Papers.Independent.Information100.P67.receiverChannel U) 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, and let satisfy . Define and . For every integer and , the assertion is
Here ranges over matrices on ; if , then has entries at , and . Tensor powers of maps act separately on each coordinate of matrix units. For a matrix on , the quantity appearing on the left is defined by
where the supremum is taken in the extended reals, is on , and . Thus the smoothing condition uses this squared fidelity, and permits . The right side is the extended-real supremum of all real for which some positive integer , a channel encoder , and a channel decoder satisfy and
where projects onto . Every channel here means a finite Kraus sum whose Kraus operators satisfy the completeness equation.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.