Home Optimizing Quantum Algorithmic Complexity through Hybrid Variational Models

Publications

Optimizing Quantum Algorithmic Complexity through Hybrid Variational Models

Year : 2026

Publisher : Institute of Electrical and Electronics Engineers Inc.

Source Title : Proceedings of the 2026 International Conference on AI-Driven Smart Systems and Ubiquitous Computing, ICAUC 2026

Document Type :

Abstract

Hybrid quantum classical algorithms offer a promising approach for exploiting Noisy Intermediate Scale Quantum devices; however, their practical deployment remains limited by excessive circuit depth, hardware noise, and inefficient utilization of quantum resources. This paper presents a Hybrid Variational Optimization (HVO) framework that reduces quantum algorithmic complexity by integrating adaptive circuit pruning with classical feedback-driven optimization and a unified Quantum Complexity Metric (QCM). Unlike prior adaptive variational approaches such as RE-ADAPT-VQA, the proposed framework explicitly optimizes the trade-off between gate count, fidelity, and qubit resources while remaining modular and hardware-agnostic. To ensure a fair and transparent evaluation, the proposed method is compared against a well-tuned shallow Variational Quantum Eigensolver (VQE), QAOA, and RE-ADAPT-VQA. Experimental validation on IBM Quantum simulators and real NISQ hardware demonstrates up to a 35% reduction in circuit complexity, a 30% reduction in execution time, and improved fidelity of 0.94. Furthermore, performance evaluation using accuracy, precision, recall, and F1-score confirms the robustness and reliability of the proposed framework. These results demonstrate that HVO provides a scalable and noise-resilient solution for near term quantum computing applications.