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

Frontiers in Emerging Multidisciplinary Sciences

ScaleGen: A Combinatorial Generative LLM Framework for Scalability-Constrained Decision Optimization

Muhammad Hamza Khan, Dr. Ayesha Malik

Published Aug 19, 2026• 0 citations
Publisher

Abstract

Scalability-constrained decision optimization requires decision systems to generate useful alternatives while simultaneously respecting computational, operational, and resource limitations. Conventional optimization approaches often depend on predefined candidate spaces, whereas generative large language models (LLMs) can construct semantically diverse decision alternatives but may produce infeasible or computationally expensive solutions. This paper proposes ScaleGen, a combinatorial generative LLM framework designed to integrate generative reasoning with explicit scalability constraints. The framework combines candidate generation, constraint representation, combinatorial evaluation, feasibility filtering, and final decision selection into a structured optimization pipeline. Its theoretical foundation is informed by research on machine learning, quantum machine learning, classification, and computational decision processes. Studies on quantum methods demonstrate the value of structured computational representations for complex learning problems (Ablayev et al., 2020a; Ablayev et al., 2020b), while quantum machine-learning applications illustrate the potential of advanced computational paradigms for classification and large decision spaces (Bhavsar et al., 2023; Yun et al., 2022). The proposed ScaleGen architecture extends these principles into an LLM-centered optimization setting by treating generated decisions as combinatorial objects subject to explicit scalability constraints. The framework emphasizes controllable generation rather than unrestricted text generation, thereby providing a conceptual bridge between generative AI and constrained optimization. The analysis indicates that ScaleGen can potentially improve candidate diversity, constraint awareness, and decision adaptability, although its effectiveness remains dependent on constraint encoding, evaluation reliability, computational overhead, and empirical validation.

DOI
10.64917/fems/volume03issue08-05

Related papers

LLM-QUBO: An End-to-End Framework for Automated QUBO Transformation from Natural Language Problem Descriptions

Huixiang Zhang, Mahzabeen Emu, Salimur Choudhury

Quantum annealing offers a promising paradigm for solving NP-hard combinatorial optimization problems, but its practical application is severely hindered by two challenges: the complex, manual process of translating problem descriptions into the requisite Quadratic Unconstrained Binary Optimization (QUBO) format and the scalability limitations of current quantum hardware. To address these obstacles, we propose a novel end-to-end framework, LLM-QUBO, that automates this entire formulation-to-solution pipeline. Our system leverages a Large Language Model (LLM) to parse natural language, automatically generating a structured mathematical representation. To overcome hardware limitations, we integrate a hybrid quantum-classical Benders' decomposition method. This approach partitions the problem, compiling the combinatorial complex master problem into a compact QUBO format, while delegating linearly structured sub-problems to classical solvers. The correctness of the generated QUBO and the scalability of the hybrid approach are validated using classical solvers, establishing a robust performance baseline and demonstrating the framework's readiness for quantum hardware. Our primary contribution is a synergistic computing paradigm that bridges classical AI and quantum computing, addressing key challenges in the practical application of optimization problem. This automated workflow significantly reduces the barrier to entry, providing a viable pathway to transform quantum devices into accessible accelerators for large-scale, real-world optimization challenges.

arXiv:2509.00099•Proceedings of the AAAI Symposium Series•Nov 23, 2025•2 citations

Infeasibility Aware Large Language Models for Combinatorial Optimization

Yakun Wang, Min Chen, Zeguan Wu +3 more

