Standard teleportation realizes the depolarizing channel
OpenQAlgorithms.Papers.Independent.Intakenext100.P18.depolarizing_teleportationLet and . Define the noisy singlet and the linear depolarizing map . Let be the reference-first normalized Choi map and let be the channel computed by the complete Bell measurement with its outcome-conditioned Weyl correction, using one resource copy. Then is a channel and
The fixed plus overlap of equals the entanglement fidelity of , and their standard-teleportation and channel Haar-average fidelities agree. This supplies the physical recovery that is special to this channel family.
Formalization Note The accepted depolarizing map uses noise weight, so the source retention parameter is supplied as . Equality of maps ranges over every operator, including non-unit-trace operators.
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.6, (19)--(20): depolarizing channels and noisy singlets are
mathematically and operationally equivalent through the actual Bell protocol. -/
theorem depolarizing_teleportation (d : ℕ) (hd : 0 < d) (p : ℝ)
(hp : 0 ≤ p) (hp1 : p ≤ 1) :
IsChannel (retentionChannel d hd p) ∧
choiState (retentionChannel d hd p) = noisySinglet d hd p ∧
choiInverse d (noisySinglet d hd p) = retentionChannel d hd p ∧
standardTeleport d (noisySinglet d hd p) = retentionChannel d hd p ∧
QuditFidelity.entanglementFidelity d hd (retentionChannel d hd p) =
effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) ∧
QuditFidelity.averageFidelity d hd (retentionChannel d hd p) =
QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) := 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 real , define , , , and . For any matrix map , put , and put . Define by , let be the outer product of with itself, and define
Here a channel is a map with a finite Kraus representation , valid for every , with . Define , and define , where and is normalized unitary Haar measure. Then is a channel and
These assertions include and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.