Remark 12: smoothed Renyi-gap communication bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.smooth_renyi_communication_lowerLet and let normalized bipartite pure states be related by a deterministic quantum protocol of cost and unconditional squared fidelity at least , with . For eigenvalues , define by jointly minimizing over retained mass at least . Order zero counts positive support; infinity uses the largest retained weight. Put . Then
The factor equals one at infinity. This retains the source's separate smoothing correction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P61
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)
open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
attribute [local instance] Classical.propDecidable
section Operational
variable {A B C D : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
[Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
/-- PDF p.5, Remark 12: jointly smoothed Renyi gaps, with the infinity limit
and the printed log(1-sqrt(delta)) correction. -/
theorem smooth_renyi_communication_lower (phi : EuclideanSpace ℂ (A × B))
(psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1)
(alpha : NNReal) (halpha : alpha < 1) (beta : RenyiOrder) (hbeta : 1 < beta)
(epsilon cost : ℝ) (hzero : 0 ≤ epsilon) (hsmall : epsilon < 1 / 4)
(hprotocol : QuantumPrepares phi psi epsilon cost) :
2 * cost ≥ smoothRenyiGap (aliceDensity psi) (alpha : RenyiOrder) beta (smoothingError epsilon) -
smoothRenyiGap (aliceDensity phi) (alpha : RenyiOrder) beta 0 +
(2 * (alpha : ℝ) / (1 - (alpha : ℝ)) + 2 * upperRenyiFactor beta) *
logTwo (1 - Real.sqrt (smoothingError epsilon)) := by sorry
end Operational
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite types with decidable equality, let and have Euclidean norm , let , let be either a finite nonnegative real number greater than or , and let satisfy . For a bipartite vector , write for its first marginal, with entries , and write , using the total real logarithm, in particular . For a positive semidefinite matrix , let be its eigenvalues, counted with multiplicity, let , and put . For each such subset define
Here a maximum over an empty finite set and a minimum over an empty finite set are assigned ; the retained eigenvalues are not renormalized. Set , and set for finite , and . Suppose some matrix can be obtained from by a finite sequence of local maps with , and transfers of positive-dimensional tensor factors between the two parties, where transferring a factor of dimension costs , the accumulated cost is exactly , and
Then
The case , the case , and zero error are included; if either vector’s index set is empty, its norm-one hypothesis cannot hold.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.