Sections 2.5 and 4.5: entanglement-generation capacity equals Q
OpenQAlgorithms.Papers.Independent.Gap20.P07.generationCapacity_eqLet be a memoryless CPTP channel between nonzero complex Hilbert spaces. For each positive block length, permit a finite nonzero logical space and any normalized pure reference/input state . Require the squared overlap of with the maximally entangled target to tend to one. Let be the extended supremum of positive limsup logical-dimension rates. Then
The input need not be maximally entangled and there is no initially shared entanglement between sender and receiver. This identifies the entanglement-generation variant.
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.5,19--20: arbitrary normalized entanglement-generation inputs are
allowed; teleportation and removal of forward communication yield Q. -/
theorem generationCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
variableSourceGenerationCapacity T = qubitReferenceCapacity 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 arbitrary nonempty types, with no finiteness or countability assumption. For matrices on a label type , call trace class if there are sequences with summable and , and let be the infimum of the corresponding nonnegative extended real costs , with empty infimum . A density matrix here is such a trace class matrix whose finite principal quadratic forms are real and nonnegative, whose real diagonal entries are summable, and whose real diagonal sum is . Call a map a trace class channel when it preserves trace class matrices, is additive and complex homogeneous on them, and, for every , its blockwise amplification to an ancillary label sends density matrices to density matrices. For a map , define
Let be any trace class channel from matrices on to matrices on , and let mean the recursively defined map applying successively to each coordinate, with the zeroth power acting identically on the singleton empty-coordinate matrix. For positive integers , set
where and range over trace class channels from to and from to , respectively. The declaration equates the following two suprema of strictly positive real rates , regarded as elements of , with an empty supremum equal to : first, the rates for which there exist positive integers , trace class channels and , and unit vectors , such that
where and ; second, the rates for which every pair of sequences of positive integers satisfying and in the nonnegative extended reals satisfies . The vectors in the first supremum are existentially chosen arbitrary unit vectors.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.