Section 3.3 / (25): partial transposition upper bound
OpenQAlgorithms.Papers.Independent.Gap20.P07.partialTranspose_upperBoundLet be a CPTP channel on nonzero complex Hilbert spaces, and let . With defined by eventual full-cb error at most and the fixed-basis input transpose,
The logarithmic bound is extended-valued when the norm is infinite. The basis choice does not affect its value. The proof needs only a fixed error strictly below one.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
noncomputable section
open Filter MeasureTheory
open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap20.P07
open QAlgorithms
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation isometryCoeff conjugateKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35
(stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
transpose transposeBound TraceLinear tracePair MeasurePrepare)
open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)
/-- PDF pp.10--11, (25)--(27): fixed full-cb epsilon<1 suffices; an infinite
transpose norm gives an infinite upper bound, never a real-supremum default. -/
theorem partialTranspose_upperBound {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T)
(epsilon : ℝ) (heps : 0 < epsilon) (heps1 : epsilon < 1) :
qubitReferenceCapacity T ≤ finiteErrorCapacity T epsilon ∧
finiteErrorCapacity T epsilon ≤ transposeBound T := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty types, let be a channel as defined below, and let . A trace-class matrix admits with square-summable vectors and finite ; is the infimum of these sums, with empty infimum . A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum . A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities under every finite ancillary extension. For any , let
Let , without complex conjugation, and define , where , and for finite , using the total-function convention . For positive integers , define as the infimum of over channel encoders into and channel decoders from . Powers recursively apply the map to the first-coordinate block and the remaining coordinates, with zeroth power evaluating at the unique empty tuples. Define as the supremum in of real such that every positive-integer sequence pair , with and , has . Define using instead eventual ; empty rate suprema are . Then
The endpoints and are excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.