Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.11942

Geometric Preconditioning and Curriculum Optimization for Trainable Variational Quantum Regression

Qingyu Meng, Yangshuai Wang

cs.LGquant-phSubmitted Jan 17, 2026• Announced Jan 20, 2026• 2 citations• Revised May 13, 2026 (v3)
v1 · Jan 17, 2026v2 · Jan 29, 2026v3 · May 13, 2026v4 · Sep 11, 2026
arXivHTMLPDF

Abstract

Variational quantum circuits are increasingly studied as continuous-function approximators, but quantum regression remains difficult to train when global losses, finite-shot stochasticity, and circuit-depth growth combine to produce weak or ill-conditioned gradient signals. We study this trainability problem in a controlled hybrid quantum--classical regression design. The central ingredient is a capacity-controlled classical embedding that acts as a learnable geometric preconditioner: it reshapes the input distribution seen by a data-reuploading variational circuit while preserving a low-dimensional quantum bottleneck. We pair this representation design with a curriculum protocol that grows circuit depth progressively and switches from SPSA-based stochastic exploration to Adam-based analytic-gradient fine-tuning. We formalize the mechanism through a local quantum-tangent contraction statement: in the linearized quantum-parameter dynamics, the embedding changes the empirical Gram matrix that controls residual contraction and one-step loss decrease. Across finite-size statevector audits on PDE-informed regression benchmarks and small-data tabular tasks, the Hybrid QNN lowers error relative to Pure QNN baselines under matched quantum-model budgets. Strong classical references remain competitive, and in several cases are better in absolute error; the evidence therefore supports a trainability claim for the hybrid QNN design rather than a claim of classical or hardware quantum advantage.

Related papers

Variational Quantum Models

Hamid D. Ismail

This chapter develops variational quantum models as the dominant framework for near-term quantum machine learning (QML), emphasizing their role as trainable quantum circuits embedded within hybrid quantum-classical optimization loops. Building on earlier chapters on encoding and quantum feature geometry, it formulates parameterized quantum circuits (PQCs) as families of unitary transformations acting on reference states, with model outputs obtained through expectation values of observables. This measurement-based structure makes variational learning inherently stochastic and closely ties model behavior to circuit architecture, observable choice, and optimization strategy. This chapter examines variational quantum circuits (VQCs) as learning models, introduces quantum neural networks (QNNs) as structured variational architectures, and analyzes layered, data-reuploading, recurrent, and hybrid classical-quantum designs. It highlights the central tension between expressivity and trainability, showing how universality and approximation power are counterbalanced by optimization barriers such as barren plateaus. The discussion further develops ansatz design strategies, supervised, fidelity-based, and energy-based losses, regularization under noise, and practical methods for gradient estimation and optimization, including the parameter-shift rule, Simultaneous Perturbation Stochastic Approximation (SPSA), and layer-wise training. Together, these ideas establish variational quantum models as a flexible yet hardware-constrained paradigm whose practical success depends on careful coordination among architecture, measurement, and optimization.

CRC Press eBooks•Nov 4, 2026•0 citations

Quantum LEGO Learning: A Modular Design Principle for Hybrid Artificial Intelligence

Jun Qi, Chao-Han Huck Yang, Pin‐Yu Chen +3 more

Abstract Hybrid quantum–classical learning has emerged as a promising paradigm for leveraging near-term quantum devices in practical machine learning tasks. However, many existing hybrid architectures rely on tightly coupled end-to-end training schemes that are difficult to optimize, sensitive to quantum noise, and strongly dependent on specific encoder designs. In this work, we introduce Quantum LEGO Learning, a modular framework for hybrid artificial intelligence that decomposes learning into reusable classical and quantum blocks with explicitly separated roles. Within this framework, a pre-trained classical neural network acts as a frozen feature extractor, while a variational quantum circuit (VQC) serves as the only trainable, adaptive module that operates on structured latent representations. This design enables stable optimization, reduces parameter coupling between classical and quantum components, and supports architecture-agnostic integration across different classical backbones. We develop a block-wise theoretical analysis that decomposes the learning behavior of the hybrid model into components of approximation, estimation, optimization, and noise-induced error. The analysis shows that once expressive classical representations are fixed, the overall model's approximation capability depends primarily on the classical feature block, while the trainable quantum module governs the complexity of downstream adaptation. We further derive optimization and noise-resilience bounds demonstrating how freezing the classical block suppresses the propagation of noisy gradients during training. To validate the proposed framework, we conduct systematic experiments on quantum dot classification and genome transcription factor binding site prediction using multiple frozen feature extractors, including ResNet and tensor-train network backbones, combined with both quantum and classical adaptive heads. Experimental results from noiseless simulations, realistic quantum-noise models, and IBM Heron quantum hardware demonstrate stable optimization, robustness to noise, and improved performance of VQC-based adaptive heads under matched parameter budgets. These results suggest that modular hybrid architectures provide a practical and scalable pathway for quantum-enhanced learning in the NISQ regime.

