Quantum Neural Networks (QNNs) are a popular approach in Quantum Machine Learning. We analyze the frequency spectrum using Minkowski sums, which yields a compact algebraic description and permits explicit computation. Using this description, we prove several maximality results for broad classes of QNN architectures. Under some mild technical conditions we establish a bijection between classes of models with the same area A: =R L that preserves the frequency spectrum, where R denotes the number of qubits and L the number of layers, which we consequently call spectral invariance under area-preserving transformations. With this we explain the symmetry in R and L in the results often observed in the literature and show that the maximal frequency spectrum depends only on the area A=RL and not on the individual values of R and L. Moreover, we collect and extend existing results and specify the maximum possible frequency spectrum of a QNN with an arbitrary number of layers as a function of the spectrum of its generators. In the case of arbitrary dimensional generators, where our two introduced notions of maximality differ, we extend existing Golomb ruler based results and introduce a second novel approach based on a variation of the turnpike problem, which we call the relaxed turnpike problem. We clarify comprehensively how the generators of a QNN must be chosen in order to obtain a maximal frequency spectrum for a given area A, thereby contributing to a deeper theoretical understanding. However, our numerical experiments show that trainability depends not only on A = RL, but also on the choice of (R, L), so that knowledge of the maximum frequency spectrum alone is not sufficient to ensure good trainability. While the maximality analysis limits the space of attainable frequency spectra and characterizing these spectra helps to understand the effect of the ansatz choice, it does not by itself provide sufficient criteria for ansatz selection, and further considerations are required.
Building similarity graph...
Analyzing shared references across papers
Loading...
Patrick Holzer
Ivica Turkalj
Quantum Machine Intelligence
Fraunhofer Institute for Industrial Mathematics
Building similarity graph...
Analyzing shared references across papers
Loading...
Holzer et al. (Mon,) studied this question.
www.synapsesocial.com/papers/69ba43cb4e9516ffd37a5572 — DOI: https://doi.org/10.1007/s42484-026-00372-x