Proposition III.1: approximate disentangling converse
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.disentangling_converseLet be a density matrix on finite nonzero spaces, , , and . Suppose is a finite coordinated product-unitary ensemble with probabilities and terms whose output on is within full trace norm of a normalized separable state. Let consist of all pairs with any COLUR map on the copies, separable and normalized, and . Then is nonempty, its following entropy objective is bounded below, and
The final has no factor . This is the approximate disentangling converse and optimizes over all channels and targets, rather than targets near one fixed channel.
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.6, Proposition III.1: optimization includes R as well as its separable target.
The final erasureEta(eps) is not multiplied by n. -/
theorem disentangling_converse {A B : Type} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
(hrho : IsDensityMatrix rho) (n : ℕ) (hn : 0 < n) (eps : ℝ) (heps : 0 ≤ eps)
(T : COLUR (Copies A n) (Copies B n))
(hT : Disentangles (T.operation (sourcePower rho n)) eps) :
(separableEntropyCosts rho n eps).Nonempty ∧
BddBelow (separableEntropyCosts rho n eps) ∧
sInf (separableEntropyCosts rho n eps) ≤ entropyExchange T.operation (sourcePower rho n) ∧
entropyExchange T.operation (sourcePower rho n) ≤ shannon T.weight ∧
shannon T.weight ≤ Real.logb 2 T.count := 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 , density matrix on , positive integer , real , and operation , where , the local matrices are unitary, and the weights are nonnegative and sum to , write for the regrouped -fold tensor power of . Assume there exists a separable density matrix with ; a separable density matrix means a finite convex combination of tensor products of local positive semidefinite trace-one matrices. Define to consist of all values
obtained from any such finite mixture of paired local unitary conjugations and any separable density matrix satisfying . Then is nonempty and bounded below, and
Here , the canonical purification has coefficients , , and for and otherwise. Zero weights and are included, with the total logarithm convention .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.