Balanced convex decomposition of a standard-form unital qubit channel
OpenQAlgorithms.Papers.Independent.Support50.P13.phaseDampingBalancedDecompositionLet be a unital completely positive trace-preserving linear map in standard form: for the ordered Pauli matrices , suppose with real parameters satisfying . Put , which equals and is nonnegative. Let be any qubit density matrix. Then there exist , nonnegative real coefficients with , and unitary qubit matrices , such that
The phase-damping map preserves diagonal entries and multiplies off-diagonal entries by . The family may depend on the given state , but it decomposes the entire channel. This is the convex decomposition used to obtain balanced half-noisy bounds.
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 pp.11-12, (54)-(56), Lemma 4 and (59).
Standard form means Pauli diagonality and lambda_3=max |lambda_i|<=1.
For each given state the chosen family decomposes Phi on ALL operators.
Coefficients here are nonnegative, as required for a convex combination. -/
theorem phaseDampingBalancedDecomposition
(Phi : Superop (Fin 2) (Fin 2)) (hPhi : IsChannel Phi)
(hPhiUnital : Phi 1 = 1) (lam : Fin 3 → ℝ)
(hX : Phi (qubitPauli pauliX) = (lam 0 : ℂ) • qubitPauli pauliX)
(hY : Phi (qubitPauli pauliY) = (lam 1 : ℂ) • qubitPauli pauliY)
(hZ : Phi (qubitPauli pauliZ) = (lam 2 : ℂ) • qubitPauli pauliZ)
(hhigh : lam 2 ≤ 1) (hmax : ∀ i, |lam i| ≤ lam 2)
(r : Matrix (Fin 2) (Fin 2) ℂ) (hr : IsDensityMatrix r) :
∃ (N : ℕ) (c : Fin N → ℝ)
(U W : 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) ℂ) r).trace = 0) ∧
∀ A : Matrix (Fin 2) (Fin 2) ℂ,
Phi A = ∑ i, (c i : ℂ) •
conjSuperop (W i : Matrix (Fin 2) (Fin 2) ℂ)
(phaseChannel (1 : Matrix (Fin 2) (Fin 2) ℂ) (lam 2)
(conjSuperop (U i : Matrix (Fin 2) (Fin 2) ℂ) A)) := 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 . Let be real numbers such that
where
For every positive semidefinite trace-one matrix , there exist a natural , nonnegative real coefficients summing to , and unitary matrices such that as a complex equality for every , and, for every complex matrix ,
The coefficient hypotheses include and ; coefficients are allowed, and the balance condition is required even for such indices. The chosen decomposition may depend on , but its displayed identity must hold for every matrix , without a positivity or normalization restriction on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.