While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a promising route for tackling such problems, yet their practical performance is limited by repeated quantum circuit evaluations and classical parameter updates. In this work, we introduce DQAOA-GPT, a hybrid framework that integrates the distributed quantum approximate optimization algorithm (DQAOA), which decomposes a large optimization problem into smaller sub-problems, with GPT-based quantum circuit generation for solving those sub-problems. Rather than relying on iterative variational optimization, the proposed approach uses a trained generative model to directly generate high-quality quantum circuits for the decomposed sub-problems. As a benchmark, we evaluate DQAOA-GPT against conventional DQAOA on dense HUBO optimization problems with up to 100 decision variables. The results demonstrate that DQAOA-GPT significantly reduces computational cost while maintaining competitive solution quality, with larger acceleration observed for larger sub-problem sizes. Although this work focuses on benchmark-scale validation, the framework provides a promising foundation for larger-scale combinatorial optimization in hybrid HPC-QC environments through increased GPU resources and parallel computing capability.
Seongmin Kim, A. Rijal, Yuri Alexeev et al.· arXiv.org· 0 citations
The extensive deployment of power-electronics introduce spatial-temporal variability that can degrade voltage quality and operational reliability. Energy storage systems (ESS) can mitigate these effects through fast active and reactive power support, but their value is contingent on coordinated siting and sizing. Integrated formulations that minimize voltage deviations, reduce substation power-flow variability, and account for installation costs typically yield in large-scale mixed-integer optimization problems that are computationally burdensome for classical solvers and may yet not lead to the most optimum solution. To address these challenges, this paper proposes a two-stage hybrid quantum-classical planning framework that separates binary siting from continuous sizing and operation. In Stage I, the siting problem is reformulated as a Quadratic Unconstrained Binary Optimization model and solved via a hybrid quantum workflow. Acting as a "quantum sieve," stochastic sampling generates a diverse set of candidate site combinations that classical single-point methods can overlook. In Stage II, selected site sets are evaluated using a classical convex solver (SOCP) to compute optimal ESS capacities and operating setpoints subject to network constraints, ensuring physical feasibility. Experiments on IonQ Forte hardware show grid-standard accuracy with industry-standard classical solvers. Although current hardware latencies limit performance in the NISQ era, the paper outlines scaling pathways and discusses key practical hurdles, including state-preparation overlap and higher-order cost couplings.
M. Hasan, Willie Aboumrad, Phani R. V. Marthi et al.· Scientific Reports· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
