Sufficient condition for attaining the trace-norm fidelity bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P43.trace_norm_bound_attainmentAll operators act on a finite bipartite space in a fixed product basis. Write for Bob's partial transpose and , where . A density operator is positive semidefinite with complex trace exactly one. An admissible PPT map is complex-linear, positive and trace preserving, and is positive on every positive operator. A PPT channel is additionally completely positive; complete positivity of the transpose-conjugated map is not required. Fidelity means the overlap .
Let , , and let be any density operator. Let be the negative spectral projector of . If , then is admissible and its isotropic PPT channel attains the optimal overlap:
The optimum is over admissible positive PPT maps. This is a sufficient condition only and includes PPT states, for which and .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P43
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P43
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P04
(gamma copies bellProjector negativeProjector werner)
open QAlgorithms.Papers.Independent.Information100.P30 (IsPositiveMap)
/-- PDF p.3, last sentence before Section III: sufficient condition for attaining
(10), with the explicit epsilon=2 channel. Includes PPT states, where P_neg=0.
The nontrivial target restriction m>=2 is inherited from (6); no converse is asserted. -/
theorem trace_norm_bound_attainment (d m : ℕ) (hd : 0 < d) (hm : 2 ≤ m)
(rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ)
(hrho : IsDensityMatrix rho)
(hsmall : specNorm (gamma (negativeProjector rho)) ≤ 1/2) :
let A := negativeSpaceWitness rho m 2
RainsFeasibleEffect m A ∧ IsPositiveConjugatePPTChannel (isotropicPreparation m A) ∧
effectProb (bellProjector m) (isotropicPreparation m A rho) = traceNorm (gamma rho) / (m : ℝ) ∧
IsGreatest (positivePPTFidelityValues rho m) (traceNorm (gamma rho) / (m : ℝ)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers and and every positive semidefinite complex matrix of trace one indexed by , define and , using functional calculus with the function that is one on strictly negative eigenvalues and zero elsewhere. Suppose that the Euclidean operator norm satisfies , with no assumption that has a negative eigenvalue. Set , let have entry when both row and column pairs have equal components and zero otherwise, and define
Then is Hermitian and , , , and are positive semidefinite. The map is positive, trace preserving, completely positive, and satisfies for every ; complete positivity means positivity of its blockwise extension by every finite identity map, including auxiliary size zero. Its overlap satisfies
This number is the greatest element of the set of overlaps over all complex-linear maps to the -dimensional output matrix space that are positive, preserve every matrix’s trace, and satisfy for every : it is itself attained and is at least every other value in that set, whose defining maps need not be completely positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.