Product-input smooth-entropy relaxation
OpenQAlgorithms.Papers.Independent.Support50.P04.product_smooth_relaxationLet 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. Use one finite-dimensional isometry and its receiver/complementary channels. Let , , and . 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 each normalized single-use density input , put and . Then
This is the product-input relaxation of the optimized inner 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.14, Eq.(47).
Printed delta=sqrt(epsilon)-1/sqrt(n), n>1/epsilon; changed by the paragraph's
eta=1/sqrt(n) substitution in (46) to delta=sqrt(epsilon-1/sqrt(n)), 1/sqrt(n)<epsilon. -/
theorem product_smooth_relaxation [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)
(hlarge : 1/Real.sqrt (n : ℝ) < epsilon) :
productSmoothInner (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, let satisfy , and put and . For every integer and every satisfying , the assertion is
The input on the left is a single-copy matrix on ; writing , define and . The displayed tensor power groups the reference factors together and the environment factors together, with entries equal to products of single-copy entries. For a matrix on ,
as an extended-real supremum, where acts on , , and zero is allowed. The quantity is the extended-real supremum of rates for which positive and channel maps encoding dimensions into and decoding into dimensions give and entanglement fidelity at least after . Entanglement fidelity is the overlap of the output on half of the normalized maximally entangled state of dimension with that same state. Channels are finite complete Kraus sums. The additional hypothesis excludes every with , in particular .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.