Variational Quantum Circuits (VQC) are promising models for quantum machine learning, but standard monolithic architectures face an expressivity--trainability dilemma: small circuits can be under-parameterized, while larger circuits are difficult to simulate and optimize. We propose Multi-Layer Fully-Connected Variational Quantum Circuits (FC-VQC), a modular framework that decomposes high-dimensional inputs into fixed-size local VQC blocks connected by deterministic block-mixing rules. This design keeps each quantum computation local while allowing the number of trainable quantum parameters to scale linearly with input dimension. We evaluate FC-VQC across tabular regression, tabular classification, and spatio-temporal BSDE/PDE approximation. Across the evaluated tasks, FC-VQC improves over monolithic VQC baselines and achieves competitive or improved performance relative to structure-matched deep neural network (DNN) baselines, while using substantially fewer trainable parameters.
Comments
36 pages, 10 figures, 13 tables. Main text: 9 pages
Variational Quantum Circuits (VQC) are promising models for quantum machine learning, but standard monolithic architectures face an expressivity--trainability dilemma: small circuits can be under-parameterized, while larger circuits are difficult to simulate and optimize. We propose Multi-Layer Fully-Connected Variational Quantum Circuits (FC-VQC), a modular framework that decomposes high-dimensional inputs into fixed-size local VQC blocks connected by deterministic block-mixing rules. This design keeps each quantum computation local while allowing the number of trainable quantum parameters to scale linearly with input dimension. We evaluate FC-VQC across tabular regression, tabular classification, and spatio-temporal BSDE/PDE approximation. Across the evaluated tasks, FC-VQC improves over monolithic VQC baselines and achieves competitive or improved performance relative to structure-matched deep neural network (DNN) baselines, while using substantially fewer trainable parameters.
Variational quantum circuits (VQCs) are a leading approach to quantum machine learning on near-term devices, yet it remains unclear which circuit architecture yields the best accuracy-parameter trade-off on classical tabular data. We present a systematic empirical comparison of four VQC families -- multi-layer fully-connected (FC-VQC), residual (ResNet-VQC), hybrid quantum-classical transformer (QT), and fully quantum transformer (FQT) -- across five regression and classification benchmarks. Our key findings are: \textbf{(i)}~FC-VQCs achieve 90-96\% of the R2 of attention-based VQCs while using 40-50\% fewer parameters, and consistently outperform equal-capacity MLPs (mean R2=0.829 vs.\ MLP720's 0.753 on Boston Housing, 3-seed average); \textbf{(ii)}~FC-VQC's Type~4 inter-block connectivity provides partial cross-token mixing that approximates the role of attention -- explicit quantum self-attention yields only marginal gains on most datasets while significantly increasing parameter count; \textbf{(iii)}~expressibility saturates at circuit depth~≈3, explaining why shallow VQCs already cover the Hilbert space effectively; \textbf{(iv)}~LayerNorm on the fully quantum transformer improves classification accuracy, suggesting normalization is important when all operations are quantum; \textbf{(v)}~in our noise study on Boston Housing, FQT degrades gracefully under depolarizing noise while QT collapses. All results are validated across three random seeds. These findings provide practical architectural guidance for deploying VQCs on near-term quantum hardware.
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.
Solving high-dimensional parabolic partial differential equations (PDEs) is important in engineering, physics, and stochastic control. Deep BSDE methods reformulate semilinear PDEs as backward stochastic differential equations and admit a model-based reinforcement learning interpretation, where trajectories are generated from known stochastic dynamics while a trainable model learns the gradient-related control process. We propose a Quantum Transformer BSDE solver based on Multi-Layer Fully-Connected Variational Quantum Circuits (FC-VQC). The method treats the normalized state trajectory as time--coordinate tokens and applies causal self-attention to learn interactions in the adapted BSDE gradient process. All trainable model parameters are contained within the FC-VQC embedding, projection, feed-forward, and decoder modules, while attention and structural operations remain classical and parameter-free. Experiments on three d=36 PDE benchmarks show that QTransformer consistently improves over the non-attentive FC-VQC baseline and outperforms the classical Transformer at compact hidden widths, while the wider classical Transformer achieves the best overall accuracy. These results demonstrate that combining causal attention with FC-VQC provides an effective quantum architecture for high-dimensional BSDE trajectory learning.
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.
Quantum reinforcement learning (QRL) is often evaluated under idealized, noiseless assumptions, yet realistic quantum devices inevitably introduce noise that can severely degrade performance. This paper improves the robustness of quantum deep Q-learning (QDQN) by redesigning the variational quantum circuit (VQC) used in its value-function approximator. Motivated by recent advances in quantum convolutional neural networks (QCNNs), we construct four QCNN-inspired VQC variants (Models A–D) by combining representative QCNN two-qubit building blocks with an explicit fully connected (all-to-all) layer. Using a 10-fold evaluation protocol at a fixed noise level p = 0.005, Model D achieves the best robustness, reducing the mean number of episodes required to reach a target reward from 1981 (baseline) to 1243. Under a stricter success criterion, Model D also doubles the empirically observed noise-tolerance boundary from 0.002 to 0.004. These results indicate that carefully chosen QCNN-style circuit components and connectivity can significantly improve the noise robustness of QDQN-like QRL agents.
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.