Section V: equivalence of ss equality and private-capacity additivity
OpenQAlgorithms.Papers.Independent.Support50.P07.ssEquality_iff_privateAdditivityThe following two universal propositions, each ranging over all finite nonzero quantum channels, are equivalent:
The statement asserts the equivalence, not the truth of either conjecture.
All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.
This result supplies a capacity identity or bound for the channel family and resource model stated above.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P07
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
dilationPower idealJoint maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)
variable {A B E C D F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]
variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]
/-- Section V, PDF p.8: equivalence of two universally quantified conjectures.
Neither proposition is asserted true; all finite nonzero input/output/environment
sizes are quantified separately, and the product inputs can be entangled. -/
theorem ssEquality_iff_privateAdditivity :
(∀ a b e : ℕ, 0 < a → 0 < b → 0 < e →
∀ U : Matrix (Fin b × Fin e) (Fin a) ℂ, IsIsometry U →
ssPrivateCapacity U = fullTracePrivateCapacity U) ↔
(∀ a b e c d f : ℕ, 0 < a → 0 < b → 0 < e → 0 < c → 0 < d → 0 < f →
∀ (U : Matrix (Fin b × Fin e) (Fin a) ℂ)
(V : Matrix (Fin d × Fin f) (Fin c) ℂ), IsIsometry U → IsIsometry V →
fullTracePrivateCapacity (productDilation U V) = fullTracePrivateCapacity U + fullTracePrivateCapacity V) := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
The following two universally quantified statements are equivalent: first, for every three positive integers and every complex matrix satisfying , one has ; second, for every six positive integers and all matrices and satisfying and , one has
For any such dilation , means the supremum of nonnegative rates such that, for every and , there exists an integer for which every integer admits messages, density matrices on , and positive semidefinite measurement matrices on summing to , with and
where . The quantity is defined by the same supremum and accuracy and rate quantifiers, except that each block length may additionally choose a positive integer , use input matrices on invariant under swapping the two -indices separately in rows and columns, and measure . Its dilation sends the two added indices unchanged to the receiver and environment respectively: its entry is between input and output . In the same error formula the environmental marginal therefore includes . In both definitions message indices range over , density matrices are positive semidefinite with trace , and , without a factor . All six dimensions in the second statement, and all three in the first, must be strictly positive; either statement imposes no condition on dimensions equal to zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.