Exact PPT yield and regularized Rains value of rho_v
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.rhoV_distillation_rainsAll 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 and . Define and . Then
The operational yield is strictly below one ebit. No identification of the continuous one-copy SDP with an unrounded integer Bell rank is used.
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.4, Proposition 3, Eq.(7): both quantitative equalities. -/
theorem rhoV_distillation_rains :
pptDistillable rhoV = (Real.logb 2 (1 + 1 / Real.sqrt 2) : EReal) ∧
regularizedRains rhoV = (Real.logb 2 (1 + 1 / Real.sqrt 2) : EReal) := 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 , with coordinate basis kets on , and let , where a vector’s outer product has entries . Then, in the extended real line,
Write and . A channel is a finite Kraus sum with ; a PPT channel is one whose input-output partial-transpose conjugate is also a channel. The quantity is the supremum of real such that, for every , every sufficiently large natural admits a PPT channel satisfying . Tensor powers have entries given by products, with each party’s registers grouped; the hat means the fixed relabelling by finite initial segments. The matrix has entry if its row and column each have equal party indices, and otherwise. Finally,
where if , and otherwise. Matrix logarithms use spectral functional calculus with . The matrices in this infimum are not required to have trace .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.