Large language models (LLMs) are increasingly explored for NP-hard combinatorial optimization problems, but most existing methods emphasize feasible-instance solution generation and do not explicitly address infeasibility detection. We propose an infeasibility-aware framework that combines certifiable dataset construction, supervised fine-tuning, and LLM-assisted downstream search. For the minor-embedding problem, we introduce a new mathematical programming formulation together with provable zero-phase infeasibility screening, which enables scalable construction of training instances labeled either as feasible with structured certificates or as certifiably infeasible. Using training data generated through this exact optimization pipeline, we show that an 8B-parameter LLM can be fine-tuned to jointly perform solution generation and infeasibility detection. We further utilize LLM outputs as warm starts for downstream local search, providing a practical way to accelerate optimization even when the LLM outputs are imperfect. Experiments show that our fine-tuned model improves overall accuracy by up to 30\% over GPT-5.2; meanwhile LLM-guided warm starts provide up to $2\times$ speedup compared with starting from scratch in downstream local search.

cs.AICross-listedarXiv:2604.01455•Apr 3, 2026•0 citations

Quantum-Enhanced Generative AI for Next-Generation Computing

Miss. Rupeshwari Janardan Rangari

Quantum Computing and Generative Artificial Intelligence are transforming the future of intelligent computing systems.The integration of quantum computing with generative AI introduces a new paradigm called Quantum-Enhanced Generative AI (QEGAI), which utilizes quantum mechanical principles such as superposition, entanglement, and quantum parallelism to improve computational efficiency, model training, optimization, and intelligent decision-making.Classical generative AI models such as Generative Adversarial Networks (GANs), Variational Autoencoders (VAEs), and Large Language Models (LLMs) demand extensive computational resources and energy consumption.Quantum-enhanced techniques address these limitations by accelerating optimization and enabling faster processing of complex datasets.This paper presents an in-depth study of QEGAI architectures, working principles, applications, advantages, limitations, and future research directions.The proposed framework combines quantum processors with classical AI infrastructure to create scalable and intelligent next-generation computing environments.The study also explores the role of quantum machine learning, hybrid quantum-classical architectures, cybersecurity, healthcare, smart cities, and scientific simulations.Comparative analysis demonstrates the superior computational capabilities of QEGAI over traditional AI approaches in selected tasks.Finally, the paper discusses implementation challenges such as qubit instability, noise, hardware scalability, and ethical concerns while outlining future opportunities for sustainable intelligent computing systems.

International Journal of Engineering and Creative Science•May 10, 2026•0 citations

Quantum-Enhanced Generative Learning for Precision Genomics and Molecular Discovery

Murali Krishna Pasupuleti

Abstract Precision genomics and molecular discovery require generative systems that connect heterogeneous biological information with functional candidate design while controlling uncertainty, biological risk and computational expenditure. This study develops Quantum-Enhanced Genomic and Molecular Learning (QEGML), a conditional quantum–classical framework integrating a modality-aware encoder, a parameterized quantum latent distribution, a classical molecular or sequence decoder, and constrained candidate selection. The research combines a focused synthesis of relevant literature with mathematical derivation and transparent numerical scenario analysis. No new patient cohort, quantum-hardware experiment or biological assay is reported. Conditional likelihood and distributional regularization define training, while activity, off-target effects, toxicity, resource burden and predictive uncertainty determine selection. A four-candidate calculation shows that the highest assumed activity does not necessarily yield the preferred feasible candidate. With the declared weights, uncertainty adjustment changes the selected candidate from A to B, increasing the evaluated risk-adjusted utility from 0.650 to 0.715. The ranking crossover occurs at a risk-aversion coefficient of 0.1875. Independent-shot calculations further show that reducing the worst-case standard error of a binary measurement from 0.050 to 0.0125 requires increasing the shot count from 100 to 1,600. A published molecular-discovery example is considered separately from these calculations. Comparative analysis specifies matched classical controls, noise ablations and cost-aware evaluation without assigning unmeasured performance gains to the quantum component. The contribution is an auditable framework linking generative representation, decision reliability and experimental accountability. Its practical value remains conditional on prospective biological validation and demonstrable improvement over strong classical alternatives. Keywords: quantum generative learning; precision genomics; multi-omics integration; conditional generation; variational quantum circuits; quantum Born machines; molecular discovery; genomic language models; constrained optimization; uncertainty quantification; finite-shot sampling; model calibration; experimental validation; computational benchmarking.

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Oct 30, 2026•1 citation

