Section III.C: pure-state optimistic and pessimistic entanglement erasure
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.pureState_entanglementErasureLet be a normalized pure state on finite nonzero spaces, and let . For and , define as the least number of product-unitary terms in a COLUR ensemble whose output on is within full trace norm of a normalized separable state. The feasible sizes are nonempty and their minimum is attained. The normalized logarithmic cost sequences and their outer error suprema are bounded. Define the optimistic and pessimistic entanglement-erasure rates using and , respectively, followed by the supremum over . Then
This is the unconditional pure-state erasure theorem, including product states. The conjectured optimum for retained classical correlations is not used.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P47
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)
open scoped Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.8, III.C: unconditional pure-state erasure; no conjectural classical optimum is included. -/
theorem pureState_entanglementErasure {A B : Type} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (psi : EuclideanSpace ℂ (A × B)) (hpsi : IsState psi) :
(∀ eps > (0 : ℝ), ∀ n, 0 < n →
(disentanglingSizes (pureDensity psi) n eps).Nonempty ∧
minimumDisentanglingSize (pureDensity psi) n eps ∈
disentanglingSizes (pureDensity psi) n eps) ∧
(∀ eps > (0 : ℝ), BddBelow (Set.range (entanglementBlockRate (pureDensity psi) eps)) ∧
BddAbove (Set.range (entanglementBlockRate (pureDensity psi) eps))) ∧
(∀ pessimistic,
BddAbove {v | ∃ eps > (0 : ℝ),
v = rateLimit pessimistic (entanglementBlockRate (pureDensity psi) eps)} ∧
entanglementErasure (pureDensity psi) pessimistic =
vnEntropy (traceRight (pureDensity psi))) ∧
totalErasure (pureDensity psi) .coordinated .size true =
2 * vnEntropy (traceRight (pureDensity psi)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P47
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite nonempty types and vector with Euclidean norm one, put , where , and let have entries . A random local-unitary operation on copies means a positive finite number of pairs of local unitaries, with nonnegative weights summing to one, acting by ; zero weights and repeated unitary pairs are permitted and still contribute to . Let be the set of such counts for which is within trace norm of a separable density matrix, meaning a finite convex combination of tensor products of positive semidefinite trace-one matrices. Write , with the infimum taken in the natural numbers, and
The theorem asserts that for every real and every natural , is nonempty and belongs to it; for every , the range of is bounded both below and above; and, for either choice of as the real or , the set is bounded above and
It also asserts
where the infimum ranges over the random local-unitary families just described and over density matrices ; the two local choices may be coordinated through their common index. Here and . The finite-block assertions exclude , while ranges over all positive reals without an upper restriction.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.