Abstract main result; §V (49): non-signalling and entanglement-assisted quantum capacities coincide
OpenQAlgorithms.Papers.Independent.Support50.P11.nonSignalling_capacity_eq_entanglementAssistedLet be any CPTP channel between positive finite-dimensional systems with fixed computational bases. For assistance class , let be the supremum of normalized entanglement fidelities of actual forward-assisted bipartite codes of size . Define the operational memoryless capacity by
Here NS imposes non-signalling in both directions on the code, and EA permits arbitrary shared states and local operations. Then
The equality concerns parallel memoryless blocks and operational vanishing entanglement error, with rates in qubits per use.
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.8, (49), abstract p.1: the two operational memoryless quantum capacities coincide. -/
theorem nonSignalling_capacity_eq_entanglementAssisted
(N : Superop I O) (hN : IsChannel N) : quantumCodeCapacity .NS N = quantumCodeCapacity .EA 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 input and output index types , with the finite structures and decidable equality required by the definitions, let be a channel from matrices on to matrices on : explicitly, there are finitely many matrices such that for every and . The assertion is equality of the following two extended nonnegative real capacities. To define them, a size- forward code for a channel is a channel from to for which some channel satisfies for every matrix . In the non-signalling class, one additionally requires a channel with for every . In the entanglement-assisted class, one instead requires positive integers , a positive semidefinite trace-one matrix on registers of sizes , and channels , , such that adjoins , regroups the registers as , and applies . For either class, form the linked map
Its score for is , where ; for the score is defined as zero. Let be the real supremum of these scores over class- forward codes. The class- capacity is the extended nonnegative supremum of all real for which
Here the tensor map is defined on matrix units by tensoring their images, equivalently ; the sequence includes , using empty products equal to . The theorem states that the capacity obtained from the non-signalling class equals that obtained from the entanglement-assisted class.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.