Irreversibility in the complex spectral parametrization
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.spectral_rank_two_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 , , and for complex qutrit vectors . Assume is a unit vector orthogonal to , so that the displayed expression is a spectral decomposition of the state
Then
Orthogonality is required also at . The statement retains arbitrary complex spectral data rather than restricting to the real-angle representative used after a local basis change.
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.4,7, Eq.(11) and Proposition 5. The spectral
vectors are unit and orthogonal, also when p=1/2; a,b may be complex. -/
theorem spectral_rank_two_irreversible
(rho : Matrix (Fin 3 × Fin 3) (Fin 3 × Fin 3) ℂ)
(p : ℝ) (a b : EuclideanSpace ℂ (Fin 3))
(hstate : IsDensityMatrix rho) (hp0 : 0 < p) (hp1 : p < 1)
(hunit : ‖exteriorKet a b‖ = 1)
(horth : inner ℂ (antisymmetricKet 1) (exteriorKet a b) = 0)
(hspectral : rho = (p : ℂ) • pureDensity (antisymmetricKet 1) +
((1-p : ℝ) : ℂ) • pureDensity (exteriorKet a b)) :
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 on , real , and vectors , assume that , , , and, on defining
one has , , and . Here kets are coordinate basis vectors, norms and inner products are Euclidean, and has entries ; the vectors themselves are not separately required to be normalized or orthogonal. The conclusion is and , with both quantities extended-real valued. Specifically, write , , and let have entry when both row and column have equal party indices and otherwise. A channel is a finite Kraus sum with ; it is PPT when its partial-transpose conjugate is also a channel. The quantity is the supremum of such that, for every , all sufficiently large natural admit a PPT channel taking within trace norm of . The quantity is the infimum of such that, for every , all sufficiently large positive natural admit and a PPT channel taking within trace norm of , with . Tensor-power entries are products of single-copy entries, party registers are grouped and relabelled by the fixed finite-index bijections, and is allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.