Section II, Eq. (4): ordering of three finite noise costs
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.noiseCost_orderLet be a density matrix on finite nonzero complex spaces, and let be a chosen finite product-unitary ensemble, with , , and . Let , using . If purifies , define . Then
The first two costs depend on the implementing ensemble, whereas the last depends only on its channel and the source state. This orders the finite noise resources used in the erasure converses.
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.3, (4): the three costs of a chosen implementing ensemble are ordered. -/
theorem noiseCost_order {A B : Type} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
(hrho : IsDensityMatrix rho) (R : COLUR A B) :
entropyExchange R.operation rho ≤ shannon R.weight ∧
shannon R.weight ≤ Real.logb 2 R.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 , any positive semidefinite matrix on with trace , and any positive-length list of pairs of local unitaries , with nonnegative weights summing to , let . The declaration asserts
where , has entries , and , with matrix functions given by continuous functional calculus. Zero weights and repeated unitaries are allowed, so counts all entries of the specified list, including entries of weight zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.