Unnumbered result: FQSW-derived redistribution inner bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P42.fqswInnerBoundLet be a normalized pure state on finite nonzero registers. Initially Alice holds , Bob holds , and is inaccessible. Alice must transfer to Bob while retaining and preserving the complete source and reference.
With one-way qubit communication and arbitrary local CPTP maps, the FQSW construction achieves the rate pair
Here rates and entropies are in bits; is signed Bell consumption, with distinct natural input and output Bell counts and denoting generation. For every positive error and rate slack, all sufficiently large positive IID blocks have a protocol with full joint source/reference and final Bell-pair trace-norm error within the error tolerance.
This gives the source's merging-based inner bound. Treating as reference in the construction does not remove it from Alice's final output.
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 pp.17--18: FQSW-derived achievable pair. Ahat remains Alice's final
register although this construction treats it as reference. E is NEGATIVE. -/
theorem fqswInnerBound {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 (mergingClassicalCost psi / 2) (-redistributionReceiverInformation 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 satisfy . For each collection of registers, obtain from by summing entries over equal complementary labels, and write , where is applied by continuous functional calculus, with . Set
The assertion is that and that, for every and , there is a natural number such that every with admits natural numbers and two channels: an encoder from together with qubits to , qubits, and a -qubit message, and a decoder from that message together with and qubits to and qubits. Each channel has a finite Kraus representation with . Starting from and the shared vector , applying the encoder and then the decoder while leaving unchanged produces a matrix satisfying
The target coordinates place with the encoder and with the decoder; . Zero values of are permitted, and is not required to be nonnegative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.