A single balanced ensemble bounds every real output p-norm
OpenQAlgorithms.Papers.Independent.Support50.P13.halfNoisyBalancedEnsembleLet be a unital completely positive trace-preserving qubit channel, let , and let be any positive semidefinite trace-one matrix on . Put , tracing out the first register, and let . There exist an integer , strictly positive real numbers summing to one, and unitary qubit matrices , such that for every , and simultaneously for every finite real ,
Here for positive matrices, is the supremum of this output norm over all qubit density matrices, erases off-diagonal qubit entries, and . The same ensemble may depend on and but works for all , which permits simultaneous use of the bound across the norm family.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P13
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P13
open QAlgorithms.Papers.Independent.Gap48.P03
(productChannel maximumOutputPNorm holevoQuantity depolarizingNormFactor
phaseChannel qubitPauli)
open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Dependency50.P23 (ordinaryClassicalCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- King quant-ph/0103156v2, PDF p.6, Theorem 3, (19)-(20).
A single finite strictly positive ensemble works simultaneously for all real p>=1.
The reduced state is computed by tracing out the first register.
The superfluous closing parenthesis on the printed left side has no meaning. -/
theorem halfNoisyBalancedEnsemble
(Phi : Superop (Fin 2) (Fin 2)) (hPhi : IsChannel Phi)
(hPhiUnital : Phi 1 = 1)
(K : ℕ) (hK : 0 < K)
(rho : Matrix (Fin K × Fin 2) (Fin K × Fin 2) ℂ)
(hrho : IsDensityMatrix rho) :
∃ (N : ℕ) (c : Fin N → ℝ) (U : Fin N → Matrix.unitaryGroup (Fin 2) ℂ),
1 ≤ N ∧ (∀ i, 0 < c i) ∧ (∑ i, c i) = 1 ∧
(∀ i, ((qubitPauli pauliZ) *
conjSuperop (U i : Matrix (Fin 2) (Fin 2) ℂ) (traceLeft rho)).trace = 0) ∧
∀ p : ℝ, 1 ≤ p →
schatten p (idTensorSuperop Phi rho) ≤
(depolarizingNormFactor 2 0 p)⁻¹ * maximumOutputPNorm Phi p *
∑ i, c i * schatten p
(idTensorSuperop (phaseChannel (1 : Matrix (Fin 2) (Fin 2) ℂ) 0)
(idTensorSuperop (conjSuperop (U i : Matrix (Fin 2) (Fin 2) ℂ)) rho)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P13
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let admit a finite Kraus representation with , and suppose . For every positive natural and every positive semidefinite trace-one matrix on , there exist a natural , strictly positive real coefficients summing to , and unitary matrices such that, writing and , one has the complex equality for every , and simultaneously for every real ,
Here , , uses the decreasing list of Hermitian eigenvalues with multiplicity, and . The factor is the reciprocal of . The same coefficients and unitaries must satisfy the inequality for all .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.