Exact optimal classical teleportation fidelity
OpenQAlgorithms.Papers.Independent.Intakenext100.P18.classical_benchmarkLet and use the normalized uniform Haar distribution of pure -dimensional inputs. For any finite POVM with and , and any density operators , the classical measure-and-prepare channel is . Its average squared survival fidelity obeys
The channel , implemented by computational-basis measurement, classical communication and preparation of the reported basis state, attains equality. Equivalently, every separable bipartite density operator has fixed plus overlap at most , and some separable density attains .
Thus is the achieved classical optimum. The statement includes explicit membership of in the measure-and-prepare class and does not rely on a default-valued real supremum.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P18
noncomputable section
open QAlgorithms MeasureTheory
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Intakenext100.P18
open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)
open QAlgorithms.Papers.Independent.Support50.P11 (choiState teleportWeyl bellKet)
open QAlgorithms.Papers.Independent.Renew46.P40 (initialJoint)
/-- PDF p.8, section IV: optimal purely classical fidelity, with a named
achiever as well as the upper bound against every measure/prepare channel.
The equivalent singlet bound is stated for every separable density. -/
theorem classical_benchmark (d : ℕ) (hd : 0 < d) :
letI : Nonempty (Fin d) := ⟨⟨0, hd⟩⟩;
(∀ k : ℕ, ∀ M tau : Fin k → Matrix (Fin d) (Fin d) ℂ,
IsPOVM M → (∀ i, IsDensityMatrix (tau i)) →
QuditFidelity.averageFidelity d hd ((fun X => ∑ i, (M i * X).trace • tau i)) ≤ 2 / (d + 1 : ℝ)) ∧
(∃ k : ℕ, ∃ M tau : Fin k → Matrix (Fin d) (Fin d) ℂ,
IsPOVM M ∧ (∀ i, IsDensityMatrix (tau i)) ∧ (fun X => ∑ i, (M i * X).trace • tau i) = basisClassical d) ∧
IsChannel (basisClassical d) ∧
QuditFidelity.averageFidelity d hd (basisClassical d) = 2 / (d + 1 : ℝ) ∧
(∀ rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ,
Entanglement.IsSeparableDensity rho → effectProb (maximallyEntangledDensity d) rho ≤ 1 / (d : ℝ)) ∧
(∃ rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ,
Entanglement.IsSeparableDensity rho ∧ effectProb (maximallyEntangledDensity d) rho = 1 / (d : ℝ)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P18
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , define , where and is normalized Haar measure on the unitary group. For every natural number , every family of positive semidefinite matrices satisfying , and every family of positive semidefinite trace-one matrices , the map satisfies . There exist such for which this map equals for every ; moreover, admits a finite Kraus representation with , and . Let be the outer product of with itself. Every separable density matrix , meaning a finite sum with , , and each positive semidefinite of trace , satisfies ; at least one such separable density matrix attains equality. The universal quantification includes , whose requirement cannot hold for positive , and includes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.