Skip to content
Open access

Data quantum Fisher information predicts trainability in variational quantum algorithms

Jul 2026 · Academia Quantum · 0 citations · 16 references

TL;DR

In these small, idealised, classically simulated matched-family tasks, the support-basis DQFIM provides a useful data-dependent pre-training diagnostic of effective capacity on the retained data support and contributes predictive information beyond raw parameter count and structural metadata.

Abstract

Introduction: Variational quantum algorithms can show unstable trainability and uneven generalisation that are not fully explained by circuit depth or raw parameter count alone. We study the data quantum Fisher information matrix (DQFIM) as a data-dependent effective-capacity diagnostic for controlled supervised unitary-learning tasks. Materials and methods: We used exact-state, classically simulated, 4-qubit, supervised unitary-learning benchmarks with two ansatz families: a hardware-efficient ansatz (HEA) for the baseline trainability study and a symmetry-preserving ansatz for symmetry-controlled comparisons. The analysis covered four linked experiments: E0 trainability phase boundaries, E1 symmetry-controlled data-regime comparisons, E2 trainability versus generalisation, and E3 pre-training prediction of optimisation success. For the main analyses we used the support-basis DQFIM, 30 random seeds per main configuration, grouped cross-validation in the predictive benchmark, and additional diagnostics for threshold sensitivity, phase indeterminacy, Hamming-sector generalisation, and test set size sensitivity. Results: In E0, the empirical trainability boundary increased from M c = 32 at L = 1 to M c = 192 at L = 8 , and the support-basis DQFIM-predicted boundary matched the empirical boundary on the resolved scanned grid under the main analysis setting. In E1, the sector-preserving and sector-broken conditions showed no resolved empirical boundary shift on the scanned grid, with only mild low-L asymmetry in the DQFIM-predicted boundary. In E2, trainability and generalisation separated clearly: some regimes generalised well, while others reached near-zero training loss but retained high test loss. The phase diagnostic supported relative phase indeterminacy as a mechanism for failure on in-sector superpositions after basis-state training. In E3, parameter count alone was a weak predictor of optimisation success, with receiver operating characteristic area under the curve (ROC AUC) = 0.648 ; the structural baseline was stronger, with ROC AUC = 0.958 ; and the DQFIM-enhanced model performed best, with ROC AUC = 0.989 . Conclusions: In these small, idealised, classically simulated matched-family tasks, the support-basis DQFIM provides a useful data-dependent pre-training diagnostic of effective capacity on the retained data support. It tracks resolved trainability boundaries and contributes predictive information beyond raw parameter count and structural metadata. The conclusions remain scoped to controlled small-system simulations; larger-qubit, noisy, hardware-executed, and less-matched settings require further validation before claiming practical scalability.

Read PDF

Similar papers

#quantum computing Preprint Jul 2026

HamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search

Quantum Architecture Search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms, yet existing benchmarks organize instances by molecular identity or qubit count -- criteria agnostic to Hamiltonian structure -- and rely solely on energy accuracy, which cannot detect structural...

Jiayang Niu, Akib Karim, Yan Wang et al. · 1 citation
Review Aug 2026

Machine learning for sample-based quantum diagonalization: a review of generative configuration recovery and the classical-simulability frontier

This work confronts the field's central question -- whether the quantum sampler beats classical selected configuration interaction -- and reports a carefully scoped negative, and flags learning from quantum experiments, whose classical sample-complexity lower bound is an unconditional theorem, as the one adjacent front...

Nicolás Bonilla Vargas · 2 citations
Open access Jul 2026

Machine Learning of Quantum Entanglement from Noisy Measurements

The findings indicate that ML may provide an efficient alternative to conventional quantum-state analysis under simulated Poissonian noise conditions, and demonstrate that ML methods can achieve very high classification accuracy, even under extremely limited training conditions.

Artur Czerwinski, Maciej Wiśniewski, P. Moszczyński · 0 citations
Preprint Aug 2026

Generative Learning for Quantum Measurement Design

FlowMeas is introduced, which uses a generative flow network to directly sample finite ensembles of shallow Clifford measurement circuits subject to a prescribed shot budget and hardware constraints, and establishes generative learning as a flexible and unified framework for quantum measurement design under practical r...

Jun Dai, O. Nahman-Lévesque, Guillaume Rabusseau et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.