Theorem 8 (seed paper result): robust quantum communication lower bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.robust_communication_lowerLet be normalized finite-dimensional bipartite pure states. Suppose a deterministic protocol, with arbitrary local operations and disposal, has unconditional output satisfying squared Uhlmann fidelity , where . Its quantum communication cost is . Put , and let be the joint eigenvalue-subset spread at retained mass at least . Then
The subscript denotes Alice's reduction and . This is the paper's central robust communication bound.
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, Theorem 8: robust quantum lower bound. epsilon<1/4 is forced by
the source's smoothing and logarithm domains. -/
theorem robust_communication_lower (phi : EuclideanSpace ℂ (A × B))
(psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1)
(epsilon cost : ℝ) (hzero : 0 ≤ epsilon) (hsmall : epsilon < 1 / 4)
(hprotocol : QuantumPrepares phi psi epsilon cost) :
2 * cost ≥ smoothSpread (aliceDensity psi) (smoothingError epsilon) -
spread (aliceDensity phi) + 2 * logTwo (1 - 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 register types , unit vectors on and on , real numbers and , suppose some matrix can be obtained from by a quantum execution of cost exactly , and its squared root fidelity with is at least . Root fidelity here is . Quantum executions are generated, after finite-register relabeling, by identity and trace-preserving local Kraus maps at zero cost, transfers of positive integer dimensional factors in either direction at cost , and finite composition adding costs. Set , , and . For a density matrix with positive eigenvalues , counted with multiplicity, define
The retained eigenvalues in this minimum are not renormalized. Then
The hypotheses include , and ensure .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.