•Jul 6, 2026•0 citations

Hybrid Quantum-Classical Training in Quantum Neural Networks: A Framework for Bridging Parameterized Quantum Circuits and Classical Optimization

Matthew Busel

Quantum Neural Networks (QNNs) represent a compelling convergence of quantum mechanics and machine learning, yet their practical deployment remains constrained by noise, limited qubit counts, and the cost of full quantum execution. Hybrid quantum-classical (HQC) training offers a pragmatic path forward: parameterized quantum circuits (PQCs) process information in exponentially large Hilbert spaces while classical optimizers update parameters via gradient methods accessible on today's hardware. We present a modular HQC training framework, formalising the parameter-shift rule for hardware-compatible gradient estimation, characterising the barren-plateau phenomenon through a variance-decay analysis, and introducing noise-aware training strategies for NISQ devices. Empirical results from state-vector and shot-based simulation confirm measurable quantum advantage on quantum-structured tasks, with the phase classification benchmark improving +12.1% over a classical MLP baseline. The accompanying open-source library provides a clean abstraction between quantum simulation and classical optimisation, serving as a foundation for near-term quantum machine learning research.

•Mar 3, 2026•0 citations

A HYBRID QUANTUM-CLASSICAL MACHINE LEARNING FRAMEWORK FOR IMPROVED CLASSIFICATION ACCURACY

Shweta Narayan Bamne, Prof. M.S Shegokar

Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.

International Journal of Engineering Applied Sciences and Technology•Oct 1, 2026•0 citations

Quantum LEGO Learning: A Modular Design Principle for Hybrid Artificial Intelligence

Jun Qi, Chao-Han Huck Yang, Pin-Yu Chen +3 more

Hybrid quantum-classical learning models increasingly integrate neural networks with variational quantum circuits (VQCs) to exploit complementary inductive biases. However, many existing approaches rely on tightly coupled architectures or task-specific encoders, limiting conceptual clarity, generality, and transferability across learning settings. In this work, we introduce Quantum LEGO Learning, a modular and architecture-agnostic learning framework that treats classical and quantum components as reusable, composable learning blocks with well-defined roles. Within this framework, a pre-trained classical neural network serves as a frozen feature block, while a VQC acts as a trainable adaptive module that operates on structured representations rather than raw inputs. This separation enables efficient learning under constrained quantum resources and provides a principled abstraction for analyzing hybrid models. We develop a block-wise generalization theory that decomposes learning error into approximation and estimation components, explicitly characterizing how the complexity and training status of each block influence overall performance. Our analysis generalizes prior tensor-network-specific results and identifies conditions under which quantum modules provide representational advantages over comparably sized classical heads. Empirically, we validate the framework through systematic block-swap experiments across frozen feature extractors and both quantum and classical adaptive heads. Experiments on quantum dot classification demonstrate stable optimization, reduced sensitivity to qubit count, and robustness to realistic noise.

cs.LGCross-listedarXiv:2601.21780•Jan 30, 2026•0 citations

Regression of Functions by Quantum Neural Networks Circuits

Fernando M. de Paula Neto, Lucas dos Reis Silva, Paulo S. G. de Mattos Neto +1 more

