Remark III.3: entropy exchange is a reference-preserving noise-compression rate
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.referencePreserving_compressionFix a density matrix on finite nonzero spaces and a coordinated local product-unitary map . For every there exists such that for every there is a COLUR ensemble with actual product-unitary terms for which
The error test holds for any finite purifying reference and any normalized purification of the fixed source ; the ensemble is chosen before that purification. The tensor-power channel is evaluated on all matrix units. This gives the reference-preserving noise-compression meaning of entropy exchange for a fixed source.
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.7, Remark III.3: compression tested jointly with every finite purifying reference.
The approximating ensemble is chosen before the purification, not uniformly over other inputs. -/
theorem referencePreserving_compression {A B : Type} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
(hrho : IsDensityMatrix rho) (T : COLUR A B) (eps : ℝ) (heps : 0 < eps) :
∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ R : COLUR (Copies A n) (Copies B n),
Real.logb 2 R.count ≤ (n : ℝ) * (entropyExchange T.operation rho + eps) ∧
∀ (Z : Type) [Fintype Z] [Nonempty Z]
(psi : EuclideanSpace ℂ (Z × (Copies A n × Copies B n))), IsState psi →
traceLeft (pureDensity psi) = sourcePower rho n →
traceNorm (idTensorSuperop R.operation (pureDensity psi) -
idTensorSuperop (regroupedChannelPower T.operation n) (pureDensity psi)) ≤ 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 , finite mixture with a positive number of terms, local unitaries, and nonnegative weights summing to , and real , there exists a positive integer such that, for every natural number , there exists another finite mixture of paired local unitary conjugations on , with a positive number of terms, satisfying
For this same , every finite nonempty reference type and every norm-one vector on whose partial trace over equals satisfy
Here has entries ; is the tensor power regrouped across and , whose matrix-unit coefficients are ; and . The canonical purification has coefficients , , and . The weights of are not required to be uniform.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.