Lemma 8: corrected white-noise conversion criterion
OpenQAlgorithms.Papers.Independent.Intakethird100.P19.whiteNoise_conversionAll Hilbert spaces are finite-dimensional complex spaces with fixed product bases and positive local dimensions. States are positive semidefinite operators of trace one; pure kets have norm one. Let , with pure states on and on , and decreasing squared Schmidt coefficients . Define
This is a channel and is non-entangling if . Under this condition it is also dually non-entangling if
Dually non-entangling means that both the channel and its trace dual preserve separable positive operators.
The cross-multiplied inequalities retain product-state cases.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P19
noncomputable section
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakethird100.P19
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P19 (Bip)
open QAlgorithms.Papers.Independent.Information100.P69 (CP)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
/-- Lemma 8, PDF pp.11-12, corrected from its proof: printed Eq.(8)
omits 1+ in the denominator. Use (1+d^2 sqrt(mu_1 mu_2))*lambda_1<=1.
Eq.(9) is cross-multiplied to include zero second Schmidt coefficients.
The printed Bell-to-Bell case violates PPT preservation of separable inputs. -/
theorem whiteNoise_conversion {k d : ℕ} (hk : 2 ≤ k) (hd : 2 ≤ d)
(psi : UnitBipartiteKet k k) (phi : UnitBipartiteKet d d)
(hfirst : (1 + (d : ℝ) ^ 2 * Real.sqrt (schmidtAt phi.ket 0 * schmidtAt phi.ket 1)) *
schmidtAt psi.ket 0 ≤ 1) :
let L := binaryMeasurePrepare psi.rho phi.rho (((d : ℂ) ^ 2)⁻¹ • (1 : Bip d d))
IsChannel L ∧ NE L ∧
(((d : ℝ) ^ 2 * schmidtAt phi.ket 0 - 1) *
Real.sqrt (schmidtAt psi.ket 0 * schmidtAt psi.ket 1) ≤ 1 → DNE L) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers and unit vectors and , let and . For either vector , let and be the largest and second-largest eigenvalues, counting multiplicities, of its first marginal ; these include zero eigenvalues. If , define the map on every input operator by . Then is a channel and is non-entangling. Moreover, if , then both and its trace-bilinear dual are non-entangling. Here a channel has a finite Kraus representation with ; a non-entangling map has a finite Kraus representation, without a normalization requirement, and preserves the cone of finite nonnegative sums of tensor products of positive semidefinite trace-one matrices, including the empty sum. The trace-bilinear dual is defined entrywise by , where is the input matrix unit.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.