Skip to content
Preprint

Ravines in quantum cost landscapes: opportunities for improved VQA predictions

Jul 2026 · 0 citations · 33 references
Physics Computer Science

TL;DR

A complexity analysis shows that leveraging the ravine-like structure of QCLs with the QNN NEB approach substantially reduces computational costs compared to naive QNN ensembling, and that the NEB approach also accelerates convergence over the naive alternative.

Abstract

The geometric and topological structure of quantum cost landscapes (QCLs) governs the optimization and thus the predictive power of variational quantum algorithms (VQAs). We systematically analyze ravines - low-cost paths connecting local minima - using an adapted version of the nudged elastic band (NEB) algorithm, a method originating from theoretical chemistry. By training quantum neural networks (QNNs) to classify the concentratable entanglement of quantum states, we apply the NEB algorithm and numerically identify ravine structures in QCLs of hardware-efficient ansatzes. Beyond visualizing these ravines, we construct an ensemble prediction framework by averaging predictions from QNNs parameterized along the low-cost NEB path. We introduce a resource-light pre-training metric which quantifies local-prediction variability and serves as a strong performance indicator for VQAs, even beyond the scope of this study. When base classifiers are drawn from circuit and weight initializations exhibiting high local-prediction variability, the quantum-based NEB ensembles outperform both classical and naive quantum alternatives. Moreover, a complexity analysis shows that leveraging the ravine-like structure of QCLs with the QNN NEB approach substantially reduces computational costs compared to naive QNN ensembling. A depth and qubit scaling analysis indicates that ravines persist across both scalings, and that, despite the expected growth in resource requirements with the qubit scaling, the NEB approach also accelerates convergence over the naive alternative.

View source

Similar papers

Conference Jul 2026

HyQNet: A Hybrid Quantum–Classical Framework for Quantum Machine Learning Optimization

Quantum machine learning (QML) faces practical limitations due to noisy intermediate-scale quantum (NISQ) constraints, including noise, restricted qubit availability, and unstable optimization. This paper proposes HyQNet, a resource-aware hybrid quantum–classical framework designed to address these challenges through efficient circuit execution and adaptive optimization. The framework integrates optimized quantum circuits with classical learning strategies to improve scalability and stability under NISQ conditions. Experimental results on Iris, Wine, and Breast Cancer datasets show that HyQNet achieves an accuracy of 95.1% and F1-score of 94.8%, outperforming variational QNN (92.6%) and quantum SVM (91.2%). It also reduces runtime to 16.9 s compared to 20.5 s for VQNN, while maintaining efficient utilization of 8 qubits. Statistical analysis confirms significance (p < 0.05), and ablation studies validate the contribution of each component. The results demonstrate improved convergence stability and resource efficiency in hybrid quantum learning systems.

Sudheer Reddy K., Hastimal Jangid, Usha Desai · 0 citations
Preprint Aug 2026

Symmetry Constraints Regularize Neural Quantum State Learning

The results indicate that symmetry compilation concentrates the expressive power of NQS on states relevant to the target problem, thereby reducing model size and training cost without sacrificing accuracy.

Turbasu Chatterjee, M. Sajjan, Songbo Xie et al. · 0 citations
Open access Jul 2026

Accelerated quantum-centric supercomputing through perturbation-theoretic measures and generative machine learning

Quantum centric supercomputing (QCSC) framework, such as sample-based quantum diagonalization (SQD) holds immense promise toward achieving practical quantum utility to solve classically hard sampling problems in quantum chemistry. QCSC leverages quantum computers to perform the classically intractable task of sampling the dominant fermionic configurations from the Hilbert space that have substantial support to a target state, followed by Hamiltonian diagonalization on a classical processor. However, noisy quantum hardware produces erroneous samples upon measurements, making robust and efficient configuration-recovery strategies essential for scalable QCSC pipelines. Toward this, in this work, we introduce PIGen-SQD, an efficiently designed QCSC workflow that utilizes the capability of generative machine learning (ML) along with physics-informed configuration screening via implicit low-rank tensor decompositions for accurate fermionic state reconstruction. The physics-informed pruning is based on a class of efficient perturbative measures that, in conjunction with samples drawn from quantum hardware, provide a substantial overlap with the target state. This distribution induces an anchoring effect on the generative ML models to stochastically explore only the dominant sector of the Hilbert space for effective identification of additional important configurations in a self-consistent manner. Our numerical experiments performed on IBM Heron R2 and R3 quantum processors with up to 58 qubit experiments demonstrate this synergistic workflow produces compact, high-fidelity subspaces that substantially reduce diagonalization cost while maintaining chemical accuracy under strong electronic correlations. With such a concerted integration of classical many-body intuitions, generative ML and quantum computers as a sampling engine, PIGen-SQD offers a promising pathway toward accurate and systematically improvable quantum simulations on utility-scale quantum hardware.

Chayan Patra, D. Mondal, Sonaldeep Halder et al. · 0 citations
Preprint Jul 2026

SQD-Enabled Circuit Compression for Resource-Efficient Quantum Chemistry

This work reveals and exploits this underexplored robustness property: how much non-Clifford and variational expressivity can be removed from the sampling circuit before SQD accuracy degrades, and answers through two complementary compression techniques: gradient-based operator pruning, which discards low-impact excitation operators, and Clifford rounding, which snaps remaining parameters to the nearest Clifford angle.

Kangyu Zheng, Yidong Zhou, Jinglei Cheng et al. · 0 citations
Preprint Jul 2026

How Hard Is Quantum Advantage? A Cloud Microphysics Stress Test for Variational Quantum Models

Quantum machine learning (QML) could have the potential to leverage advantages of quantum over classical computing but still lacks strong evidence of actual improvements and scalability, partly due to phenomena such as barren plateaus. In this paper, we employ a hybrid quantum neural network (QNN) on a dataset on cloud microphysics, containing processes for phase transitions of water in the atmosphere and its related temperature changes, which are highly relevant for accurate climate predictions and projections. To reach optimal performance of our QNNs, we employ a rich and trainable frequency spectrum together with expressivity enhancing classical postprocessing. We find that our QNNs strongly benefit from extensive hyperparameter optimization and thereby demonstrate the feasibility of applying QNNs to complex physical systems. At the same time, the QNNs are outperformed by classical baselines in the form of simple fully-connected neural networks. We discuss identified bottlenecks of this class of quantum models to learn the full complexity of the cloud microphysics dataset to show that there is a need to further understand and improve variational quantum models for machine learning such that they might fill the gap where classical models fail or are inefficient.

Felix Herbort, Ellen Sarauer, Daniel Ohl de Mello et al. · 0 citations