Unnumbered result: tightness for absent sender/receiver side information
OpenQAlgorithms.Papers.Independent.Intakethird100.P42.degenerateRedistributionTightnessLet be a normalized pure state on finite nonzero registers, with initial ownership at Alice and at Bob. Suppose or . Null registers have dimension one.
For the same one-way qubit and signed Bell-resource redistribution task, a pair is achievable if and only if
Achievability uses arbitrary local CPTP maps, separate Bell input/output counts, every positive error and rate slack, all sufficiently large positive IID blocks, and full joint source/reference and final Bell-pair trace-norm error. All entropies are in bits.
For absent sender side information the FQSW corner achieves the outer bound; for absent receiver side information the FQRS corner does so. Allowed resource trades extend the corner to the whole displayed region.
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: the outer region is achieved if Ahat or B is null. Null means
one-dimensional, never empty; arbitrary extra qubits can be traded for Bell pairs. -/
theorem degenerateRedistributionTightness {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)
(hnull : Fintype.card A = 1 ∨ Fintype.card B = 1) (Q E : ℝ) :
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 satisfy , and assume or , allowing both equalities. Form , obtain for any register collection by summing over equal complementary labels, and write , where is applied by continuous functional calculus and . For every , the two inequalities
hold if and only if and the following operational condition holds: for every , some natural works for every with , giving natural numbers , an encoder channel from and qubits to , qubits, and a -qubit message, and a decoder channel from that message, , and qubits to and qubits, such that , , and their output on , leaving unchanged, differs from the projector onto by trace norm at most . Here , the target places at the encoder and at the decoder, each channel has a finite Kraus representation with , and . Zero values of and arbitrary real are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.