Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment

Understand this faster with AI
Quantum Physics arXiv:2609.28491 (quant-ph) [Submitted on 30 Aug 2026] Title:Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment Authors:Dilli Hang Rai View a PDF of the paper titled Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment, by Dilli Hang Rai View PDF HTML (experimental) Abstract:Hybrid quantum-classical neural networks have emerged as a promising approach for leveraging quantum computing in machine learning while mitigating current hardware limitations. This paper presents Sim-HVQC, a hybrid Deep Quantum Neural Network that couples an adaptive, parameter-free SimAM weighting module with classical feature extraction to preserve class-discriminative information prior to encoding into a Variational Quantum Circuit (VQC). Previous studies are restricted to binary classification [1] [2] [3] [4] [5]. In contrast, the proposed framework is trained and evaluated on various multi-class datasets(MNIST, KMNIST, Fashion-MNIST, and EMNIST). The framework further demonstrates reproducibility, parameter efficiency, and interpretability through multi-seed evaluation, parameter analysis, and latent/quantum feature inspection. The source code is publicly available at this https URL SimAM-HVQC Comments: Subjects: Quantum Physics (quant-ph); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2609.28491 [quant-ph] (or arXiv:2609.28491v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2609.28491 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Dilli Hang Rai [view email] [v1] Sun, 30 Aug 2026 12:44:48 UTC (3,769 KB) Full-text links: Access Paper: View a PDF of the paper titled Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment, by Dilli Hang RaiView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-09 Change to browse by: cs cs.AI cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
