Strict separation between regularized Rains and PPT relative entropy
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.rhoV_strict_separationAll systems are finite-dimensional complex Hilbert spaces with fixed orthonormal product bases and positive local dimensions. A state is a positive semidefinite operator of trace one. All logarithms are base two and all operational rates are measured in standard Bell pairs (ebits) per input copy, with deterministic operations and error tending to zero. Write for distillable entanglement and entanglement cost under completely PPT-preserving CPTP operations; an explicit LOCC subscript denotes unrestricted two-way local operations and classical communication.
Let be the equal mixture of the unit antisymmetric kets and . Let be the positive-block regularization of the Rains bound and that of relative entropy to normalized PPT states. Then
This is the full equality/strict-inequality/equality chain announced as the main contribution in Eq. (3).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P90
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P90
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Dependency50.P36
(relativeEntropy rains target canonicalMatrix allowed pptDistillable)
open QAlgorithms.Papers.Independent.Information100.P04 (gamma copies IsPPT)
open QAlgorithms.Papers.Independent.Next46.P42 (regroupProduct)
open QAlgorithms.Papers.Independent.Information100.P06 (supportProjection)
open QAlgorithms.Papers.Independent.Information100.P21 (FiniteLOCC)
open QAlgorithms.Papers.Independent.Gap48.P32 (antisymmetricQutrit)
/-- arXiv:1606.09421v3, PDF p.2, Eq.(3): preserve the full strict chain. -/
theorem rhoV_strict_separation :
pptDistillable rhoV = regularizedRains rhoV ∧
regularizedRains rhoV < regularizedPptRelativeEntropy rhoV ∧
regularizedPptRelativeEntropy rhoV = asymptoticEntanglementCost false rhoV := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P90
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let for , using coordinate basis kets on , and let , with outer-product entries . The assertion is the extended-real conjunction
Here transposes the second party, , and . Define when , and otherwise, using spectral functional calculus and . Then
A channel is a finite Kraus sum with , and it is PPT if its input-output partial-transpose conjugate is also a channel. The quantity is the supremum of real such that, for every , all sufficiently large natural admit a PPT channel mapping within trace norm of . The quantity is the infimum of real such that, for every , all sufficiently large positive natural admit and a PPT channel mapping within trace norm of , with . The matrix has entry when both row and column have equal party indices and otherwise; tensor-power entries are products, party registers are grouped and relabelled by fixed finite-index bijections, and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.