Noisy-singlet fidelities
OpenQAlgorithms.Papers.Independent.Intakenext100.P18.noisy_singlet_fidelitiesLet , , and , where is the normalized -dimensional plus Bell projector. Write and let be the squared survival probability, averaged over normalized Haar pure inputs, of the actual complete Bell measurement and correction teleportation protocol using . Then is a density operator and
When , either fidelity uniquely determines within . When , every member of the family equals . These identities connect the two fidelity conventions without confusing them with root fidelity.
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.5, (14)--(16): original mixture range, both fidelities and both
bounds. Parameter uniqueness is asserted only in dimensions at least two. -/
theorem noisy_singlet_fidelities (d : ℕ) (hd : 0 < d) (p : ℝ)
(hp : 0 ≤ p) (hp1 : p ≤ 1) :
IsDensityMatrix (noisySinglet d hd p) ∧
QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) =
p + (1 - p) / d ∧
1 / (d : ℝ) ≤ QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) ∧
QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) ≤ 1 ∧
effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) = p + (1 - p) / (d : ℝ)^2 ∧
1 / (d : ℝ)^2 ≤ effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) ∧
effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) ≤ 1 ∧
QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) =
((d : ℝ) * effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) + 1) / (d + 1 : ℝ) ∧
(2 ≤ d → ∀ r : ℝ, 0 ≤ r → r ≤ 1 →
(effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) = effectProb (maximallyEntangledDensity d) (noisySinglet d hd r) → p = r) ∧
(QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) =
QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd r)) → p = r)) ∧
(d = 1 → ∀ r : ℝ, 0 ≤ r → r ≤ 1 → noisySinglet d hd r = maximallyEntangledDensity 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 and every real , let , let , and put . Define , for , by when , and otherwise; set and . The map used for teleportation with resource is
where the partial trace removes the first two of the three factors. For any map , define its average fidelity by , where is normalized Haar measure on the unitary group and . Then is positive semidefinite with trace , and, with ,
If , then for every real , either equality or equality implies . If , then for every real .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.