Success bound about an arbitrary fixed center
OpenQAlgorithms.Papers.Independent.Support50.P19.fixedCenter_successLet be a channel on nonzero finite complex spaces, , and let be any density operator on . A uniform-message code of messages using channel uses has actual rate and average success satisfying
Input density operators and block encodings are unrestricted. If the fixed-center radius is infinite, the right side is , rather than an exponential computed from a totalized zero. This isolates the center-dependent quantity used in the Hadamard argument.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF p.25, (26): arbitrary output center; infinite fixed-center radii stay infinite. -/
theorem fixedCenter_success [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel N) (sigma : {X : Matrix J J ℂ // IsDensityMatrix X})
(n M : ℕ) (hn : 0 < n) (hM : 0 < M) (C : UACode (Fin n → I) (Fin n → J) M) :
ENNReal.ofReal (uaCodeSuccess (channelPower N n) C) ≤
codingBound n a ((Real.logb 2 (M : ℝ) / (n : ℝ)))
(((1 / (n : ℝ) : ℝ) : EReal) *
fixedRadius true a (channelPower N n) (tensorPower n sigma.1)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, let , let for a finite family with , and let be any positive semidefinite matrix on of trace . For every positive integers and every code with input density matrices on and positive semidefinite measurement matrices on satisfying , put . Then
Here applies independently to the factors, and . The supremum and exponent arithmetic are extended-real operations; in the nonnegative extended reals, and equals for finite , at , and at . For density matrices , if , and otherwise
with zero eigenvalues sent to by spectral powers and the extended logarithm equal to at zero. The chosen may be singular; no support-inclusion hypothesis is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.