Unnumbered absence of narrow gorges under inverse-polynomial loss variance
ProvedQAlgorithms.Papers.Independent.Support50.P30.noNarrowGorgesConsider a family of noiseless layered equivariant circuits, density-matrix inputs , and Hermitian equivariant observables with a uniform spectral bound , where is fixed before . Let , with parameters uniform on . Assume an eventual inverse-polynomial lower bound: for some , integer , and ,
Then this loss family has no narrow gorge. A narrow gorge means the conjunction of below-mean points at inverse-polynomial separation and a tail envelope for fixed , , all sufficiently large , and every . The conclusion retains the explicit loss-variance premise of Eq. (96); it does not assert the incorrect probability-tends-to-one estimate of Eq. (100).
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P30
noncomputable section
open MeasureTheory
open scoped BigOperators ComplexConjugate Matrix.Norms.L2Operator NNReal ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P30
attribute [local instance] LieRing.ofAssociativeRing
/-- PDF pp.7,33-34: qualitative no-gorge result with the loss-variance
premise (96). The incorrect anti-concentration estimate (100) is deferred. -/
theorem noNarrowGorges (K : ℝ) (hK : 0 < K) (L : ℕ → ℕ)
(H : (n : ℕ) → Fin (L n) → QnnOperator n) (hH : ∀ n j, (H n j).IsHermitian)
(hHeq : ∀ n j, PermutationEquivariant (H n j))
(rho : (n : ℕ) → QnnDensity n) (O : (n : ℕ) → QnnOperator n)
(hO : ∀ n, (O n).IsHermitian) (hOeq : ∀ n, PermutationEquivariant (O n))
(hbound : ∀ n, specNorm (O n) ≤ K)
(hvariance : InversePolynomialLower
(fun n => variance (uniformParameters (L n)) (fun t => qnnLoss (circuit (H n) t) (rho n).val (O n)))) :
¬ HasNarrowGorge L (fun n t => qnnLoss (circuit (H n) t) (rho n).val (O n)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P30
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a real number, let be arbitrary, and, for every natural number and every , let be a Hermitian complex matrix indexed by length- Boolean strings that commutes with every permutation of the qubits. Let be any positive semidefinite trace-one matrix on that space, and let be Hermitian, commute with every qubit permutation, and satisfy for every . Here the permutation corresponding to sends a basis string to . Define
using the identity for an empty product, and let be the product of normalized Lebesgue measures on . Suppose there exist a real and natural numbers such that, for every ,
Then the following two properties cannot both hold: there exist a function , a real , and natural numbers such that for all and, for every , some satisfies ; and there exist real , , and a natural number such that, for all and all real ,
The parameter vector witnessing the first property may lie anywhere in . All matrix hypotheses range over every , including ; is unrestricted and may be zero, and the inverse-polynomial inequalities use and division by zero equal to zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.