Bridging Classical and Quantum Computing for Next-Generation Language Models

• URL: http://arxiv.org/abs/2508.07026v1
• Date: Sat, 09 Aug 2025 15:49:26 GMT
• Title: Bridging Classical and Quantum Computing for Next-Generation Language Models
• Authors: Yi Pan, Hanqi Jiang, Junhao Chen, Yiwei Li, Huaqin Zhao, Lin Zhao, Yohannes Abate, Yingfeng Wang, Tianming Liu,
• Abstract summary: We introduce Adaptive Quantum-Classical Fusion (AQCF), the first framework to bridge the gap between classical and quantum processing.<n>AQCF's core principle is real-time adaptation: it analyzes input complexity to orchestrate seamless transitions between classical and quantum processing.<n> Experiments on sentiment analysis demonstrate that AQCF achieves competitive performance, significantly improves quantum resource efficiency, and operates successfully within typical NISQ constraints.
• Score: 17.823221766129723
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Integrating Large Language Models (LLMs) with quantum computing is a critical challenge, hindered by the severe constraints of Noisy Intermediate-Scale Quantum (NISQ) devices, including barren plateaus and limited coherence. Current approaches often fail due to static quantum-classical partitioning. We introduce Adaptive Quantum-Classical Fusion (AQCF), the first framework to bridge this gap through dynamic, quantum-classical co-design. AQCF's core principle is real-time adaptation: it analyzes input complexity to orchestrate seamless transitions between classical and quantum processing. The framework features three key innovations: (1) entropy-driven adaptive circuits that circumvent barren plateaus; (2) quantum memory banks that unify classical attention with quantum state-based similarity retrieval; and (3) intelligent fusion controllers that allocate tasks for optimal performance. This architecture maintains full compatibility with classical Transformers while progressively incorporating quantum advantages. Experiments on sentiment analysis demonstrate that AQCF achieves competitive performance, significantly improves quantum resource efficiency, and operates successfully within typical NISQ constraints. By providing a seamless integration pathway, AQCF offers both immediate practical value on current quantum hardware and a clear evolution path toward mature Quantum LLMs.

Related papers

• Quantum-accelerated conjugate gradient methods via spectral initialization [0.0]
  A fault-tolerant quantum algorithm is used exclusively to construct a spectrally informed initial guess for a classical conjugate gradient (CG) solver.<n>A central feature of QACG is a controllable decomposition of the condition number between the quantum and the classical solver.<n>Results illustrate a concrete pathway toward the scientific and industrial use of early-stage fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2026-02-10T11:51:42Z)
• Methods for non-variational heuristic quantum optimisation [0.5586191108738564]
  We introduce a novel class of quantum optimisations that forgo this variational framework in favour of a hybrid quantum-classical approach.<n>These algorithms are expected to exhibit inherent robustness to noise and support parallel execution across both quantum and classical resources.
  arXiv  Detail & Related papers  (2026-02-01T17:46:57Z)
• Classical Regularization in Variational Quantum Eigensolvers [0.0]
  Variational Quantum Eigensolver (VQE) objective with a quadratic penalty to the squared norm of the parameters.<n>Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength.
  arXiv  Detail & Related papers  (2026-01-23T11:49:33Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Quantum Hyperdimensional Computing: a foundational paradigm for quantum neuromorphic architectures [0.5785414922972825]
  We introduce Quantum Hyperdimensional Computing (QHDC), a fundamentally new paradigm.<n>We demonstrate that the core operations of its classical counterpart, Hyperdimensional Computing (HDC), map with remarkable elegance and direct correspondence onto the native operations of a QC.<n>We present the first-ever implementation of this framework, validated through symbolic analogical reasoning and supervised classification tasks.
  arXiv  Detail & Related papers  (2025-11-16T16:01:56Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Quantum Adaptive Self-Attention for Quantum Transformer Models [0.0]
  We propose Quantum Adaptive Self-Attention (QASA), a novel hybrid architecture that enhances classical Transformer models with a quantum attention mechanism.<n>QASA replaces dot-product attention with a parameterized quantum circuit (PQC) that adaptively captures inter-token relationships in the quantum Hilbert space.<n> Experiments on synthetic time-series tasks demonstrate that QASA achieves faster convergence and superior generalization compared to both standard Transformers and reduced classical variants.
  arXiv  Detail & Related papers  (2025-04-05T02:52:37Z)
• Enhancing variational quantum algorithms by balancing training on classical and quantum hardware [1.8377902806196762]
  Variational Quantum Eigensolver (VQE) and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks.<n>We numerically evaluate our approach for ground-state estimation of 6 to 18-qubit Hamiltonians using VQE and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks.
  arXiv  Detail & Related papers  (2025-03-20T17:17:58Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.