Theorem 13: square-root dilution lower bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.dilution_square_rootFix a normalized finite-dimensional bipartite pure state whose positive Schmidt rank exceeds one and whose reduced state is nonflat on its positive support. There is (one may choose ) such that, for every fixed , there are , a real sequence and a threshold such that every protocol preparing from any finite supply of EPR pairs with squared fidelity at least has
Both and the single remainder may depend on and , but are chosen before , the EPR supply and the protocol. This gives the square-root dilution obstruction.
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 Dilution
variable {A B : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
/-- PDF pp.6--7, Theorem 13 (statement on p.7): a state-dependent positive
square-root lower bound, with one remainder uniform over all protocols and EPR
counts. The proof's delta<1/2 gives the sufficient error threshold 1/1024. -/
theorem dilution_square_root (psi : EuclideanSpace ℂ (A × B)) (hnorm : ‖psi‖ = 1)
(hentangled : 1 < supportRank (aliceDensity psi)) (hnonflat : ¬ Flat (aliceDensity psi)) :
∃ epsilonStar : ℝ, 0 < epsilonStar ∧ epsilonStar ≤ 1 / 1024 ∧
∀ epsilon : ℝ, 0 < epsilon → epsilon < epsilonStar →
∃ d : ℝ, 0 < d ∧ ∃ r : ℕ → ℝ,
Asymptotics.IsLittleO Filter.atTop r (fun n : ℕ => Real.sqrt (n : ℝ)) ∧
∃ N : ℕ, ∀ n ≥ N, ∀ (k : ℕ) (cost : ℝ),
QuantumPrepares (eprPairs k) (pureStateCopies psi n) epsilon cost →
d * Real.sqrt (n : ℝ) - r n ≤ cost := by sorry
end Dilution
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 and a vector of norm , define its first marginal by . Suppose the complex dimension of the range of is greater than , and its positive eigenvalues are not all equal; explicitly, the condition that every pair of strictly positive eigenvalues, counted with multiplicity, is equal is assumed false. There exists with such that, for every , there exist a real , a function satisfying as , and a natural , such that for every natural , natural , and real , the following implication holds. Let , and let . If a matrix can be obtained from by a finite sequence of local trace-preserving Kraus maps and transfers of positive-dimensional tensor factors, with total cost exactly , where a dimension- transfer costs , and
then . The function is not required to be nonnegative, is included, and the hypotheses cannot hold on an empty bipartite index set.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.