Corollary 9: arbitrary EPR assistance
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.epr_assisted_lowerLet be normalized bipartite pure states and let be any finite integer. A deterministic protocol starts with and additional EPR pairs and has unconditional output of squared fidelity at least to , where . With quantum cost , and joint spectral-subset smooth spread ,
There is no upper bound on , and the initial term is computed from alone. This permits finite EPR assistance without arbitrary catalysts.
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, Corollary 9: any finite number k of supplementary EPR pairs;
the right-hand side still uses phi alone. -/
theorem epr_assisted_lower (phi : EuclideanSpace ℂ (A × B))
(psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1)
(k : ℕ) (epsilon cost : ℝ) (hzero : 0 ≤ epsilon) (hsmall : epsilon < 1 / 4)
(hprotocol : QuantumPrepares (tensorPureStates phi (eprPairs k)) 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 , every natural number , and real numbers and , form the input vector with coordinates
Suppose a quantum execution of cost exactly takes to some matrix whose squared root fidelity with is at least , where root fidelity is . Quantum executions are generated by identity and trace-preserving local Kraus maps at zero cost, transfers of positive integer dimensional factors in either direction costing , and finite composition adding costs, after finite-register relabeling. Put , , and . For positive eigenvalues counted with multiplicity, let and let be the logarithm of the minimum of over subsets of positive eigenvalue indices with total weight at least , without renormalizing them. Then
This includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.