Section 3.3 / (28): properties of the partial-transposition bound
OpenQAlgorithms.Papers.Independent.Gap20.P07.partialTranspose_propertiesFor CPTP channels on nonzero complex Hilbert spaces, define , allowing . It has the following properties:
The second formula requires composability. For every integer ,
Also whenever is completely positive; it is then CPTP because is trace preserving. In particular the bound vanishes if every reference extension of has positive-partial-transpose output on every input state. In both vanishing cases as well. These give all stated capacity-like properties and the PPT consequence.
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 p.11, (28): all four capacity-like properties, and the PPT consequence.
PPT is expressed for all reference systems by normalized positive partial transposes. -/
theorem partialTranspose_properties :
(∀ {I J K L : Type} [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L]
(S : Operation I J) (T : Operation K L),
IsTraceClassChannel S → IsTraceClassChannel T →
transposeBound (traceClassTensorMap S T) = transposeBound S + transposeBound T) ∧
(∀ {I J K : Type} [Nonempty I] [Nonempty J] [Nonempty K]
(S : Operation J K) (T : Operation I J),
IsTraceClassChannel S → IsTraceClassChannel T →
transposeBound (S ∘ T) ≤ min (transposeBound S) (transposeBound T)) ∧
(∀ d : ℕ, 0 < d → transposeBound (id : Operation (Fin d) (Fin d)) =
qubitReferenceCapacity (id : Operation (Fin d) (Fin d)) ∧
qubitReferenceCapacity (id : Operation (Fin d) (Fin d)) = ENNReal.ofReal (Real.logb 2 d)) ∧
(∀ {I J : Type} [Nonempty I] [Nonempty J] (T : Operation I J),
IsTraceClassChannel T → IsTraceClassChannel (T ∘ transpose) →
transposeBound T = 0 ∧ qubitReferenceCapacity T = 0) ∧
(∀ {I J : Type} [Nonempty I] [Nonempty J] (T : Operation I J),
IsTraceClassChannel T →
(∀ (A : Type) (rho : State (I × A)),
QAlgorithms.Papers.Independent.Dependency50.P33.IsDensity
(tensorApply transpose (tensorApply T rho.coefficients))) →
transposeBound T = 0 ∧ qubitReferenceCapacity T = 0) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any index type , call trace class if for vectors in with finite , and let be 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 after adjoining every finite ancillary register. For any map , its ancillary extension is , and . Write , without conjugation, and put , where and, for finite , , with . Define as the supremum in of real such that every positive-integer sequence pair , satisfying and , has , where are channel encoders and decoders between the corresponding registers. Powers recursively apply to the first-coordinate block and then the remaining coordinates, with zeroth power evaluating at the unique empty tuples; the empty rate supremum is . The assertion is the conjunction of five statements: for every four nonempty types and channels , on matrix spaces, , where the joint map is explicitly
for every three nonempty types and channels , , ; for every integer , , including ; for every pair of nonempty types and channel , if is also a channel, then ; and, for every such , if for every type and every density on the matrix
is a density, then again . In this last condition each extension uses the same block formula, and has no countability or nonemptiness restriction; for empty there is no density to test.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.