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

TensorDual-VQC: Operator Learning for Scalable and Noise-Robust Variational Quantum Circuits

Jun Qi, Chao-Han Huck Yang, Pooja Rao, Héctor Zenil, Jesper N. Tegner

Published May 15, 2026• 0 citations
Publisher

Abstract

Abstract Variational quantum circuits (VQCs) are a central paradigm for quantum machine learning, yet their practical deployment is limited by poor trainability, sensitivity to noise, and the lack of input-adaptive parameterization. In this work, we introduce TensorDual-VQC, a tensor-structured operator-learning framework that models variational quantum computation as an input-conditioned mapping that jointly governs quantum state encoding and circuit parameter generation. The proposed approach employs a shared low-rank Tensor-Train (TT) backbone with dual output heads, inducing a coupled representation that constrains the hypothesis space to a structured low-dimensional manifold. Under standard smoothness and low-rank assumptions, we show that the approximation behavior is governed by the TT-rank rather than the ambient parameter dimension, and that shared latent structure can enable more compact representations than decoupled parameterizations in structured regimes. We further analyze trainability through the induced Neural Tangent Kernel, showing that the multi-branch gradient structure enriches the span of gradient features and can improve kernel conditioning under mild non-degeneracy conditions. In addition, we relate robustness to quantum noise to the intrinsic effective dimension of the tensor parameter manifold, providing a first-order scaling characterization of output variance under stochastic perturbations. We evaluate TensorDual-VQC on quantum dot classification, quantum simulation, and combinatorial optimization tasks under both simulated noise and real quantum hardware. Across all settings, the proposed framework achieves higher accuracy, faster convergence, and greater stability than standard VQCs and hypernetwork-based baselines when quantum resources are matched. These results suggest that structured operator learning with shared low-rank representations provides a principled and practical approach to scalable, noise-resilient quantum learning in the NISQ regime.

DOI
10.21203/rs.3.rs-9591139/v1

Related papers

TensorHyper-VQC: a tensor-train-guided hypernetwork for robust and scalable variational quantum computing

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

Abstract Variational Quantum Computing (VQC) faces fundamental scalability barriers, primarily due to the presence of barren plateaus and its sensitivity to quantum noise. To address these challenges, we introduce TensorHyper-VQC, a novel tensor-train (TT)-guided hypernetwork framework that significantly improves the robustness and scalability of VQC. Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware. This innovative parameterization mitigates gradient vanishing, enhances noise resilience through structured low-rank representations, and facilitates efficient gradient propagation. Grounded in Neural Tangent Kernel and statistical learning theory, our rigorous theoretical analyses establish strong guarantees on approximation capability, optimization stability, and generalization performance. Extensive empirical results across quantum dot classification, Max-Cut optimization, and molecular quantum simulation tasks demonstrate that TensorHyper-VQC consistently achieves superior performance and robust noise tolerance, including hardware-level validation on a 156-qubit IBM Heron processor. These results position TensorHyper-VQC as a scalable and noise-resilient framework for advancing practical quantum machine learning on near-term devices.

arXiv:2508.01116•npj Quantum Information•Feb 21, 2026•8 citations

Scalable Quantum Machine Learning via Multi-layer Fully-Connected Variational Quantum Circuits

Howard Su, Chen-Yu Liu, Samuel Yen-Chi Chen +2 more

Variational quantum circuits (VQCs) face an expressivity-trainability dilemma and scalability challenges. We propose Multi-Layer Fully-Connected Variational Quantum Circuits (FC-VQC), a general-purpose quantum machine learning framework that connects local VQC blocks through measurement, deterministic parameter-free routing, and re-encoding. All trainable model parameters reside within the quantum blocks, without trainable classical neural components. We study fully connected, sliding-window, and parallel block mixing and analyze computational costs, conditional error propagation, and block information exchange. Using classical simulation, we evaluate tabular regression and classification, with our main comparison addressing spatio-temporal function approximation for the Black--Scholes, Burgers, and time-dependent oscillatory PDEs with up to $144$ spatial dimensions. Comparisons include neural-network, explicit angle-feature, tensor-network, and gradient-boosted-tree baselines. The results show that FC-VQC achieves the lowest trajectory relative MAE for all PDEs at the higher dimensions $d\in\{81,144\}$. Gradient-dynamics and depolarizing-noise experiments provide complementary empirical diagnostics of trainability and preliminary noise sensitivity.

