Asymptotic state redistribution at half the conditional mutual information
OpenQAlgorithms.Papers.Independent.Intakenext100.P75.redistribution_achievabilityLet be any pure density operator on finite-dimensional nonzero complex systems and put . A sender holding transfers to a receiver holding , with untouched. Each protocol has arbitrary independent shared density operator , a CPTP encoder , and a CPTP decoder , with . Fidelity compares the full output, including , with .
There exist protocols for copies, positive numbers tending to zero, and a convergent communication rate such that, writing for the full reconstructed state and ,
Here is squared fidelity and uses entropy in bits. This is an achievability statement with a chosen vanishing error schedule.
Formalization Note Lean indexes positive block lengths by . The smooth-entropy upper bound in (34) is the derivation of the final asymptotic rate, rather than a separately asserted one-shot bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P75
namespace QAlgorithms.Papers.Independent.Intakenext100.P75
open scoped Matrix ComplexOrder
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)
variable {A B C D Ap Bp Cp R I J K L : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype D] [DecidableEq D] [Nonempty D]
variable [Fintype Ap] [DecidableEq Ap] [Nonempty Ap]
variable [Fintype Bp] [DecidableEq Bp] [Nonempty Bp]
variable [Fintype Cp] [DecidableEq Cp] [Nonempty Cp]
variable [Fintype R] [DecidableEq R] [Nonempty R]
/-- PDF p.6, (34)–(36): actual full-state redistribution protocols with
vanishing infidelity and a convergent communication rate at most I(A:B|C)/2.
The vanishing smoothing schedule is existential, not arbitrary. -/
theorem redistribution_achievability
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty R] (psi : Mat (B × (R × (A × C))))
(hpure : IsPure psi) :
∃ protocols : (n : ℕ) → Redistribution (Fin (n + 1) → A) (Fin (n + 1) → C)
(Fin (n + 1) → R),
∃ epsilon : ℕ → ℝ, ∃ rate : ℝ,
(∀ n, 0 < epsilon n ∧ epsilon n < 1 / 12) ∧
Filter.Tendsto epsilon Filter.atTop (nhds 0) ∧
(∀ n, 1 - 144 * epsilon n ^ 2 ≤
fidelity ((protocols n).output (fullCopies psi (n + 1)))
(fullTarget (fullCopies psi (n + 1)))) ∧
Filter.Tendsto (fun n => (protocols n).cost / (n + 1 : ℝ)) Filter.atTop (nhds rate) ∧
rate ≤ conditionedLastCMIBits (discardReference psi) / 2 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P75
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let on , where . There exist redistribution objects for registers , real numbers , and a real number , such that for every natural number , , and
Here has entries equal to products of entries of , grouped on ; the target simply reassociates these coordinates to . Each consists of positive message and assistance dimensions , a positive semidefinite trace-one assistance matrix on the two assistance registers, an encoder , and a decoder ; both maps have finite Kraus representations with . Its output tensors in the assistance, applies the encoder while retaining and Bob’s assistance, then applies the decoder while retaining . Moreover, , , and , using the indicated partial traces and coordinate ordering, with defined by spectral functional calculus and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.