§IV, unnumbered: Lo–Popescu residual states have large communication cost
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.residual_family_costFix a normalized bipartite pure state with positive Schmidt rank greater than one and nonflat positive spectrum, and write in bits. For every sufficiently small fixed error , there exist constants , a threshold , Bell counts , positive local residual dimensions , normalized residual vectors , and separate local isometric embeddings such that for ,
Every deterministic quantum protocol preparing from any finite EPR supply with squared fidelity at least has . All witnesses precede and the preparation protocol. The factorization is credited by the source to Lo–Popescu [17]; the cost conclusion is the present paper's application.
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.6, (20), and p.8: Lo--Popescu residual-family witnesses and their
entropy and preparation-cost bounds. The factorization credited to [17] is
expressed in reverse as local isometric embeddings of Bell pairs and the small
residual into the original registers; unused ambient basis vectors are irrelevant.
Neither the cost lower bound nor the factorization is assumed as a structure field. -/
theorem residual_family_cost {A B : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] (psi : EuclideanSpace ℂ (A × B)) (hnorm : ‖psi‖ = 1)
(hentangled : 1 < supportRank (aliceDensity psi)) (hnonflat : ¬ Flat (aliceDensity psi)) :
∃ epsilonStar : ℝ, 0 < epsilonStar ∧ epsilonStar ≤ 1 / 4096 ∧
∀ epsilon : ℝ, 0 < epsilon → epsilon < epsilonStar →
∃ K d : ℝ, 0 < K ∧ 0 < d ∧ ∃ N : ℕ,
∃ (m rA rB : ℕ → ℕ)
(chi : ∀ n, EuclideanSpace ℂ (Fin (rA n) × Fin (rB n)))
(U : ∀ n, Matrix (Fin n → A) (Fin (2 ^ m n) × Fin (rA n)) ℂ)
(V : ∀ n, Matrix (Fin n → B) (Fin (2 ^ m n) × Fin (rB n)) ℂ),
∀ n ≥ N,
0 < rA n ∧ 0 < rB n ∧ ‖chi n‖ = 1 ∧
|(m n : ℝ) - (n : ℝ) * entropyOne (aliceDensity psi)| ≤ K * Real.sqrt (n : ℝ) ∧
logTwo (rA n) ≤ K * Real.sqrt (n : ℝ) ∧
logTwo (rB n) ≤ K * Real.sqrt (n : ℝ) ∧
entropyOne (aliceDensity (chi n)) ≤ K * Real.sqrt (n : ℝ) ∧
(U n)ᴴ * U n = 1 ∧ (V n)ᴴ * V n = 1 ∧
fidelity (pureDensity (applyLocalMaps (U n) (V n) (tensorPureStates (eprPairs (m n)) (chi n))))
(pureDensity (pureStateCopies psi n)) ≥ 1 - epsilon ∧
∀ (k : ℕ) (cost : ℝ), QuantumPrepares (eprPairs k) (chi n) epsilon cost →
d * Real.sqrt (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
Let be arbitrary finite types with decidable equality, and let satisfy . Define its first reduced matrix by
Assume that the complex dimension of the range of is greater than one, and that its strictly positive eigenvalues are not all equal. These hypotheses exclude empty or . For any reduced density matrix , write
where are all its eigenvalues, counted with multiplicity, , and the zero-eigenvalue terms are zero. There exists a real with such that, for every real , there exist real constants and , a natural number , functions , vectors , and matrices
such that, for every , all the following hold simultaneously:
Here , , , and is obtained by first forming the vector with coordinates on the party grouping , then applying the local matrices, so
The notation means the matrix with entries , and , with square roots given by continuous functional calculus. Finally, for every such , every natural number , and every real cost , if some matrix obtainable from by a finite quantum execution of cost satisfies , then . A quantum execution permits identity and local Kraus maps with at zero cost, transfers of positive-dimensional registers in either direction at cost of their dimension, and sequential composition with addition of costs, after enumerating finite local registers. The matrices are required only to be isometries; all families are defined for every natural , but the listed conclusions are imposed only for , and no positive lower bound on is stipulated.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.