§VII (62): generalized Werner–Holevo covariance and block simulation
OpenQAlgorithms.Papers.Independent.Support50.P11.werner_covariance_block_simulationFor an integer and , define
This is CPTP and, for every unitary and every operator ,
For each , the parallel block has an exact local simulation with forward classical communication using its normalized Choi state, equivalently single-use Choi states. For every ,
The output conjugation corrects the printed order in (62) using the channel's defining formula; both endpoints of are included.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.10--11, (62): the output conjugation is by entrywise conjugate U.
Printed U^T X conjugate(U) is corrected using (58)--(59). All parallel blocks admit
exact Choi simulation and have exactly the PPT distillation performance. -/
theorem werner_covariance_block_simulation
(d : ℕ) (hd : 2 ≤ d) (alpha : ℝ) (ha0 : 0 ≤ alpha) (ha1 : alpha ≤ 1) :
IsChannel (wernerHolevoChannel d alpha) ∧
(∀ U : Matrix.unitaryGroup (Fin d) ℂ, ∀ X,
wernerHolevoChannel d alpha (conjSuperop (U : Matrix (Fin d) (Fin d) ℂ) X) =
conjSuperop (fun i j => conj ((U : Matrix (Fin d) (Fin d) ℂ) i j))
(wernerHolevoChannel d alpha X)) ∧
(∀ n : ℕ, 0 < n →
HasChoiSimulation (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) ∧
∀ K : ℕ, 0 < K →
optimalCodeFidelity .PPTp (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) K =
distillFidelity (choiState (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha))) K) := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer and real , define the map on complex matrices
Then is a channel and, for every unitary on and every matrix ,
Here channels mean finite Kraus maps with . Furthermore, for every positive integer , the tensor power , defined on product matrix units by applying in every coordinate, can be simulated from , where : there exist a positive integer , a channel with diagonal output on every input, and a channel such that for every , where
For every positive integer , the optimal PPT code fidelity for equals the real supremum of over maps for which both and are channels. Here projects onto , and transposes the second bipartite factor. The optimal code fidelity is the real supremum of over channels such that is a channel and for every , for some channel ; the linked map has entries
The block quantifier excludes and includes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.