Quantum-Aware Large Language Models: Taxonomy, Architectures, and Future Applications

Reyhan Dede

The convergence of quantum computing and large language models (LLMs) represents a major milestone in computational intelligence, introducing novel paradigms for information processing, complexity modeling, and scientific advancement. This survey provides a comprehensive overview of the emerging interdisciplinary field that integrates quantum mechanics with natural language processing. We begin by presenting the foundational principles of quantum computing and LLMs, then examine their integration through automated quantum code generation, hybrid transformer architectures, and quantum natural language processing (QNLP) frameworks. State-of-the-art models, such as quantum-augmented attention mechanisms and circuit embedding strategies, are evaluated across domain-specific datasets and benchmarks. We also investigate the role of LLMs as quantum research assistants, educational tools, and simulation agents, particularly in resource-constrained environments. Furthermore, the survey explores challenges related to scalability, interpretability, and quantum data encoding, and outlines future research directions-especially the vision for fully quantum-native LLMs. Our goal is to guide researchers through the current landscape and to encourage continued exploration at the intersection of quantum technologies and advanced language models.

International Conference on Electrical, Communication, and Computer Engineering (ICECCE)•Aug 27, 2025•0 citations

Hybrid Quantum-Classical Optimization for Energy-Efficient Large Language Models

Loso Judijanto, Yuswardi Yuswardi, Fitriyani Fitriyani

The rapid evolution of Large Language Models (LLMs) has transformed natural language processing, enabling sophisticated applications across various sectors. However, the substantial computational demands associated with training and deploying LLMs result in significant energy consumption and carbon emissions. This study introduces an optimized hybrid quantum-classical framework that integrates variational quantum algorithms (VQAs) with accelerated classical learning techniques. By harnessing quantum computing for complex non-linear optimization and employing prompt learning to minimize full model retraining, the proposed approach enhances both computational efficiency and sustainability. Simulation outcomes indicate that the hybrid method can reduce energy usage by up to 30% and shorten computation time by 25% relative to conventional classical approaches, without diminishing model accuracy. These improvements are substantiated through quantitative analysis and visualized energy metrics. The adaptability of the framework supports its application in diverse areas, including sustainable energy management, supply chain optimization, and environmentally conscious transportation systems. Nevertheless, the broader implementation of such hybrid solutions remains constrained by current quantum hardware capabilities and integration challenges with classical infrastructure. The findings underscore the potential of hybrid quantum-classical optimization as a pathway toward sustainable AI development. Future research should prioritize advancements in quantum hardware reliability and interdisciplinary collaboration to accelerate practical adoption, thereby supporting global efforts in energy efficiency and environmental responsibility.

