§II, unnumbered: linear exact dilution lower bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.exact_dilution_linearFix complex amplitudes with , , and . Write . There are constants and such that, for every , every supply of EPR pairs and every exact deterministic quantum protocol producing , its communication cost satisfies
The constants may depend on the fixed amplitudes, and precede the block size and protocol. This is the linear exact-error contrast to approximate dilution.
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.3, unnumbered exact dilution bound: nonzero unequal Schmidt weights.
The asymptotic constants precede n, the EPR supply and every protocol. -/
theorem exact_dilution_linear (alpha beta : ℂ)
(hnorm : Complex.normSq alpha + Complex.normSq beta = 1)
(hpositive : 0 < Complex.normSq alpha) (hbelow : Complex.normSq alpha < 1)
(hnonflat : Complex.normSq alpha ≠ 1 / 2) :
∃ c : ℝ, 0 < c ∧ ∃ N : ℕ, ∀ n ≥ N, ∀ (k : ℕ) (cost : ℝ),
Quantum (pureDensity (eprPairs k)) (pureDensity (pureStateCopies (binaryState alpha beta) n)) cost →
c * (n : ℝ) ≤ cost := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For complex numbers satisfying , , and , there exist a real and a natural number such that, for every natural , every natural , and every real , the following holds. Define
If the matrix can be obtained exactly from by a finite sequence of local Kraus maps with and transfers of tensor factors between the parties, each transferred factor of positive dimension costing , with accumulated cost exactly , then . The quantifier over includes , when is the one-dimensional unit vector; zero copies likewise use an empty product equal to , if lies in the asserted range.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.