The performance of quantum neural network models depends strongly on architectural decisions, including circuit depth, placement of parametrized operations, and data-encoding strategies. Selecting an effective architecture is challenging and closely related to the classical difficulty of choosing suitable neural-network topologies, which is computationally hard. This work investigates automated quantum-circuit construction for regression tasks and introduces a genetic-algorithm framework that discovers Reduced Regressor QNN architectures. The approach explores depth, parametrized gate configurations, and flexible data re-uploading patterns, formulating the construction of quantum regressors as an optimization process. The discovered circuits are evaluated against seventeen classical regression models on twenty-two nonlinear benchmark functions and four analytical functions. Although classical methods often achieve comparable results, they typically require far more parameters, whereas the evolved quantum models remain compact while providing competitive performance. We further analyze dataset complexity using twelve structural descriptors and show, across five increasingly challenging meta-learning scenarios, that these measures can reliably predict which quantum architecture will perform best. The results demonstrate perfect or near-perfect predictive accuracy in several scenarios, indicating that complexity metrics offer powerful and compact representations of dataset structure and can effectively guide automated model selection. Overall, this study provides a principled basis for meta-learning-driven quantum architecture design and advances the understanding of how quantum models behave in regression settings--a topic that has received limited exploration in prior work. These findings pave the way for more systematic and theoretically grounded approaches to quantum regression.

