Proposition 5.1: redistribution converse outer bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P42.redistributionOuterBoundLet be a normalized pure state on finite nonzero registers. Alice initially owns , Bob owns , and is inaccessible. A redistribution protocol transfers to Bob, leaves with Alice, and reconstructs the joint source/reference state and final Bell pairs with vanishing full trace-norm error. Only one-way qubit communication, Bell resources, and arbitrary local CPTP maps are allowed.
Every asymptotically achievable pair of qubit rate and signed net Bell consumption rate satisfies
Rates use every positive error and rate slack and all sufficiently large positive IID blocklengths. All information quantities are in bits and are computed from this same pure source.
This is a converse outer bound. The conditional mutual information is stated with the printed conditioning register ; pure-state entropy duality identifies it with conditioning on .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P42
open scoped BigOperators ComplexConjugate ENNReal
open Filter
open QAlgorithms.Papers.Independent.Dependency50.P07
open QAlgorithms.Papers.Independent.Gap48.P20
open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability shannon)
attribute [local instance] Classical.decEq Classical.propDecidable
/-- PDF p.18, Proposition 5.1: converse only, with the source's conditioning
on Ahat and signed net Bell consumption. Alice retains Ahat and Bob retains B. -/
theorem redistributionOuterBound {A C B R : Type}
[Fintype A] [Fintype C] [Fintype B] [Fintype R]
[Nonempty A] [Nonempty C] [Nonempty B] [Nonempty R]
(psi : EuclideanSpace ℂ (RedistributionSource A C B R)) (hpsi : IsState psi)
(Q E : ℝ) (h : RedistributionAchievable psi Q E) :
printedQuantumCost psi ≤ Q ∧ conditionalCost psi ≤ Q + E := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types, let have norm , and let . Assume and that, for every , there is a natural such that for every with there are natural numbers and encoder and decoder channels with the following properties. The encoder takes and qubits to , qubits, and a -qubit message; the decoder takes that message, , and qubits to and qubits. A channel here is a map for a finite Kraus family satisfying . Starting with and , these channels, applied in that order with unchanged, produce a matrix within trace norm of the projector onto , with retained by the encoder and at the decoder, and satisfy and . The trace norm is , and may be zero. Form ; for a register collection , reduce by summing over equal complementary labels and define , where is applied by continuous functional calculus, with . The conclusion is precisely
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.