Theorem 3 (Efficient overparametrization)
OpenQAlgorithms.Papers.Independent.Support50.P30.efficientOverparametrizationThere are constants and such that, for every and every normalized pure -qubit input , one can choose a generator word from Eq. (9), a parameter count , and a parameter vector such that
for every parameter vector of every finite generator word from the same gate-generator set. Here the QFIM of a circuit output is . Thus an appropriate architecture with parameters attains the maximum accessible QFIM rank. This is an existential saturation statement, not an optimizer-convergence assertion.
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
/-- PDF p.7, Theorem 3, using the saturation definition on pp.9,14-15.
The initial unit state precedes the existential schedule and parameters. -/
theorem efficientOverparametrization :
∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, ∀ n ≥ N, 2 ≤ n →
∀ psi : EuclideanSpace ℂ (Qubits n), IsState psi →
∃ L : ℕ, (L : ℝ) ≤ C * (n : ℝ) ^ 3 ∧
∃ word : Fin L → Fin 3, ∃ theta : Fin L → ℝ,
∀ (Lother : ℕ) (other : Fin Lother → Fin 3) (t : Fin Lother → ℝ),
(qfi (fun j => qnnGenerator n (other j)) t psi).rank ≤
(qfi (fun j => qnnGenerator n (word j)) theta psi).rank := by sorry
end QAlgorithms.Papers.Independent.Support50.P30
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
There exist a real constant and a natural number such that, for every natural number satisfying , and every vector with , there exist a natural number , a word , and parameters , with , having the following property. Write
where , , , and a superscript indicates application at that qubit position, with identities elsewhere. For any word of length and parameters , let
and define the real matrix
Then every natural number , every word , and every satisfy
The selected length, word, and parameters may depend on and . Both selected and comparison lengths may be zero, in which case the corresponding matrix is empty and has rank zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.