Depolarizing products: multiplicativity and explicit purities
OpenQAlgorithms.Papers.Independent.Support50.P31.depolarizingPuritiesLet , let be the dimensions of complex Hilbert spaces , and let . Define the depolarizing channels , and their actual tensor product . For a channel , write for the maximum output Schatten -norm over all density inputs (operator norm when ), and for the minimum least output eigenvalue, including zero. Then
These are exact identities for arbitrary density inputs on the joint space, including entangled states.
Source correction. The printed last product uses in every dimension. A scalar channel is the identity and has least output eigenvalue ; the displayed scalar branch corrects that edge without discarding it.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
noncomputable section
open Filter Asymptotics
open scoped ComplexConjugate ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P31
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)
/-- PDF pp.11–12, final Theorem (i)–(iii), with the p.9 convention.
Printed (iii) is corrected for dimension one: its factor is 1, not p.
All three multiplicativity identities and explicit values are retained. -/
theorem depolarizingPurities {n : ℕ} (hn : 0 < n) (d : Fin n → ℕ) (hd : ∀ i, 0 < d i)
(p : Fin n → ℝ) (hp : ∀ i, 0 < p i ∧ p i < 1) :
(nuP 2 (depolarizingProduct d hd p) =
∏ i, nuP 2 (QuditFidelity.depolarizingMap (d i) (hd i) (p i)) ∧
(∏ i, nuP 2 (QuditFidelity.depolarizingMap (d i) (hd i) (p i))) =
∏ i, Real.sqrt ((((d i : ℝ) - 1) / (d i : ℝ)) * (1 - p i) ^ 2 + 1 / (d i : ℝ))) ∧
(nuP ⊤ (depolarizingProduct d hd p) =
∏ i, nuP ⊤ (QuditFidelity.depolarizingMap (d i) (hd i) (p i)) ∧
(∏ i, nuP ⊤ (QuditFidelity.depolarizingMap (d i) (hd i) (p i))) =
∏ i, (1 - p i * ((d i : ℝ) - 1) / (d i : ℝ))) ∧
(nuMinus (depolarizingProduct d hd p) =
∏ i, nuMinus (QuditFidelity.depolarizingMap (d i) (hd i) (p i)) ∧
(∏ i, nuMinus (QuditFidelity.depolarizingMap (d i) (hd i) (p i))) =
∏ i, if d i = 1 then 1 else p i / (d i : ℝ)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , every family of positive natural dimensions indexed by , and every family of real parameters , define the map on complex matrices by , and let be their tensor map: its matrix entries on an arbitrary input are , where range over and is the matrix unit. For a map on a finite matrix space, let be the supremum, over positive semidefinite matrices of trace one, of ; let be the supremum over these inputs of the Euclidean operator norm ; and let be the infimum over these inputs of the smallest eigenvalue of . The declaration asserts all three identities
Dimensions equal to one are permitted; an empty family of factors is excluded by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.