Search arXiv⌕ Search

arXiv · 2610.14070

Can the Quantum Fisher Effective Dimension Judge a Hybrid Quantum Neural Network?

Abstract

Hybrid quantum neural networks (QNNs) pair a classical feature extractor with a variational quantum circuit, and the effective dimension of the circuit's quantum Fisher information matrix (QFIM) is widely used to assess such models. This scalar is often interpreted as an indicator of trainability or accuracy, although these readings are rarely tested under controlled conditions. We therefore investigate what it actually measures. We define the effective dimension as the participation ratio of the QFIM diagonal, which lies between one and the parameter count, and we evaluate it across two image datasets, four frozen backbones including a random-projection control, four circuit depths on eight qubits, and three seeds. During training, the effective dimension remains well below the parameter count, and its correlation with test accuracy ranges from -0.72 to +0.87, changing sign across seeds in half of the configurations. Increasing depth activates a larger share of the circuit directions, from 0.38 to 0.91 of the parameter count, while the initialization gradient variance remains between 1e-5 and 1e-4, so no barren plateau (BP) appears at eight qubits. At a fixed circuit, the four backbones share an initial effective dimension of 6 to 9, even though CIFAR-10 accuracy ranges from 23.14% to 86.44%. These results show that the effective dimension characterizes circuit geometry rather than model quality. We conclude with a practical protocol that assigns each diagnostic to the question it can answer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Md Masum Mia, Amith Khandakar, Mohamed Arselene Ayari. 2026-10-07. Can the Quantum Fisher Effective Dimension Judge a Hybrid Quantum Neural Network?. https://arxiv.org/abs/2610.14070

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Computational reach of machine learning models is independent of untrained quantum resources

This paper proves that if an untrained quantum circuit is used as a resource in a machine learning model, then on average no resource quantum circuit is better than any other that can achieve the same set of computational effects. The paper also proves a supporting theorem that even if certain mild idealisations are omitted, the average quantum advantage remains negligible at best. These results cast serious doubt on several proposals to use untrained quantum circuits in machine learning models: at best such claims should be substantiated empirically, as this paper proves there is no a priori theoretical reason to suppose that introducing an untrained quantum circuit will increase performance.

quant-ph↗

Operator quantum singular value transformation: Spectral mapping, design and topological invariants

Quantum singular value transformation (QSVT) provides a unifying framework for quantum algorithms by applying the polynomials of quantum signal processing (QSP) to block-encoded matrices. We connect this framework with spectral analysis, design and topological protection in condensed matter physics. Extending QSVT beyond matrices to possibly infinite-dimensional operators (operator QSVT), we establish the following. First, it transforms every block of the operator by the QSP polynomials; no singular value decomposition is needed. Second, a spectral mapping theorem determines the full spectrum of the QSVT operator, including continuous spectra, from the embedded operator through the QSP polynomial, allowing spectral analysis without translation invariance. Third, the spectral mapping turns QSP into spectral design: the QSP phases can stretch, fold and separate the bands and place the eigenvalues. Finally, the kernel sectors that conventional QSVT usually sets aside carry a topological index, invariant under the choice of QSP phases, local perturbations and gap-preserving deformations, which guarantees topologically protected states. These results unify two quantum walks: Szegedy's walk from quantum algorithms and the split-step walk from condensed matter physics. Their kernel sectors encode the graph's Euler characteristic and the difference of bulk winding numbers, respectively. For the split-step walk, QSP breaks chiral symmetry but not the topological protection, and can move the protected state into a continuous band to form a bound state in the continuum (BIC).

quant-ph↗

Quantum theory of molecular orientation

We formulate a quantum phase space for rotational and nuclear-spin states of rigid molecules. For each nuclear spin isomer, we re-derive the isomer's admissible angular momentum states from molecular geometry and nuclear-spin data, introduce its angular position states using quantization theory, and develop a generalized Fourier transform converting between the two. We classify molecules into three types -- asymmetric, rotationally symmetric, and perrotationally symmetric -- with the last type having no macroscopic analogue due to nuclear-spin statistics constraints. We discuss two general features in perrotationally symmetric state spaces that are Hamiltonian-independent and induced solely by symmetry and spin statistics. First, we quantify when and how an isomer's state space is completely rotation-spin entangled, meaning that it does not admit any separable states. Second, we identify isomers whose position states house an internal pseudo-spin or "fiber" degree of freedom, and the fiber's Berry phase or matrix after adiabatic changes in position yields naturally robust operations, akin to braiding anyonic quasiparticles or realizing fault-tolerant quantum gates. We outline how the fiber can be used as a quantum error-correcting code and discuss scenarios where these features can be experimentally probed

quant-ph↗