Aug 2026· International journal of computer information systems and industrial management applications· Vol 18, pp. 1-18· 0 citations
TL;DR
This research provides a scalable method for integrating near-term noisy intermediate-scale Quantum (NISQ) devices into state-of-the-art deep learning pipelines, fostering the further real-world adoption of hybrid quantum-classical systems for demanding artificial intelligence tasks.
Abstract
Although recent advances in transfer learning have simplified training, fine-tuning big language models remains an energy-intensive and expensive process, with high hardware and energy costs that make it difficult to use and scale. While quantum machine learning (QML) presents a promising theoretical tool to overcome these bottlenecks, the practical implementation is hampered by the barren plateau problem, a phenomenon well established in literature that manifests through exponentially vanishing gradients of deep parameterized quantum circuits (PQCs) with increasing circuit depth, preventing informative parameter updates by rendering the optimization landscape flat. This study presents a hybrid quantum-classical architecture in which a PQC layer is integrated into a pretrained classical LLM backbone and fine-tuned throughout this work. This iterative refinement loop is controlled by an Expected Improvement acquisition function, which actively guides the search process through parameter regimes with obvious non-vanishing gradient variance. The study proposes that this theory-driven initialization scheme reduces the onset of barren plateaus, thereby enabling efficient and stable convergence in hybrid optimization. Experiments show that the proposed method consistently outperforms purely classical fine-tuning baselines and randomly initialized quantum baselines on representative downstream natural language processing tasks. The experimental results show that principled parameter initialization leads to concrete improvements in convergence stability, gradient trainability, and task-level performance. In summary, this research provides a scalable method for integrating near-term noisy intermediate-scale Quantum (NISQ) devices into state-of-the-art deep learning pipelines, fostering the further real-world adoption of hybrid quantum-classical systems for demanding artificial intelligence tasks.
A key challenge in practical quantum machine learning (QML), particularly for discriminative tasks such as classification, is the limited capacity of near-term quantum devices to encode high-dimensional classical data into small quantum registers. In optimized basis-encoded (bit-bit) settings, this constraint leads to cross-class collisions, where samples with different labels are mapped to the same discrete bit-string and thus become indistinguishable to any downstream model. In this work, we investigate how data representation affects QML performance under such severe information bottlenecks. We introduce discretization-aware fine-tuning (DAFT), a method that adapts a pre-trained chemical foundation model to produce representations that remain informative after quantization. DAFT reduces collision probability through a differentiable soft collision loss. We evaluate both quantum and classical models under a controlled setting in which they receive identical discretized bit-string inputs, isolating the effect of representation from model architecture. On the blood-brain barrier penetration (BBBP) molecular property prediction benchmark using ChemBERTa-77M, DAFT reduces collision counts by several orders of magnitude and improves quantum classification accuracy by more than 12 percentage points compared to a frozen backbone. Importantly, without DAFT, classical models outperform QML under the same input constraints. With DAFT, however, this comparison reverses at higher qubit counts. At 10 qubits, the quantum model surpasses a matched classical baseline trained on identical bit-strings (0.883 vs. 0.855, $p = 0.026$). These results show that, in information-constrained regimes, achieving a quantum advantage critically depends on aligning continuous representations with discrete quantum encodings.
This paper proposes a hybrid quantum-classical framework utilizing isometric Tree Tensor Networks (TTNs) and a novel Quantum Self-Attention (QSA) subroutine, capable of compressing the latent space of a classical 10-parameter Large Language Model into a 10-parameter quantum neural network via amplitude encoding.
R. Delhibabu· Frontiers of Computer Scienc...· 0 citations
Building a quantum machine learning (QML) model competitive with a classical baseline currently requires a practitioner to separately choose a circuit architecture, a data-encoding scheme, a model paradigm (kernel versus variational), and a set of training hyperparameters, then verify after the fact that the chosen circuit is even trainable. Existing QML libraries provide the primitives for this but not the search, and existing classical AutoML libraries provide the search but not the quantum-specific search space or diagnostics. We present qkabrine-automl, a Python package that treats architecture, encoding, model type, and hyperparameters as a single, jointly searchable configuration space, evaluated through one consistent harness regardless of which of five search strategies proposed the candidate. The package integrates trainability diagnostics, a Data Quantum Fisher Information Metric (DQFIM) estimate and a gradientmagnitude barren-plateau monitor, directly into the evaluation loop as an optional prescreening step, alongside expressibility and entangling-capability characterization, a post-search circuitsurgery pass for NISQ deployment, and OpenQASM export. We position this contribution against recent AutoQML frameworks that already automate parts of the QML pipeline, and report a small, fully reproducible illustrative run rather than a benchmark claim.
Reinforcement learning (RL) can automate quantum architecture search, but its scalability is limited when useful circuit trajectories become rare in the rapidly expanding search space. Existing replay mechanisms reuse observed transitions; the proposed learned model produces additional predicted one step transitions from real state-action seeds. Here we introduce GenQAS, a tensor network-guided RL framework that combines a fixed matrix product state warm-start with prioritized generative replay. A learned local transition model generates synthetic circuit transitions on demand and mixes them with real experience during Double Deep Q-Network updates. Under a random exploration analysis, near ground state circuits occupy a rapidly shrinking region of the accessible state space. We investigate whether real data anchored synthetic replay can improve the effective training signal in this regime. Across chemical Hamiltonian benchmarks from 6 to 12 qubits, GenQAS improves fixed-budget success probability and identifies compact circuits at competitive energy error. At 12 qubits, it improves final success probability by up to $7.0\times$ over passive replay. On a 15-qubit transverse field Ising model, GenQAS increases success probability from $12\%$ to $21\%$. In a noisy 6-qubit BeH$_2$ transfer experiment, generative replay reduces the steps to chemical accuracy by $92.7\%$. These results show that generative replay can mitigate sample starvation in quantum architecture search and support more resource efficient circuit discovery.
Akash Kundu, Amit Kumar Jaiswal, Sebastian Feld et al.· 0 citations
Time-series foundation models produce rich embeddings, but whether quantum models can exploit them, and how far hybrid classical-quantum architectures scale, remains unclear. We address this by fine-tuning Chronos for power-grid event classification (PSML-5) with a quantum head on the model's embeddings. Grouping embeddings by physical sensor type before summarization already surpasses the best published baseline built for this benchmark, and with finer-grained features the quantum head outperforms a larger classical multilayer perceptron on identical inputs by 1.7-2.0 percentage points of balanced accuracy. Yet the gains saturate: past a point, feeding more information to the same fixed-width register yields no improvement. We show the bottleneck is neither the supply of information nor circuit expressiveness, but the bandwidth of the data intake. To overcome this limitation, we introduce the wing module, a self-contained few-qubit circuit that feeds additional information into the core circuit through a sparse, one-way coupling. Under a preregistered four-seed protocol, we attach wings to a fixed 12-qubit core with fixed features. Balanced accuracy increases with each added wing, from 83.6% with no wings (13 qubits, including a post-selection qubit) to 85.2% with two (19 qubits). Ablations establish that a circuit enlarged without new information gains nothing, while a wing fed information from the wrong sample harms accuracy. These results reframe scaling for quantum fine-tuning: added qubits help when they carry added inputs, not merely more parameters. Wings offer a modular and stable route to widening that bandwidth.
Sang Hyub Kim, Julien Baglio, R. Krishnakumar et al.· 0 citations
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 frontier where a quantum advantage is provable but not yet bridged to chemistry.
Nicolás Bonilla Vargas· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