quant-pharXiv:2602.16623•Feb 19, 2026•0 citations

VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning

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

Abstract Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning, yet their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise. This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles. By innovatively employing quantum circuits to dynamically generate parameters for classical Multi-Layer Perceptrons (MLPs) via amplitude encoding and parameterized quantum operations, VQC-MLPNet substantially expands representation capabilities and augments training stability. We provide rigorous theoretical guarantees via statistical learning techniques and Neural Tangent Kernel analysis, explicitly deriving upper bounds on approximation, uniform deviation, and optimization errors. These theoretical insights demonstrate exponential improvements in representation capacity relative to quantum circuit depth and the number of qubits, providing clear computational advantages over standalone quantum circuits and existing hybrid quantum architectures. Our theoretical claims are empirically corroborated through extensive experiments, including the classification of semiconductor quantum-dot charge states and the prediction of genomic transcription factor binding sites, demonstrating resilient performance even under realistic IBM quantum noise simulations. This research establishes a theoretically sound and practically robust framework, advancing the frontiers of quantum-enhanced learning for unconventional computing paradigms in the Noisy Intermediate-Scale Quantum era and beyond.

arXiv:2506.10275•Jun 9, 2025•4 citations

Scalable Tensor Ring Methods for Variational Quantum Algorithms

Dheeraj Peddireddy

Variational quantum algorithms (VQAs) have emerged as a promising candidate for realizing quantum advantage in machine learning and optimization tasks on noisy intermediate-scale quantum (NISQ) devices. Despite significant theoretical promise, the practical impact of VQAs is constrained by the exponential growth in computational resources required for classical simulation, the onset of barren plateaus in parameterized landscapes, and the inherent difficulties of scaling classical optimization routines to circuits with many qubits and layers. Addressing these intertwined challenges is essential for both advancing quantum algorithm development and extracting actionable physical insights from modern quantum hardware.This dissertation develops, analyzes, and validates an efficient framework based on approximate tensor ring decompositions for the classical simulation, training, and benchmarking of variational quantum circuits and eigensolvers. The first component of this work formalizes the representation of quantum states and gates within a cyclic tensor ring structure, enabling the compression of parameterized quantum circuits to linear scaling in both qubit number and circuit depth, while preserving essential quantum correlations and entanglement structure. Gate operations are efficiently approximated via truncated singular value decomposition, and novel algorithms for forward propagation and gradient-based training in the tensor ring domain are developed. These methodological advances are systematically benchmarked on standard supervised learning tasks, including Iris and MNIST datasets, and compared to conventional statevector and matrix product state baselines, resulting in competitive accuracy and orders-of-magnitude reductions in simulation cost. Extending this framework, the dissertation also introduces a scalable method for gradient evaluation in variational quantum eigensolvers (VQE) using the approximate tensor ring representation. This approach enables the simulation and training of large circuits for combinatorial optimization problems, supporting practical qubit counts and circuit depths inaccessible to traditional simulation methods. Detailed experiments on the Maximum-Cut optimization problem demonstrate both the computational efficiency and robustness of the tensor ring framework in nontrivial optimization landscapes.Collectively, the results establish approximate tensor ring decomposition as a versatile and powerful framework for advancing quantum machine learning and discrete optimization, supporting both pre-deployment benchmarking on classical hardware and algorithm design for next-generation quantum devices. This work provides a foundation for the further exploration of scalable quantum-classical hybrid algorithms, with implications for quantum simulation, optimization, and beyond.

•Jan 20, 2026•0 citations

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

Hybrid Parameterized Quantum States for Variational Quantum Learning

Chen-Yu Liu

Variational quantum learning faces practical challenges in the noisy intermediate-scale quantum (NISQ) era. Parameterized quantum circuit (PQC) models suffer from statistical uncertainty due to finite-shot measurements and are highly sensitive to quantum noise, while purely classical approximations like neural quantum states (NQS) lack access to genuine quantum correlations and are limited in scalability. This work introduces Hybrid Parameterized Quantum States (HPQS), a general-purpose modeling framework that interpolates between quantum and classical parameterizations. HPQS combines PQC-based measurements with neural estimators via a blending mechanism and postprocessing functions, enabling enhanced, shot-efficient evaluation under hardware constraints. We demonstrate HPQS across three representative quantum learning tasks: (1) Expectation-based QML, where HPQS yields higher classification accuracy than PQC-only and NQS-only baselines under limited quantum measurements. (2) Quantum-Train, where HPQS generates the entire parameter set of classical networks using polylogarithmic trainable variables; and (3) Quantum Parameter Adaptation (QPA), where HPQS produces LoRA adapter parameters for fine-tuning large language models like GPT-2 and Gemma-2 with improved perplexity under low-shot conditions; Together, these results position HPQS as a scalable, noise-resilient approach for variational quantum learning, compatible with both current NISQ hardware and future fault-tolerant architectures.

