Example 4: QC Pauli channels attain the bound and are tensor-power multiplicative
OpenQAlgorithms.Papers.Independent.Gap48.P36.qc_pauli_powersAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Use , , , and labels . Write and , with density inputs, Schatten norm, and von Neumann entropy. Let be independent of and satisfy . Then
The matrix keeps the computational diagonal. The channel admits rank-one Kraus matrices, hence is entanglement breaking, and attains the sorted block bound for every labeled sorted arrangement. The factor corrects the last expression of (71).
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Example 4, PDF pp.24–25: normalized QC channel, sharp bound and all positive powers.
Correction to (71): summing the clock conjugations gives d times the diagonal. -/
theorem qc_pauli_powers (d : ℕ) [NeZero d] (a : ZMod d → ℝ)
(ha : ∀ j, 0 ≤ a j) (hsum : (d : ℝ) * ∑ j, a j = 1)
(p : ℝ) (hp : 1 ≤ p) :
let Phi := randomUnitary (finWeyl d) (fun jk => a jk.1)
(∀ rho, Phi rho = (d : ℂ) •
(∑ j : ZMod d, (a j : ℂ) •
(finWeyl d (1,0) ^ j.val * Matrix.diagonal (fun i => rho i i) * (finWeyl d (1,0) ^ j.val)ᴴ))) ∧
nu (ENNReal.ofReal p) Phi = Real.rpow (∑ j, Real.rpow ((d : ℝ) * a j) p) (1 / p) ∧
HasRankOneKraus Phi ∧
(∀ e : (Fin d × Fin d) ≃ WeylLabel d, SortedRows (fun jk => a jk.1) e →
nu (ENNReal.ofReal p) Phi = blockBound p (fun jk => a jk.1) e) ∧
(∀ m : ℕ, 1 ≤ m → nu (ENNReal.ofReal p) (piSuperop (fun _ : Fin m => Phi)) =
nu (ENNReal.ofReal p) Phi ^ m) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every function satisfying and , and every real , define , where if modulo and otherwise, , and these matrices are reindexed from residues to by their standard representatives; set . For a square complex matrix , write , with matrix powers defined by continuous functional calculus, and write . Then every complex matrix satisfies
There also exist a natural number and vectors , with no normalization requirements, such that for every . For every bijection such that implies , one has
Finally, for every natural number , , where the tensor power is defined on arbitrary matrices by
with the matrix unit. The cases and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.