Rains-information dispersion converse
OpenQAlgorithms.Papers.Independent.Support50.P04.rains_dispersion_converseLet 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 . Let . The Rains set is . Put , where is Umegaki relative entropy in bits, infinite on support failure. Let be its full minimizer set and let be the maximum of the relative-information variance over if , and the minimum otherwise. Assume full input-unitary covariance, with an output unitary representation. The Rains information is finite and
This supplies a channel-dependent outer 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.13, Theorem 3, Eqs.(41)–(43).
All Rains minimizers are constructed from N; maximum variance is chosen below 1/2,
minimum at/above 1/2. Constants may depend on fixed N and epsilon. -/
theorem rains_dispersion_converse [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (hcov : FullUnitaryCovariant N)
(epsilon : ℝ) (he0 : 0 < epsilon) (he1 : epsilon < 1) :
∃ a : ℝ, rainsInformation N = (a : EReal) ∧
dispersionUpper (fun n => cppBoundary N n epsilon) a (rainsVariance 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 nonempty finite sets with decidable equality, let be a channel with a finite complete Kraus family, and suppose there is a group homomorphism satisfying for every unitary and matrix . For every , there exists a real number such that
as an equality in the extended reals, and there are and an integer such that, for every ,
Here , with ; ; and . The relative entropy is unless ; when that inclusion holds it is
The number is the supremum, when , and the infimum, when , of
over precisely those feasible attaining the displayed relative-entropy infimum; no optimizer-attainment assertion is separately included. Matrix logarithms use functional calculus with the total scalar logarithm, including . These variance extrema are real infima or suprema, with the formal real-order default value for an empty set. The normal quantile is . The quantity is the extended-real supremum of rates achievable to entanglement fidelity at least by a channel encoder from dimensions to and a positive finite memory, followed by and a channel decoder acting jointly on that memory and . Its decoder must factor through separate isometric embeddings, a two-factor map , tracing out the first factor, and a channel on the second. The one-outcome map must be the stabilized trace-norm limit of total maps of a continuing sequence of finite positive-round protocols: at each history one party uses a countably indexed completely positive instrument and the other outcome-dependent channels, and each stage extends every history by one round; branch maps are summable on every input and preserve trace in total. The stabilized norm takes the supremum over density inputs with an equally dimensional reference. Entanglement fidelity is overlap with the normalized maximally entangled state after applying the effective channel to its second half.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.