Unnumbered formula (33): filtered canonical noisy complement
ProvedQAlgorithms.Papers.Independent.Gap48.P36.filtered_noisy_complementAll 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 . Let , , and . Write for the canonical conjugate using Kraus matrices , and . With and , every input matrix obeys
The filter is . The correct displayed normalization is retained despite the scalar omission in the following prose.
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 formula (33), PDF p.14: all matrices; keep the d^2 factor.
Correction: the following prose prints filter sqrt(A); use d sqrt(A).
A filter contributes its scalar twice, giving the displayed d^2 in (33). -/
theorem filtered_noisy_complement [Nonempty A] [Nonempty K]
(T : UnitaryBasis A K) (a : K → ℝ) (ha : ProbabilityWeights a) :
∀ rho : Matrix A A ℂ,
randomComplement T.matrix a rho = (Fintype.card A : ℂ)^2 •
(weightRoot a * noisyComplement T.matrix rho * weightRoot a) ∧
randomComplement T.matrix a rho = (Fintype.card A : ℂ)^2 •
Matrix.hadamard (fun j k => (Real.sqrt (a j) : ℂ) * (Real.sqrt (a k) : ℂ))
(noisyComplement T.matrix rho) := 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 be finite nonempty types with decidable equality, put , and let be complex matrices on , with a distinguished label , satisfying , , , and for and otherwise. Let and . Define two maps to matrices on by
which are the complementary maps formed from Kraus families and , respectively, and put . Then, for every complex matrix on , with no positivity or trace assumption,
where is entrywise multiplication. Zero weights are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.