A Unified Theory of Quantum Neural Network Loss Landscapes
Not on the map. Why?
Abstract (arXiv)
Classical neural networks with random initialization famously behave as Gaussian processes in the limit of many neurons, which allows one to completely characterize their training and generalization behavior. No such general understanding exists for quantum neural networks (QNNs), which -- outside of certain special cases -- are known to not behave as Gaussian processes when randomly initialized. We here prove that QNNs and their first two derivatives instead generally form what we call "Wishart processes," where certain algebraic properties of the network determine the hyperparameters of the process. This Wishart process description allows us to, for the first time: give necessary and sufficient conditions for a QNN architecture to have a Gaussian process limit; calculate the full gradient distribution, generalizing previously known barren plateau results; and calculate the local minima distribution of algebraically constrained QNNs. Our unified framework suggests a certain simple operational definition for the "trainability" of a given QNN model using a newly introduced, experimentally accessible quantity we call the "degrees of freedom" of the network architecture.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Aug 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 2; 2025: 5; 2026: 5.
12 papers.
- 2025A Primer on Quantum Machine Learningcited by 12
- 2025Layerwise Federated Learning for Heterogeneous Quantum Clients using Quoruscited by 5
- 2024Resource-efficient equivariant quantum convolutional neural networkscited by 4
- 2025Enhancing variational quantum algorithms by balancing training on classical and quantum hardwarecited by 3
- 2024A Universal Quantum Computer From Relativistic Motioncited by 0
- 2025Connecting phases of matter to the flatness of the loss landscape in analog variational quantum algorithmscited by 0
- 2025Fragmentation is Efficiently Learnable by Quantum Neural Networkscited by 0
- 2026Cautious optimism for deep parameterized quantum circuitscited by 0
- 2026Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Modelscited by 0
- 2026Modeling quantum neural network gradient with reinforcement learningcited by 0
- 2026SQUARE: Structured Quantum Representation Adapters as Compact Quadratic Feature Maps for Frozen Language Modelscited by 0
- 2026Gaussian Universality and Its Breakdown in Tensor-Network Machine Learningcited by 0
- 2026Gaussian Universality and Its Breakdown in Tensor-Network Machine Learning5 Oct 2026
- 2026SQUARE: Structured Quantum Representation Adapters as Compact Quadratic Feature Maps for Frozen Language Models29 Sep 2026
- 2026Modeling quantum neural network gradient with reinforcement learning25 Sep 2026
- 2026Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Models4 Aug 2026
- 2026Cautious optimism for deep parameterized quantum circuits23 Jul 2026
- 2025Fragmentation is Efficiently Learnable by Quantum Neural Networks30 Nov 2025
- 2025A Primer on Quantum Machine Learning20 Nov 2025
- 2025Layerwise Federated Learning for Heterogeneous Quantum Clients using Quorus30 Sep 2025
- 2025Connecting phases of matter to the flatness of the loss landscape in analog variational quantum algorithms16 Jun 2025
- 2025Enhancing variational quantum algorithms by balancing training on classical and quantum hardware20 Mar 2025
- 2024A Universal Quantum Computer From Relativistic Motion31 Oct 2024
- 2024Resource-efficient equivariant quantum convolutional neural networks2 Oct 2024