General second-order achievability
OpenQAlgorithms.Papers.Independent.Support50.P04.general_secondOrder_innerLet 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 . All logarithms are binary and is the standard Gaussian quantile. Remainder constants may depend on the fixed channel and error, and are chosen before the block length: there are and such that the displayed bound holds for every integer . For every normalized density input , use the source purification with coefficients in the reference/input bases, and put . Let , and let be all maximizing density inputs, including rank-deficient ones. Let be the minimum of over below , and the maximum at or above . Then
This is a general achievable lower bound; it need not equal the optimal boundary.
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.8,14, Result 5, Eq.(15).
This is an achievable lower bound, not equality with the arbitrary-channel boundary. -/
theorem general_secondOrder_inner [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
(he0 : 0 < epsilon) (he1 : epsilon < 1) :
dispersionLower (fun n => unassistedBoundary N n epsilon)
(channelCoherentBits N) (coherentInformationVariance N epsilon) 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 arbitrary finite nonempty types with decidable equality, let be a map from complex matrices on to those on with a finite Kraus representation , , and let . Write , where is applied by functional calculus and . For each density matrix on , form the vector , the matrix , its -marginal , and . Define
and let if , and otherwise. For each , let be the extended-real supremum of real for which there exist a positive integer and channels , , each a finite normalized Kraus sum, satisfying and
The theorem asserts that there exist and a natural such that every natural satisfies
where is the infimum of the real at which the standard normal integral is at least . All suprema and infima defining are real ones, including their total-function conventions if an indexing set is empty or unbounded; no separate optimizer-attainment hypothesis is imposed. No conclusion for small block lengths is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.