Unnumbered (31): a unitary orthogonal basis gives the completely noisy channel
ProvedQAlgorithms.Papers.Independent.Gap48.P36.orthogonal_basis_noiseAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let be a basis of unitaries on , including , with . For every complex input matrix ,
Thus each such basis generates the completely noisy channel. The identity includes nonstates and the case .
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 twirling identity (31), PDF p.14: every input matrix, including nonstates. -/
theorem orthogonal_basis_noise [Nonempty A] [Nonempty K] (T : UnitaryBasis A K) :
∀ rho : Matrix A A ℂ,
((Fintype.card A : ℂ)^2)⁻¹ • (∑ k, T.matrix k * rho * (T.matrix k)ᴴ) =
(rho.trace / (Fintype.card A : ℂ)) • (1 : Matrix A 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 any finite nonempty index types , each equipped with decidable equality, let be complex matrices on with a distinguished index satisfying , with , with for every , and with when and otherwise. Then every complex matrix on , without any positivity or normalization hypothesis, satisfies
The nonemptiness assumption ensures ; the case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.