Unnumbered appendix formula (93): exact unital-qubit output p-norm
OpenQAlgorithms.Papers.Independent.Gap48.P36.qubit_output_normAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Write and , with density inputs, Schatten norm, and von Neumann entropy. For a qubit Pauli probability channel with four nonnegative weights summing to one, label the identity by and the three axes by the nonzero binary Pauli labels. Put and choose maximizing . For real ,
Both projectors are rank-one normalized optimizers with two nonzero Pauli coefficients, and they attain the sorted block bound. Here is the Hermitian representative, using on the mixed label. Degenerate weights and are included.
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]
/-- Unnumbered exact qubit formula (93), PDF p.31: largest absolute Bloch multiplier.
The two eigenvalues are (1 plus/minus lambda)/2, including lambda=0 and 1. -/
theorem qubit_output_norm (a : WeylLabel 2 → ℝ) (ha : ProbabilityWeights a)
(k : WeylLabel 2) (hk : k ≠ 0)
(hmax : ∀ j : WeylLabel 2, j ≠ 0 → |qubitLambda a j| ≤ |qubitLambda a k|)
(p : ℝ) (hp : 1 ≤ p) :
nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a) =
Real.rpow (Real.rpow ((1 + qubitLambda a k) / 2) p +
Real.rpow ((1 - qubitLambda a k) / 2) p) (1 / p) ∧
nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a) =
Real.rpow (Real.rpow (a 0 + a k) p +
Real.rpow (∑ j ∈ (Finset.univ.erase 0).erase k, a j) p) (1 / p) ∧
(∀ positive : Bool, IsDensityMatrix (qubitAxisState k positive) ∧
Matrix.rank (qubitAxisState k positive) = 1 ∧
FlatSupport (finWeyl 2) (qubitAxisState k positive) 2 ∧
schattenNorm (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a (qubitAxisState k positive)) =
nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a)) ∧
(∀ e : (Fin 2 × Fin 2) ≃ WeylLabel 2, SortedRows a e →
nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a) = blockBound p a e) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let satisfy and , let , and suppose that for every nonzero , where . For every real , put , with , , and define . Write , using continuous functional calculus, and . Then
Set when , and otherwise. For each Boolean choice , the matrix , where for true and for false, is positive semidefinite with trace , has rank , and satisfies ; furthermore, exactly two labels have , and every such coefficient has complex modulus . For every bijection satisfying , one also has
Ties in the maximizing absolute value are permitted, and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.