Proposition 9: Pauli-diagonal 2-norm bound and qutrit attainment
OpenQAlgorithms.Papers.Independent.Gap48.P36.pauli_two_normAll 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 and with nonnegative weights summing to one. Define , used only through its modulus, and . Then
For , each maximizing nonzero label gives a rank-one density , , attaining the bound and maximum. No phase-sensitive eigenvalue claim from (38)–(40) is made.
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]
/-- Proposition 9, PDF pp.16–17: use (39) only in modulus, as in (42).
Correction: the Fourier exponent printed i2pi i/d is read as 2pi i/d;
unitary conjugation (36)-(37) and (43) require a phase, not a real exponential.
The remaining extraneous phase is retained and disappears in modulus.
At d=3 the WHOLE bracket is divided by three. -/
theorem pauli_two_norm (d : ℕ) [NeZero d] (hd : 2 ≤ d) (a : WeylLabel d → ℝ) (ha : ProbabilityWeights a) :
nu 2 (randomUnitary (finWeyl d) a) ≤ pauliTwoBound d a ∧
(d = 3 → ∀ jk : WeylLabel d, jk ≠ 0 →
‖printedMultiplier d a jk‖^2 = maxPauliMultiplierSq d a →
let rho := (3 : ℂ)⁻¹ • (1 + finWeyl d jk + finWeyl d jk ^ 2)
IsDensityMatrix rho ∧ Matrix.rank rho = 1 ∧ schattenNorm 2 (randomUnitary (finWeyl d) a rho) =
nu 2 (randomUnitary (finWeyl d) a) ∧ nu 2 (randomUnitary (finWeyl d) a) = pauliTwoBound d a) := 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 with the assumptions and , let have nonnegative values summing to . On the basis indexed by , define , , and , where bars denote representatives in . Set , and define
Then , where and . Moreover, if , then for every nonzero label satisfying , the matrix
is positive semidefinite with trace , has rank , and satisfies . The supremum defining ranges over all nonzero labels, a nonempty finite set under .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.