Theorem 12: projection, flat diagonal and stochastic modulus-square conditions
ProvedQAlgorithms.Papers.Independent.Gap48.P36.noisy_pure_conditionsAll 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 . Write for the canonical conjugate using Kraus matrices , and . For a unit vector put . Then
If each is a scalar phase times some basis element, also and is nonnegative with all row and column sums one. These are necessary pure-image conditions.
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]
/-- Theorem 12, PDF pp.19–20: all four clauses, with only (c,d) requiring (35).
Correction to (c): replace the printed complex-entry order by modulus,
as required by the unitary expectation bound. The overbar in (d) is kept. -/
theorem noisy_pure_conditions [Nonempty A] [Nonempty K]
(T : UnitaryBasis A K) (psi : EuclideanSpace ℂ A) (hpsi : IsState psi) :
let gamma := noisyComplement T.matrix (pureDensity psi)
gamma.IsHermitian ∧
((Fintype.card A : ℂ) • gamma) * ((Fintype.card A : ℂ) • gamma) =
(Fintype.card A : ℂ) • gamma ∧
Matrix.rank ((Fintype.card A : ℂ) • gamma) = Fintype.card A ∧
(∀ k, gamma k k = ((Fintype.card A : ℂ)^2)⁻¹) ∧
(PhaseClosed T → (∀ j k, ‖gamma j k‖ ≤ ((Fintype.card A : ℝ)^2)⁻¹) ∧
DoublyStochastic (fun j k => (Fintype.card A : ℝ)^3 * Complex.normSq (gamma j k))) := 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 suppose matrices on have a specified identity label and satisfy , , , and for and otherwise. For every with Euclidean norm , define
Then is Hermitian, , , and for every . Furthermore, if for every there exist and with and , then for every , and the real matrix is doubly stochastic: every entry is nonnegative, every row sums to , and every column sums to . Dimension is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.