Strict fixed-entanglement advantage over pure TMSS teleportation
OpenQAlgorithms.Papers.Independent.Intakethird100.P89.tmssEntanglementComparisonLet and be finite. Let be the closed-region Gaussian optimum, equal to the finite-energy BK fidelity supremum, and let be the independently defined optimized-gain fidelity for a fixed pure TMSS of logarithmic negativity . Then
Each equality holds if and only if . Both inequalities are strict for . For each fixed ,
The advantage concerns shared logarithmic negativity, with no simultaneous fixed-energy constraint. In the first branch of (13), the larger optimum is a limiting supremum rather than a finite-energy attainable value. The broad-prior saturation is a limit of normalized ensembles.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P89
noncomputable section
open MeasureTheory Filter
open scoped BigOperators ENNReal Topology ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakethird100.P89
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsTraceClassChannel tensorApply traceSize)
open QAlgorithms.Papers.Independent.Dependency50.P39
(coherentKet coherentCoefficient operatorOfMatrix husimiQ HasFockMatrix CoherentRealized)
open QAlgorithms.Papers.Independent.Frontier30.P14 (weylCharacteristic)
open QAlgorithms.Papers.Independent.Claimed50.P19
(Cov FockIndex DensityKernel PhysicalCovariance CharacteristicSummable
multimodeWeylTrace covarianceCharacteristicValue standardFormCovariance)
open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)
open QAlgorithms.Papers.Independent.Gap48.P26 (PhaseInsensitive coherentKernel)
open QAlgorithms.Entanglement (partialTransposeFirst)
/-- PDF p.4, after (16): strict entanglement advantage at finite nonzero prior
width and r>0; both equality cases are r=0. The first gap vanishes as lambda->0+.
This compares fixed entanglement, without asserting equal resource energies. -/
theorem tmssEntanglementComparison (lambda r : ℝ) (hlambda : 0 < lambda) (hr : 0 ≤ r) :
tmssOptimum lambda r ≤ scalarOptimum lambda r ∧
scalarOptimum lambda 0 ≤ tmssOptimum lambda r ∧
(scalarOptimum lambda r = tmssOptimum lambda r ↔ r = 0) ∧
(tmssOptimum lambda r = scalarOptimum lambda 0 ↔ r = 0) ∧
(0 < r → tmssOptimum lambda r < scalarOptimum lambda r ∧
scalarOptimum lambda 0 < tmssOptimum lambda r) ∧
Tendsto (fun ell => scalarOptimum ell r - tmssOptimum ell r)
(nhdsWithin 0 (Set.Ioi 0)) (𝓝 0) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P89
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real and every real , define the following two real suprema. First, let
Second, let , let be its standard coordinate vector, and put
Define as the supremum of over every state indexed by , every real gain , and every function from complex matrices indexed by to such matrices, satisfying the conditions below. Here a matrix indexed by a set is called trace class precisely when there exist sequences such that is summable and for every . A state is a matrix of this kind for which, for every finite and every , the number has imaginary part zero and nonnegative real part, and whose real diagonal entries form a summable family with sum . The required conditions on are that for all , that , and that sends trace-class matrices to trace-class matrices, is additive and complex homogeneous on trace-class inputs, and has the following finite-extension property: for every integer and every state indexed by , the matrix
is a state. This includes , for which there are no states on the empty index set. To state the remaining condition and the objective, define the matrices
For every input state indexed by and every , require
For a matrix indexed by , let be a chosen bounded complex-linear operator on satisfying for all , if such an operator exists, and let otherwise. Let be a chosen vector with coordinates
if such a vector exists, and let it be zero otherwise; set . The fidelity appearing in the definition of is
where is Lebesgue measure. The infinite sums and integral here use their total definitions; the optimization conditions impose no separate summability or integrability hypotheses on these expressions. Both suprema are the total real supremum operation, whose value is for an empty set or a set unbounded above. With these definitions, the declaration asserts all of
and
Thus the endpoint is included, and at that endpoint both displayed equalities hold. Finally, for each such fixed ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.