Every rank-two two-qutrit antisymmetric state is PPT-irreversible
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.rank_two_antisymmetric_irreversibleAll 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 any state on whose operator range has dimension exactly two and lies in the antisymmetric subspace. Then
Thus every mixed rank-two state in this subspace has a strict asymptotic Bell-pair yield/cost gap. Pure endpoints are excluded by the rank hypothesis.
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 pp.1--2,4,7: every rank-two two-qutrit
antisymmetric density state has PPT yield strictly below its one-ebit cost. -/
theorem rank_two_antisymmetric_irreversible
(rho : Matrix (Fin 3 × Fin 3) (Fin 3 × Fin 3) ℂ)
(hstate : IsDensityMatrix rho) (hrank : stateRank rho = 2)
(hsupport : antisymmetricSupported rho) :
pptDistillable rho < 1 ∧ asymptoticEntanglementCost false rho = 1 := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P90
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every complex matrix indexed by , assume that is positive semidefinite, , its column-space dimension over is exactly , and
Then
These quantities take values in the extended real line and have the following literal definitions. Write , , and if and , and otherwise. A channel is a map for a finite family satisfying ; it is a PPT channel when both it and are channels. The matrix , with the copies of each party grouped together, has entries . The quantity is the supremum of real such that, for every tolerance , all sufficiently large natural admit a PPT channel taking within trace norm of . The quantity is the infimum of real such that, for every , all sufficiently large positive natural admit a natural and a PPT channel taking within trace norm of , with . In these definitions the grouped input or output bases are relabelled by the fixed bijections with finite initial segments used in the code.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.