International Journal Software Engineering and Computer Science (IJSECS)•Aug 1, 2025•3 citations
Scalability-constrained decision optimization requires decision systems to generate useful alternatives while simultaneously respecting computational, operational, and resource limitations. Conventional optimization approaches often depend on predefined candidate spaces, whereas generative large language models (LLMs) can construct semantically diverse decision alternatives but may produce infeasible or computationally expensive solutions. This paper proposes ScaleGen, a combinatorial generative LLM framework designed to integrate generative reasoning with explicit scalability constraints. The framework combines candidate generation, constraint representation, combinatorial evaluation, feasibility filtering, and final decision selection into a structured optimization pipeline. Its theoretical foundation is informed by research on machine learning, quantum machine learning, classification, and computational decision processes. Studies on quantum methods demonstrate the value of structured computational representations for complex learning problems (Ablayev et al., 2020a; Ablayev et al., 2020b), while quantum machine-learning applications illustrate the potential of advanced computational paradigms for classification and large decision spaces (Bhavsar et al., 2023; Yun et al., 2022). The proposed ScaleGen architecture extends these principles into an LLM-centered optimization setting by treating generated decisions as combinatorial objects subject to explicit scalability constraints. The framework emphasizes controllable generation rather than unrestricted text generation, thereby providing a conceptual bridge between generative AI and constrained optimization. The analysis indicates that ScaleGen can potentially improve candidate diversity, constraint awareness, and decision adaptability, although its effectiveness remains dependent on constraint encoding, evaluation reliability, computational overhead, and empirical validation.
Quantum annealing offers a promising paradigm for solving NP-hard combinatorial optimization problems, but its practical application is severely hindered by two challenges: the complex, manual process of translating problem descriptions into the requisite Quadratic Unconstrained Binary Optimization (QUBO) format and the scalability limitations of current quantum hardware. To address these obstacles, we propose a novel end-to-end framework, LLM-QUBO, that automates this entire formulation-to-solution pipeline. Our system leverages a Large Language Model (LLM) to parse natural language, automatically generating a structured mathematical representation. To overcome hardware limitations, we integrate a hybrid quantum-classical Benders' decomposition method. This approach partitions the problem, compiling the combinatorial complex master problem into a compact QUBO format, while delegating linearly structured sub-problems to classical solvers. The correctness of the generated QUBO and the scalability of the hybrid approach are validated using classical solvers, establishing a robust performance baseline and demonstrating the framework's readiness for quantum hardware. Our primary contribution is a synergistic computing paradigm that bridges classical AI and quantum computing, addressing key challenges in the practical application of optimization problem. This automated workflow significantly reduces the barrier to entry, providing a viable pathway to transform quantum devices into accessible accelerators for large-scale, real-world optimization challenges.
Large language models (LLMs) are increasingly explored for NP-hard combinatorial optimization problems, but most existing methods emphasize feasible-instance solution generation and do not explicitly address infeasibility detection. We propose an infeasibility-aware framework that combines certifiable dataset construction, supervised fine-tuning, and LLM-assisted downstream search. For the minor-embedding problem, we introduce a new mathematical programming formulation together with provable zero-phase infeasibility screening, which enables scalable construction of training instances labeled either as feasible with structured certificates or as certifiably infeasible. Using training data generated through this exact optimization pipeline, we show that an 8B-parameter LLM can be fine-tuned to jointly perform solution generation and infeasibility detection. We further utilize LLM outputs as warm starts for downstream local search, providing a practical way to accelerate optimization even when the LLM outputs are imperfect. Experiments show that our fine-tuned model improves overall accuracy by up to 30\% over GPT-5.2; meanwhile LLM-guided warm starts provide up to 2×2\times2× speedup compared with starting from scratch in downstream local search.
Quantum Computing and Generative Artificial Intelligence are transforming the future of intelligent computing systems.The integration of quantum computing with generative AI introduces a new paradigm called Quantum-Enhanced Generative AI (QEGAI), which utilizes quantum mechanical principles such as superposition, entanglement, and quantum parallelism to improve computational efficiency, model training, optimization, and intelligent decision-making.Classical generative AI models such as Generative Adversarial Networks (GANs), Variational Autoencoders (VAEs), and Large Language Models (LLMs) demand extensive computational resources and energy consumption.Quantum-enhanced techniques address these limitations by accelerating optimization and enabling faster processing of complex datasets.This paper presents an in-depth study of QEGAI architectures, working principles, applications, advantages, limitations, and future research directions.The proposed framework combines quantum processors with classical AI infrastructure to create scalable and intelligent next-generation computing environments.The study also explores the role of quantum machine learning, hybrid quantum-classical architectures, cybersecurity, healthcare, smart cities, and scientific simulations.Comparative analysis demonstrates the superior computational capabilities of QEGAI over traditional AI approaches in selected tasks.Finally, the paper discusses implementation challenges such as qubit instability, noise, hardware scalability, and ethical concerns while outlining future opportunities for sustainable intelligent computing systems.
Abstract Precision genomics and molecular discovery require generative systems that connect heterogeneous biological information with functional candidate design while controlling uncertainty, biological risk and computational expenditure. This study develops Quantum-Enhanced Genomic and Molecular Learning (QEGML), a conditional quantum–classical framework integrating a modality-aware encoder, a parameterized quantum latent distribution, a classical molecular or sequence decoder, and constrained candidate selection. The research combines a focused synthesis of relevant literature with mathematical derivation and transparent numerical scenario analysis. No new patient cohort, quantum-hardware experiment or biological assay is reported. Conditional likelihood and distributional regularization define training, while activity, off-target effects, toxicity, resource burden and predictive uncertainty determine selection. A four-candidate calculation shows that the highest assumed activity does not necessarily yield the preferred feasible candidate. With the declared weights, uncertainty adjustment changes the selected candidate from A to B, increasing the evaluated risk-adjusted utility from 0.650 to 0.715. The ranking crossover occurs at a risk-aversion coefficient of 0.1875. Independent-shot calculations further show that reducing the worst-case standard error of a binary measurement from 0.050 to 0.0125 requires increasing the shot count from 100 to 1,600. A published molecular-discovery example is considered separately from these calculations. Comparative analysis specifies matched classical controls, noise ablations and cost-aware evaluation without assigning unmeasured performance gains to the quantum component. The contribution is an auditable framework linking generative representation, decision reliability and experimental accountability. Its practical value remains conditional on prospective biological validation and demonstrable improvement over strong classical alternatives. Keywords: quantum generative learning; precision genomics; multi-omics integration; conditional generation; variational quantum circuits; quantum Born machines; molecular discovery; genomic language models; constrained optimization; uncertainty quantification; finite-shot sampling; model calibration; experimental validation; computational benchmarking.
The convergence of quantum computing and large language models (LLMs) represents a major milestone in computational intelligence, introducing novel paradigms for information processing, complexity modeling, and scientific advancement. This survey provides a comprehensive overview of the emerging interdisciplinary field that integrates quantum mechanics with natural language processing. We begin by presenting the foundational principles of quantum computing and LLMs, then examine their integration through automated quantum code generation, hybrid transformer architectures, and quantum natural language processing (QNLP) frameworks. State-of-the-art models, such as quantum-augmented attention mechanisms and circuit embedding strategies, are evaluated across domain-specific datasets and benchmarks. We also investigate the role of LLMs as quantum research assistants, educational tools, and simulation agents, particularly in resource-constrained environments. Furthermore, the survey explores challenges related to scalability, interpretability, and quantum data encoding, and outlines future research directions-especially the vision for fully quantum-native LLMs. Our goal is to guide researchers through the current landscape and to encourage continued exploration at the intersection of quantum technologies and advanced language models.
The rapid evolution of Large Language Models (LLMs) has transformed natural language processing, enabling sophisticated applications across various sectors. However, the substantial computational demands associated with training and deploying LLMs result in significant energy consumption and carbon emissions. This study introduces an optimized hybrid quantum-classical framework that integrates variational quantum algorithms (VQAs) with accelerated classical learning techniques. By harnessing quantum computing for complex non-linear optimization and employing prompt learning to minimize full model retraining, the proposed approach enhances both computational efficiency and sustainability. Simulation outcomes indicate that the hybrid method can reduce energy usage by up to 30% and shorten computation time by 25% relative to conventional classical approaches, without diminishing model accuracy. These improvements are substantiated through quantitative analysis and visualized energy metrics. The adaptability of the framework supports its application in diverse areas, including sustainable energy management, supply chain optimization, and environmentally conscious transportation systems. Nevertheless, the broader implementation of such hybrid solutions remains constrained by current quantum hardware capabilities and integration challenges with classical infrastructure. The findings underscore the potential of hybrid quantum-classical optimization as a pathway toward sustainable AI development. Future research should prioritize advancements in quantum hardware reliability and interdisciplinary collaboration to accelerate practical adoption, thereby supporting global efforts in energy efficiency and environmental responsibility.