quant-pharXiv:2512.19978•Dec 24, 2025•1 citation
Variational quantum circuits are increasingly studied as continuous-function approximators, but quantum regression remains difficult to train when global losses, finite-shot stochasticity, and circuit-depth growth combine to produce weak or ill-conditioned gradient signals. We study this trainability problem in a controlled hybrid quantum--classical regression design. The central ingredient is a capacity-controlled classical embedding that acts as a learnable geometric preconditioner: it reshapes the input distribution seen by a data-reuploading variational circuit while preserving a low-dimensional quantum bottleneck. We pair this representation design with a curriculum protocol that grows circuit depth progressively and switches from SPSA-based stochastic exploration to Adam-based analytic-gradient fine-tuning. We formalize the mechanism through a local quantum-tangent contraction statement: in the linearized quantum-parameter dynamics, the embedding changes the empirical Gram matrix that controls residual contraction and one-step loss decrease. Across finite-size statevector audits on PDE-informed regression benchmarks and small-data tabular tasks, the Hybrid QNN lowers error relative to Pure QNN baselines under matched quantum-model budgets. Strong classical references remain competitive, and in several cases are better in absolute error; the evidence therefore supports a trainability claim for the hybrid QNN design rather than a claim of classical or hardware quantum advantage.
This chapter develops variational quantum models as the dominant framework for near-term quantum machine learning (QML), emphasizing their role as trainable quantum circuits embedded within hybrid quantum-classical optimization loops. Building on earlier chapters on encoding and quantum feature geometry, it formulates parameterized quantum circuits (PQCs) as families of unitary transformations acting on reference states, with model outputs obtained through expectation values of observables. This measurement-based structure makes variational learning inherently stochastic and closely ties model behavior to circuit architecture, observable choice, and optimization strategy. This chapter examines variational quantum circuits (VQCs) as learning models, introduces quantum neural networks (QNNs) as structured variational architectures, and analyzes layered, data-reuploading, recurrent, and hybrid classical-quantum designs. It highlights the central tension between expressivity and trainability, showing how universality and approximation power are counterbalanced by optimization barriers such as barren plateaus. The discussion further develops ansatz design strategies, supervised, fidelity-based, and energy-based losses, regularization under noise, and practical methods for gradient estimation and optimization, including the parameter-shift rule, Simultaneous Perturbation Stochastic Approximation (SPSA), and layer-wise training. Together, these ideas establish variational quantum models as a flexible yet hardware-constrained paradigm whose practical success depends on careful coordination among architecture, measurement, and optimization.
Abstract Hybrid quantum–classical learning has emerged as a promising paradigm for leveraging near-term quantum devices in practical machine learning tasks. However, many existing hybrid architectures rely on tightly coupled end-to-end training schemes that are difficult to optimize, sensitive to quantum noise, and strongly dependent on specific encoder designs. In this work, we introduce Quantum LEGO Learning, a modular framework for hybrid artificial intelligence that decomposes learning into reusable classical and quantum blocks with explicitly separated roles. Within this framework, a pre-trained classical neural network acts as a frozen feature extractor, while a variational quantum circuit (VQC) serves as the only trainable, adaptive module that operates on structured latent representations. This design enables stable optimization, reduces parameter coupling between classical and quantum components, and supports architecture-agnostic integration across different classical backbones. We develop a block-wise theoretical analysis that decomposes the learning behavior of the hybrid model into components of approximation, estimation, optimization, and noise-induced error. The analysis shows that once expressive classical representations are fixed, the overall model's approximation capability depends primarily on the classical feature block, while the trainable quantum module governs the complexity of downstream adaptation. We further derive optimization and noise-resilience bounds demonstrating how freezing the classical block suppresses the propagation of noisy gradients during training. To validate the proposed framework, we conduct systematic experiments on quantum dot classification and genome transcription factor binding site prediction using multiple frozen feature extractors, including ResNet and tensor-train network backbones, combined with both quantum and classical adaptive heads. Experimental results from noiseless simulations, realistic quantum-noise models, and IBM Heron quantum hardware demonstrate stable optimization, robustness to noise, and improved performance of VQC-based adaptive heads under matched parameter budgets. These results suggest that modular hybrid architectures provide a practical and scalable pathway for quantum-enhanced learning in the NISQ regime.
Quantum Neural Networks (QNNs) represent a compelling convergence of quantum mechanics and machine learning, yet their practical deployment remains constrained by noise, limited qubit counts, and the cost of full quantum execution. Hybrid quantum-classical (HQC) training offers a pragmatic path forward: parameterized quantum circuits (PQCs) process information in exponentially large Hilbert spaces while classical optimizers update parameters via gradient methods accessible on today's hardware. We present a modular HQC training framework, formalising the parameter-shift rule for hardware-compatible gradient estimation, characterising the barren-plateau phenomenon through a variance-decay analysis, and introducing noise-aware training strategies for NISQ devices. Empirical results from state-vector and shot-based simulation confirm measurable quantum advantage on quantum-structured tasks, with the phase classification benchmark improving +12.1% over a classical MLP baseline. The accompanying open-source library provides a clean abstraction between quantum simulation and classical optimisation, serving as a foundation for near-term quantum machine learning research.
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Hybrid quantum-classical learning models increasingly integrate neural networks with variational quantum circuits (VQCs) to exploit complementary inductive biases. However, many existing approaches rely on tightly coupled architectures or task-specific encoders, limiting conceptual clarity, generality, and transferability across learning settings. In this work, we introduce Quantum LEGO Learning, a modular and architecture-agnostic learning framework that treats classical and quantum components as reusable, composable learning blocks with well-defined roles. Within this framework, a pre-trained classical neural network serves as a frozen feature block, while a VQC acts as a trainable adaptive module that operates on structured representations rather than raw inputs. This separation enables efficient learning under constrained quantum resources and provides a principled abstraction for analyzing hybrid models. We develop a block-wise generalization theory that decomposes learning error into approximation and estimation components, explicitly characterizing how the complexity and training status of each block influence overall performance. Our analysis generalizes prior tensor-network-specific results and identifies conditions under which quantum modules provide representational advantages over comparably sized classical heads. Empirically, we validate the framework through systematic block-swap experiments across frozen feature extractors and both quantum and classical adaptive heads. Experiments on quantum dot classification demonstrate stable optimization, reduced sensitivity to qubit count, and robustness to realistic noise.
The performance of quantum neural network models depends strongly on architectural decisions, including circuit depth, placement of parametrized operations, and data-encoding strategies. Selecting an effective architecture is challenging and closely related to the classical difficulty of choosing suitable neural-network topologies, which is computationally hard. This work investigates automated quantum-circuit construction for regression tasks and introduces a genetic-algorithm framework that discovers Reduced Regressor QNN architectures. The approach explores depth, parametrized gate configurations, and flexible data re-uploading patterns, formulating the construction of quantum regressors as an optimization process. The discovered circuits are evaluated against seventeen classical regression models on twenty-two nonlinear benchmark functions and four analytical functions. Although classical methods often achieve comparable results, they typically require far more parameters, whereas the evolved quantum models remain compact while providing competitive performance. We further analyze dataset complexity using twelve structural descriptors and show, across five increasingly challenging meta-learning scenarios, that these measures can reliably predict which quantum architecture will perform best. The results demonstrate perfect or near-perfect predictive accuracy in several scenarios, indicating that complexity metrics offer powerful and compact representations of dataset structure and can effectively guide automated model selection. Overall, this study provides a principled basis for meta-learning-driven quantum architecture design and advances the understanding of how quantum models behave in regression settings--a topic that has received limited exploration in prior work. These findings pave the way for more systematic and theoretically grounded approaches to quantum regression.