Trainability ยท Primitives
QNN overparametrization
Theorem statement
A variational quantum neural network with $M$ trainable parameters $\theta$ has, over its optimization landscape, achievable QFIM rank $R(M) = \sup_\theta \operatorname{rank} F(\theta)$, with saturated value $R = \sup_M R(M)$. The network is overparametrized at parameter count $M$ when the achievable rank saturates, $R(M) = R$; the critical parameter count $M_c = \inf\{\,M : R(M) = R\,\}$ is the least such $M$, beyond which adding parameters explores no new state-space directions of the optimization landscape.
Sources
- Theory of overparametrization in quantum neural networks
Martin Larocca, Nathan Ju, Diego Garcia-Martin, Patrick J. Coles, M. Cerezo, 2021
Lean context
- Lean declaration
QuantumAlg.QFIMOverparam.main
Copy a short prompt with the import, theorem name, citations, and public source link.