arXiv:2505.16676•May 22, 2025•1 citation
Abstract Variational quantum circuits (VQCs) are a central paradigm for quantum machine learning, yet their practical deployment is limited by poor trainability, sensitivity to noise, and the lack of input-adaptive parameterization. In this work, we introduce TensorDual-VQC, a tensor-structured operator-learning framework that models variational quantum computation as an input-conditioned mapping that jointly governs quantum state encoding and circuit parameter generation. The proposed approach employs a shared low-rank Tensor-Train (TT) backbone with dual output heads, inducing a coupled representation that constrains the hypothesis space to a structured low-dimensional manifold. Under standard smoothness and low-rank assumptions, we show that the approximation behavior is governed by the TT-rank rather than the ambient parameter dimension, and that shared latent structure can enable more compact representations than decoupled parameterizations in structured regimes. We further analyze trainability through the induced Neural Tangent Kernel, showing that the multi-branch gradient structure enriches the span of gradient features and can improve kernel conditioning under mild non-degeneracy conditions. In addition, we relate robustness to quantum noise to the intrinsic effective dimension of the tensor parameter manifold, providing a first-order scaling characterization of output variance under stochastic perturbations. We evaluate TensorDual-VQC on quantum dot classification, quantum simulation, and combinatorial optimization tasks under both simulated noise and real quantum hardware. Across all settings, the proposed framework achieves higher accuracy, faster convergence, and greater stability than standard VQCs and hypernetwork-based baselines when quantum resources are matched. These results suggest that structured operator learning with shared low-rank representations provides a principled and practical approach to scalable, noise-resilient quantum learning in the NISQ regime.
Abstract Variational Quantum Computing (VQC) faces fundamental scalability barriers, primarily due to the presence of barren plateaus and its sensitivity to quantum noise. To address these challenges, we introduce TensorHyper-VQC, a novel tensor-train (TT)-guided hypernetwork framework that significantly improves the robustness and scalability of VQC. Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware. This innovative parameterization mitigates gradient vanishing, enhances noise resilience through structured low-rank representations, and facilitates efficient gradient propagation. Grounded in Neural Tangent Kernel and statistical learning theory, our rigorous theoretical analyses establish strong guarantees on approximation capability, optimization stability, and generalization performance. Extensive empirical results across quantum dot classification, Max-Cut optimization, and molecular quantum simulation tasks demonstrate that TensorHyper-VQC consistently achieves superior performance and robust noise tolerance, including hardware-level validation on a 156-qubit IBM Heron processor. These results position TensorHyper-VQC as a scalable and noise-resilient framework for advancing practical quantum machine learning on near-term devices.
Variational quantum circuits (VQCs) face an expressivity-trainability dilemma and scalability challenges. We propose Multi-Layer Fully-Connected Variational Quantum Circuits (FC-VQC), a general-purpose quantum machine learning framework that connects local VQC blocks through measurement, deterministic parameter-free routing, and re-encoding. All trainable model parameters reside within the quantum blocks, without trainable classical neural components. We study fully connected, sliding-window, and parallel block mixing and analyze computational costs, conditional error propagation, and block information exchange. Using classical simulation, we evaluate tabular regression and classification, with our main comparison addressing spatio-temporal function approximation for the Black--Scholes, Burgers, and time-dependent oscillatory PDEs with up to 144144144 spatial dimensions. Comparisons include neural-network, explicit angle-feature, tensor-network, and gradient-boosted-tree baselines. The results show that FC-VQC achieves the lowest trajectory relative MAE for all PDEs at the higher dimensions d∈{81,144}d\in\{81,144\}d∈{81,144}. Gradient-dynamics and depolarizing-noise experiments provide complementary empirical diagnostics of trainability and preliminary noise sensitivity.
Abstract Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning, yet their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise. This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles. By innovatively employing quantum circuits to dynamically generate parameters for classical Multi-Layer Perceptrons (MLPs) via amplitude encoding and parameterized quantum operations, VQC-MLPNet substantially expands representation capabilities and augments training stability. We provide rigorous theoretical guarantees via statistical learning techniques and Neural Tangent Kernel analysis, explicitly deriving upper bounds on approximation, uniform deviation, and optimization errors. These theoretical insights demonstrate exponential improvements in representation capacity relative to quantum circuit depth and the number of qubits, providing clear computational advantages over standalone quantum circuits and existing hybrid quantum architectures. Our theoretical claims are empirically corroborated through extensive experiments, including the classification of semiconductor quantum-dot charge states and the prediction of genomic transcription factor binding sites, demonstrating resilient performance even under realistic IBM quantum noise simulations. This research establishes a theoretically sound and practically robust framework, advancing the frontiers of quantum-enhanced learning for unconventional computing paradigms in the Noisy Intermediate-Scale Quantum era and beyond.
Variational quantum algorithms (VQAs) have emerged as a promising candidate for realizing quantum advantage in machine learning and optimization tasks on noisy intermediate-scale quantum (NISQ) devices. Despite significant theoretical promise, the practical impact of VQAs is constrained by the exponential growth in computational resources required for classical simulation, the onset of barren plateaus in parameterized landscapes, and the inherent difficulties of scaling classical optimization routines to circuits with many qubits and layers. Addressing these intertwined challenges is essential for both advancing quantum algorithm development and extracting actionable physical insights from modern quantum hardware.This dissertation develops, analyzes, and validates an efficient framework based on approximate tensor ring decompositions for the classical simulation, training, and benchmarking of variational quantum circuits and eigensolvers. The first component of this work formalizes the representation of quantum states and gates within a cyclic tensor ring structure, enabling the compression of parameterized quantum circuits to linear scaling in both qubit number and circuit depth, while preserving essential quantum correlations and entanglement structure. Gate operations are efficiently approximated via truncated singular value decomposition, and novel algorithms for forward propagation and gradient-based training in the tensor ring domain are developed. These methodological advances are systematically benchmarked on standard supervised learning tasks, including Iris and MNIST datasets, and compared to conventional statevector and matrix product state baselines, resulting in competitive accuracy and orders-of-magnitude reductions in simulation cost. Extending this framework, the dissertation also introduces a scalable method for gradient evaluation in variational quantum eigensolvers (VQE) using the approximate tensor ring representation. This approach enables the simulation and training of large circuits for combinatorial optimization problems, supporting practical qubit counts and circuit depths inaccessible to traditional simulation methods. Detailed experiments on the Maximum-Cut optimization problem demonstrate both the computational efficiency and robustness of the tensor ring framework in nontrivial optimization landscapes.Collectively, the results establish approximate tensor ring decomposition as a versatile and powerful framework for advancing quantum machine learning and discrete optimization, supporting both pre-deployment benchmarking on classical hardware and algorithm design for next-generation quantum devices. This work provides a foundation for the further exploration of scalable quantum-classical hybrid algorithms, with implications for quantum simulation, optimization, and beyond.
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.
Variational quantum learning faces practical challenges in the noisy intermediate-scale quantum (NISQ) era. Parameterized quantum circuit (PQC) models suffer from statistical uncertainty due to finite-shot measurements and are highly sensitive to quantum noise, while purely classical approximations like neural quantum states (NQS) lack access to genuine quantum correlations and are limited in scalability. This work introduces Hybrid Parameterized Quantum States (HPQS), a general-purpose modeling framework that interpolates between quantum and classical parameterizations. HPQS combines PQC-based measurements with neural estimators via a blending mechanism and postprocessing functions, enabling enhanced, shot-efficient evaluation under hardware constraints. We demonstrate HPQS across three representative quantum learning tasks: (1) Expectation-based QML, where HPQS yields higher classification accuracy than PQC-only and NQS-only baselines under limited quantum measurements. (2) Quantum-Train, where HPQS generates the entire parameter set of classical networks using polylogarithmic trainable variables; and (3) Quantum Parameter Adaptation (QPA), where HPQS produces LoRA adapter parameters for fine-tuning large language models like GPT-2 and Gemma-2 with improved perplexity under low-shot conditions; Together, these results position HPQS as a scalable, noise-resilient approach for variational quantum learning, compatible with both current NISQ hardware and future fault-tolerant architectures.