Remark 11: robust lower bound with both endpoints smoothed
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.two_endpoint_smoothedThere is a universal composed infidelity tending to zero as both nonnegative errors tend to zero. Let be normalized finite-dimensional bipartite pure vectors, , and suppose a deterministic quantum protocol prepares from with squared fidelity at least and cost . Whenever , put . Then
The quantities use joint spectral-subset smoothing. The initial correction accounts for normalizing the retained initial state. The universal function is chosen before all systems, states and protocols; no explicit composition law is attributed to the source.
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
/-- PDF p.5, Remark 11: there is a universal composed infidelity, tending to
zero jointly. Applying Theorem 8 after normalizing an optimal initial spectral
projection incurs +log(1-epsilon0). The source gives no explicit composition law.
This is a local small-error bound: eta<1/4 is required by Theorem 8's domain. -/
theorem two_endpoint_smoothed :
∃ eta : ℝ × ℝ → ℝ,
(∀ e e0 : ℝ, 0 ≤ e → e ≤ 1 → 0 ≤ e0 → e0 ≤ 1 → 0 ≤ eta (e,e0) ∧ eta (e,e0) ≤ 1) ∧
Filter.Tendsto eta
(nhdsWithin (0,0) {p : ℝ × ℝ | 0 ≤ p.1 ∧ 0 ≤ p.2}) (nhds 0) ∧
∀ (A B C D : Type) [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
[Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
(phi : EuclideanSpace ℂ (A × B)) (psi : EuclideanSpace ℂ (C × D)),
‖phi‖ = 1 → ‖psi‖ = 1 → ∀ (epsilon epsilon0 cost : ℝ),
0 ≤ epsilon → epsilon < 1 → 0 ≤ epsilon0 → epsilon0 < 1 →
eta (epsilon,epsilon0) < 1 / 4 → QuantumPrepares phi psi epsilon cost →
2 * cost ≥ smoothSpread (aliceDensity psi) (smoothingError (eta (epsilon,epsilon0))) -
smoothSpread (aliceDensity phi) epsilon0 + logTwo (1 - epsilon0) +
2 * logTwo (1 - smoothingError (eta (epsilon,epsilon0))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
There exists a single function such that whenever , and as within the nonnegative quadrant, with the following property for every choice of finite types with decidable equality. Let and have norm , and let satisfy , , and . For a bipartite vector , define . For a positive semidefinite matrix with eigenvalues , counted with multiplicity, define
where an empty finite maximum or minimum is assigned , and uses . Suppose a matrix is obtainable from by a finite sequence of local trace-preserving Kraus maps and transfers of tensor factors of positive dimension, with total transfer cost exactly , each dimension- transfer costing , and its squared root fidelity with is at least ; explicitly this fidelity is . Writing , one has
Both error parameters may be zero. No norm-one vector exists when its index set is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.