Proposition III.2: randomness compression for an exactly disentangling block
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.disentangling_compressionLet be a density matrix on finite nonzero spaces and let . Fix a coordinated local product-unitary map on copies such that the constructed output is separable. For every there exists such that for every a uniform coordinated product-unitary ensemble on copies, with terms, satisfies
Tensor copies of are explicitly regrouped in the same party order as the -copy input. In particular, -disentangles this input. This compresses the randomness needed to reproduce an exactly disentangling block asymptotically.
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 pp.6--7, Proposition III.2: the input contains k*n copies, not n copies. -/
theorem disentangling_compression {A B : Type} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
(hrho : IsDensityMatrix rho) (k : ℕ) (hk : 0 < k)
(T : COLUR (Copies A k) (Copies B k))
(hT : Entanglement.IsSeparableDensity (T.operation (sourcePower rho k)))
(eps : ℝ) (heps : 0 < eps) :
∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ R : COLUR (Copies A (k*n)) (Copies B (k*n)),
(∀ i, R.weight i = (R.count : ℝ)⁻¹) ∧
traceNorm (R.operation (sourcePower rho (k*n)) -
(Matrix.of fun (x y : Copies A (k*n) × Copies B (k*n)) => ∏ t : Fin n,
T.operation (sourcePower rho k)
((fun s => x.1 (blockIndex t s)),
(fun s => x.2 (blockIndex t s)))
((fun s => y.1 (blockIndex t s)),
(fun s => y.2 (blockIndex t s))))) ≤ eps ∧
Disentangles (R.operation (sourcePower rho (k*n))) eps ∧
Real.logb 2 R.count ≤ (n : ℝ) *
(vnEntropy (T.operation (sourcePower rho k)) - k * vnEntropy rho + eps) := 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 , and operation on that is a finite mixture of paired local unitary conjugations with nonnegative weights summing to , assume that is a separable density matrix, meaning a finite convex combination of products of local density matrices. Here . For every real , there exists a positive integer such that, for every natural number , there exists an operation on with a positive finite number of paired local unitary conjugations, all of whose weights equal , such that
Its output is also within trace norm of some separable density matrix, and
Here and . Both and the asserted block counts are positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.