§III (17)–(19): inclusions and performance monotonicity
ProvedQAlgorithms.Papers.Independent.Support50.P11.code_inclusions_and_performanceLet be a finite-dimensional CPTP channel and . Codes are actual CPTP bipartite operations from the sender's -dimensional system and to and the receiver's -dimensional system, non-signalling from Bob to Alice. Write UA, EA, FCA, FHA, NS and PPTp for unassisted, entanglement-assisted, forward-classical-assisted, forward-Horodecki-assisted, non-signalling and PPT-preserving codes. Their inclusions are
Consequently their optimal channel fidelities satisfy
at , and their operational memoryless quantum capacities satisfy the identical two chains. These comparisons transport operational performance through the code inclusions.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
section Statements
variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]
/-- PDF p.5, (17)--(19): class inclusions, finite-size fidelity monotonicity,
and the corresponding operational quantumCodeCapacity inequalities. There is no EA/PPTp inclusion. -/
theorem code_inclusions_and_performance
(N : Superop I O) (hN : IsChannel N) (K : ℕ) (hK : 0 < K) :
(∀ Z : Superop (Fin K × O) (I × Fin K),
(IsForwardCode K .UA Z → IsForwardCode K .EA Z) ∧
(IsForwardCode K .EA Z → IsForwardCode K .NS Z) ∧
(IsForwardCode K .UA Z → IsForwardCode K .FCA Z) ∧
(IsForwardCode K .FCA Z → IsForwardCode K .FHA Z) ∧
(IsForwardCode K .FHA Z → IsForwardCode K .PPTp Z)) ∧
optimalCodeFidelity .UA N K ≤ optimalCodeFidelity .EA N K ∧ optimalCodeFidelity .EA N K ≤ optimalCodeFidelity .NS N K ∧
optimalCodeFidelity .UA N K ≤ optimalCodeFidelity .FCA N K ∧ optimalCodeFidelity .FCA N K ≤ optimalCodeFidelity .FHA N K ∧
optimalCodeFidelity .FHA N K ≤ optimalCodeFidelity .PPTp N K ∧
quantumCodeCapacity .UA N ≤ quantumCodeCapacity .EA N ∧ quantumCodeCapacity .EA N ≤ quantumCodeCapacity .NS N ∧
quantumCodeCapacity .UA N ≤ quantumCodeCapacity .FCA N ∧ quantumCodeCapacity .FCA N ≤ quantumCodeCapacity .FHA N ∧
quantumCodeCapacity .FHA N ≤ quantumCodeCapacity .PPTp N := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types , with their required finite structures and decidable equality, every channel , and every natural number , the assertion gives code inclusions and corresponding inequalities as follows. A channel here means a function represented on every matrix by finitely many Kraus matrices , , with . Every code below is a channel satisfying for every , for some channel . Its additional class condition is: , for channels ; , is obtained by adjoining a positive semidefinite trace-one state on finite auxiliary registers of positive sizes and applying separate channels to the first input with the first auxiliary register and the second input with the second auxiliary register; , some channel satisfies for all ; , is formed from channels , , and , with positive finite sizes for , by applying , passing through , and applying , where for all ; , the same construction, but is required to be a channel whose unnormalized Choi matrix , with , has positive semidefinite partial transpose on its output factor; and , both and are channels, where transposes the second register, . The asserted inclusions, each for every such function , are
For a channel and a size- code , define
Let be the real supremum, over class- forward codes, of , where , and define the score as zero at . Let be the extended nonnegative supremum of real rates such that , with defined on matrix units by the product of their images and with empty products equal to . The theorem asserts all the inequalities
The hypothesis includes , and no equality or attainment of the displayed suprema is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.