Unnumbered result: FQRS-derived redistribution inner bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P42.fqrsInnerBoundLet be a normalized pure state on finite nonzero registers, with Alice initially holding , Bob holding , and inaccessible reference . The goal is to transfer to Bob while retaining all other source systems with their original ownership.
The FQRS construction achieves
Communication is one-way quantum communication with arbitrary local CPTP maps; is input minus output Bell-pair consumption. The IID interpretation uses every positive error and rate slack, all sufficiently large positive blocklengths, and full joint source/reference and final Bell-pair trace-norm reconstruction. Entropies and rates are in bits.
This is the source's reverse-Shannon inner bound. The construction treats as reference but retains Bob's in the output error test.
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: FQRS-derived achievable pair, with B included in the joint output
and reference test. Both communication and consumed entanglement have factor 1/2. -/
theorem fqrsInnerBound {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) :
RedistributionAchievable psi (fqrsQuantum psi) (senderMutual psi / 2) := 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 and let have norm . Define , reduce to any register collection by summing over equal complementary labels, and put , where is applied by continuous functional calculus and . Set
The theorem asserts and the following quantified existence statement: for every , some natural works for every with , so that there exist natural numbers , an encoder channel , and a decoder channel . Here each channel acts on matrices by a finite sum with . On the initial vector , where , the encoder followed by the decoder, with untouched, produces a matrix such that
The target retains at the encoder and places at the decoder, and . The natural numbers may be zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.