Section V, Eq. (16): multipartite total erasure and successive local decorrelation
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.multipartite_totalErasureLet and let be a density matrix with finite positive local dimensions . Define multipartite erasure rates by minimizing finite ensembles of product unitaries whose output on independent copies is within full trace norm of a normalized fully product state, dividing by , taking or , and then taking the supremum over . Feasible finite costs are nonempty, bounded below, and attain their minima; normalized sequences and outer error suprema are bounded. For coordinated or independent local randomness and each of the costs ,
Moreover, for every , eventually every admits exactly successive uniform local randomizations , with stage acting only on party , such that
and the composed output is within trace norm of a fully product state. The tail information quantities are computed from actual compatible marginals of the original state. For the protocol is empty and the rate is zero. This states both Eq. (16) and its successive local protocol.
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.9--10, (16) and the protocol paragraph: total erasure and successive local decorrelation.
All three costs, both block limits, and independent/coordinated randomness have the same rate.
Only p-1 stages are used. The p=1 boundary is the empty protocol, of zero cost. -/
theorem multipartite_totalErasure {p : ℕ} (hp : 0 < p) (d : Fin p → ℕ)
(hd : ∀ i, 0 < d i)
(rho : Matrix (Config d) (Config d) ℂ)
(hrho : IsDensityMatrix rho) :
(∀ eps > (0 : ℝ), ∀ independent cost,
(∀ n, 0 < n → (multiCosts rho n eps independent cost).Nonempty ∧
BddBelow (multiCosts rho n eps independent cost) ∧
sInf (multiCosts rho n eps independent cost) ∈ multiCosts rho n eps independent cost) ∧
BddBelow (Set.range (multiBlockRate rho eps independent cost)) ∧
BddAbove (Set.range (multiBlockRate rho eps independent cost))) ∧
(∀ independent cost pessimistic,
BddAbove {v | ∃ eps > (0 : ℝ),
v = rateLimit pessimistic (multiBlockRate rho eps independent cost)} ∧
multiErasure rho independent cost pessimistic = multiInformation rho) ∧
(∑ j, tailInformation rho j) = multiInformation rho ∧
(∀ eps > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ R : Fin (p-1) → MultiNoise (MultiCopies d n),
(∀ j t i, i.val ≠ j.val → (R j).unitary t i = 1) ∧
(∀ j t, (R j).weight t = ((R j).count : ℝ)⁻¹) ∧
(∀ j, Real.logb 2 (R j).count ≤
(n : ℝ) * (tailInformation rho j + eps / p)) ∧
(∑ j, Real.logb 2 (R j).count) ≤ (n : ℝ) * (multiInformation rho + eps) ∧
MultiDecorrelates (successiveBlockOutput R (multiSourcePower rho n)) 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
Let be a natural number, let be natural dimensions for , and let be a positive semidefinite matrix of complex trace on . Write and . For a subset of parties, define , summing over full configurations restricting to on and agreeing outside , and put
For block length , give party the space and set . A noise choice has a positive count , weights summing to , and local unitaries , giving with . For a Boolean and cost kind , let be the real costs of such choices satisfying for some positive semidefinite trace-one ; if , additionally require a bijection from the global choice set to a product of positive-sized local choice sets, product probability weights, and each party’s unitary depending only on its local choice, while adds no restriction. The three costs are , , and , respectively for size, entropy, and exchange, where has the transposed entries of the formal square root of in the finite enumeration used by the definition. Set , and let mean its real when and real when . The theorem asserts all of the following conjunctions: for every , every Boolean , and every cost kind , each with is nonempty and bounded below and contains its real infimum, and the range of is bounded both below and above; for every , the set is bounded above and its real supremum equals ; and
Moreover, for every , there exists a positive natural such that for every there are noise choices , , whose local unitary is the identity at every party , whose every weight equals , and which satisfy
Applying successively in that order to produces an output within trace norm of a product of local positive semidefinite trace-one matrices. The case is included: the tail-index family, both sums over , and the list of successive operations are empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.