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

International Journal of Applied Pharmaceutics

Evaluation of Quantum Optimization Algorithms within a Quality by Design Framework for Multi-Objective Pharmaceutical Tablet Formulation and Development

Sakshi C. Wankhede, Anil Meghrajji Pethe

Published Sep 7, 2026• 0 citations
Publisher

Abstract

Objective: This study evaluated quantum optimization algorithms-specifically the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA)-as optimization tools within a Quality by Design (QbD) framework for pharmaceutical tablet formulation, benchmarking them against established classical optimizers: Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Bayesian optimization. Methods: Thirty-six metformin hydrochloride tablet formulations were prepared using a central composite design with three independent variables. QbD employed response surface methodology (RSM) to build predictive models for five critical quality attributes (CQAs). These RSM surrogate models then served as the shared objective function for all optimizers: VQE and QAOA (IBM Qiskit simulators), NSGA-II, and Bayesian optimization with expected hypervolume improvement (qEHVI). Optimization quality was assessed using experimental desirability scores from verification batches, prediction error at optimizer-selected points, root mean square error (RMSE), coefficient of determination (R²), paired t-tests, and Bland–Altman analysis. Results: RSM models showed excellent fit (adjusted R²: 0.9412–0.9847). QbD desirability function achieved 0.871, VQE 0.884, NSGA-II 0.879, and Bayesian optimization 0.876, with no statistically significant differences among optimizers (p>0.05). QbD demonstrated superior predictive precision for individual CQAs. Evaluation-budget-normalized analysis showed quantum methods required substantially more function evaluations than classical optimizers, indicating no practical quantum advantage at this problem dimensionality. Conclusion: Quantum optimization showed no measurable advantage over classical methods for this three-variable problem. QbD remains the standard for regulatory-compliant pharmaceutical development. The principal contribution is a hybrid QbD-quantum framework where quantum algorithms serve as optimization tools within a QbD-defined design space.

DOI
10.22159/ijap.2026v18i5.58839

Related papers

Practical Utility of Hybrid Quantum-Classical Machine Learning: A Rigorous Benchmarking of VQE and QAOA on NISQ-Era Simulators

Shahriar Ahsan Taisiq, Tahera Shafina Toma

Abstract The emergence of noisy intermediate-scale quantum (NISQ) devices has fueled the development of hybrid quantum-classical algorithms for machine learning (ML), promising potential advantages over classical methods. However, the practical efficacy of these algorithms remains uncertain due to challenges like noise susceptibility, trainability issues, and a lack of rigorous benchmarking. This study presents a comprehensive empirical evaluation of two flagship hybrid algorithms the Variational Quantum Eigensolver (VQE) for classification and the Quantum Approximate Optimization Algorithm (QAOA) for combinatorial optimization against state-of-the-art classical baselines under equivalent resource constraints. Through extensive simulations incorporating realistic noise models, we demonstrate that while these quantum approaches achieve competitive performance (e.g., 91.2% accuracy for VQE on a binary classification task), they consistently underperformed optimized classical models like Support Vector Machines (94.8% accuracy) and require orders of magnitude more computational time. Furthermore, we provide empirical validation of critical barriers to scalability, including the barren plateau phenomenon and significant performance degradation under noise, even with advanced error mitigation. Our results indicate that for the tasks studied, current NISQ era algorithms do not yet provide a tangible quantum advantage. This work contributes a rigorous benchmarking framework and a critical, realistic assessment of the field, suggesting that future progress hinges on fundamental algorithmic innovations and hardware improvements rather than incremental refinements of existing paradigms.

•Apr 9, 2026•0 citations

Hybrid Classical-Quantum Algorithms for Optimization: A Multi-SDK Framework

Murali Krishna Pasupuleti

Abstract: This paper explores hybrid quantum-classical optimization algorithms implemented across multiple quantum software development kits (SDKs): Qiskit and Cirq,. We evaluate the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) in terms of convergence rate, final cost value, and fidelity, using both simulators and real quantum hardware backends. Our results offer comparative insights into SDK performance and propose a standardized benchmarking approach for future quantum algorithm research. Keywords: Hybrid Quantum Algorithms, Qiskit, Cirq, VQE, QAOA, Quantum SDKs, Quantum Optimization, NISQ

International Journal of Academic and Industrial Research Innovations(IJAIRI)•May 20, 2025•0 citations

Analytical Dimensions and Performance Evaluation of the Quantum Approximate Optimization Algorithm

Blas Trigueros, Pedro Juan Roig, Salvador Alcaraz +1 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most extensively studied variational approaches for tackling combinatorial optimization problems on near-term quantum devices. An extensive body of literature has examined the algorithm from multiple perspectives, including ansatz design, parameter optimization, computational resource requirements, solution quality, and noise effects.This paper adopts these principal analytical dimensions as a structured framework and revisits them from a performance-assessment perspective. By synthesizing representative theoretical, numerical, and experimental contributions, the discussion highlights recurring tendencies in reported results, particularly regarding approximation behavior, depth–noise trade-offs, optimization stability, and resource accounting.The analysis indicates that QAOA performance must be interpreted through a multidimensional lens that jointly considers solution quality, classical and quantum resource costs, optimization dynamics, and hardware constraints. By organizing existing results along common evaluation axes, this work provides a coherent basis for interpreting benchmarking outcomes and for guiding future assessment methodologies in realistic computational settings.

International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE)•Apr 18, 2026•0 citations

Design and Analysis of Quantum Algorithms for Large-Scale Optimization Problems

Laura Bianchi

Large-scale combinatorial and continuous optimisation problems remain intractable for classical algorithms as problem dimensionality scales. Quantum computing offers advantages through parallelism, amplitude amplification, and tunnelling, but practical realisation on near-term noisy intermediate-scale quantum (NISQ) devices demands careful algorithm design balancing advantage against noise resilience and circuit depth constraints. This paper presents the Quantum Optimisation Algorithm Suite (QOAS), a systematic framework across four algorithmic paradigms: Adaptive QAOA with dynamic depth scheduling; Variational Quantum Eigensolver (VQE) for QUBO problems; hybrid Quantum Annealing (QA); and Grover-enhanced Branch and Bound (GBB) for constrained integer programming. QOAS is benchmarked on five problem classes (MaxCut, TSP, Portfolio, Drug-Target, Feature Selection) across n = 12-84 qubits on IBM Quantum Eagle (127-qubit) and Falcon (27-qubit). Adaptive QAOA achieves approximation ratio 0.924 (SD = 0.018) for MaxCut at n = 48 -- outperforming standard QAOA (0.848) and Goemans-Williamson (0.878) at equivalent wall-clock time. GBB achieves 28.4x speedup over classical branch-and-bound for the n = 24 drug-target problem. QOAS provides systematic methodology for algorithm selection, circuit depth optimisation, and noise mitigation for NISQ workloads.

Quantum Frontiers Journal•Mar 28, 2024•0 citations

Quantum Optimization in Multi-Objective Design of Renewable Energy Conversion Systems

Abdullah Genc

The design and operation of renewable energy conversion systems—such as wind turbines, solar photovoltaic arrays, and hybrid storage networks—require balancing multiple, often conflicting objectives, including energy efficiency, cost minimization, environmental impact, and system reliability. Traditional optimization techniques, while effective for isolated parameters, struggle with the combinatorial complexity and nonlinear interdependencies inherent to integrated energy systems. This study explores the application of quantum optimization algorithms in multi-objective renewable energy design, emphasizing how quantum annealing, Quantum Approximate Optimization Algorithm (QAOA), and Variational Quantum Eigensolver (VQE) frameworks can accelerate solution discovery and improve design precision. By leveraging the principles of superposition and entanglement, quantum systems can process vast design spaces in parallel, enabling the rapid evaluation of trade-offs among competing objectives. A hybrid quantum–classical workflow is proposed to integrate quantum solvers into existing computational pipelines for system simulation, control optimization, and energy forecasting. Preliminary modeling results and conceptual simulations indicate that quantum-enhanced optimization not only reduces computation time but also achieves higher Pareto-optimal efficiency compared to conventional multi-objective genetic algorithms and particle swarm optimizers. This interdisciplinary approach demonstrates the transformative potential of quantum computation in sustainable energy system design, supporting the global transition toward carbon neutrality and energy equity. By embedding quantum optimization into renewable infrastructure development, the study provides a foundation for next-generation decision-making frameworks that harmonize performance, sustainability, and scalability.

Human computer interaction.•Nov 12, 2025•0 citations

Accelerating Drug Development: The Role of Quantum Computing in Pharmaceutical Research

Minakshi Kommoju, Kanaka Durga Devi Nelluri, Vijaya Lakshmi Marella +6 more

The journey to develop drugs is long, time-consuming, and costly.Most drugs take years and billions of dollars before they hit the market.Traditional computations remain useful but have inadequacies to accurately reproduce molecular interactions and predict drug efficacy.Quantum computing represents a new tool to potentially revolutionize the challenges brought about by traditional computations in that it can more quickly and accurately solve several of these problems through applying the principles of quantum mechanics.This review examines the possibility of quantum computing to transform pharmaceutical research and drug development.The aim of this review is to give the reader an all-round perspective on the use of quantum computing in drug discovery, with its contributions to molecular modeling, drug-target interaction prediction, and pharmacological property optimization.It promises something new in the application of quantum algorithms to make up for the faults of classical methods used in pharmaceutical research.This review critically synthesizes a number of relevant studies that applied quantum computing capabilities to drug design.Particular attention is brought to quantum algorithms, including but not limited to VQE (Variational Quantum Eigensolver) and QAOA (Quantum Approximate Optimization Algorithm), in determining molecular structures in silico along with the capacity to predict chemical binding affinities.Secondly, the scope of the drugs-discovery application on the various platforms such as IBM Q versus Google Sycamore were compared with current classical computational approach.The quantum computer showed a lot of promise in the simulation of complicated molecular interactions faster than the classical counterparts.A lot of studies emphasize the accuracy quantum simulations have towards the prediction of drug-target binding mechanisms, and this makes the lead optimization process more efficient.However, with scalability and hardware issues, its application in the pharmaceutical research community is still yet to be wide-scale.Quantum computing promises to accelerate the drug development process by improving the speed and accuracy of molecular modeling and drug optimization.Although the field is still in its infancy, its integration into pharmaceutical research could lead to significant reductions in development time and cost.This review underlines the transformative potential of quantum computing and suggests future research directions for overcoming the current limitations and realizing its full potential in precision medicine.

Advances in health sciences research/Advances in Health Sciences Research•Jan 1, 2025•0 citations
Objective: This study evaluated quantum optimization algorithms-specifically the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA)-as optimization tools within a Quality by Design (QbD) framework for pharmaceutical tablet formulation, benchmarking them against established classical optimizers: Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Bayesian optimization. Methods: Thirty-six metformin hydrochloride tablet formulations were prepared using a central composite design with three independent variables. QbD employed response surface methodology (RSM) to build predictive models for five critical quality attributes (CQAs). These RSM surrogate models then served as the shared objective function for all optimizers: VQE and QAOA (IBM Qiskit simulators), NSGA-II, and Bayesian optimization with expected hypervolume improvement (qEHVI). Optimization quality was assessed using experimental desirability scores from verification batches, prediction error at optimizer-selected points, root mean square error (RMSE), coefficient of determination (R²), paired t-tests, and Bland–Altman analysis. Results: RSM models showed excellent fit (adjusted R²: 0.9412–0.9847). QbD desirability function achieved 0.871, VQE 0.884, NSGA-II 0.879, and Bayesian optimization 0.876, with no statistically significant differences among optimizers (p>0.05). QbD demonstrated superior predictive precision for individual CQAs. Evaluation-budget-normalized analysis showed quantum methods required substantially more function evaluations than classical optimizers, indicating no practical quantum advantage at this problem dimensionality. Conclusion: Quantum optimization showed no measurable advantage over classical methods for this three-variable problem. QbD remains the standard for regulatory-compliant pharmaceutical development. The principal contribution is a hybrid QbD-quantum framework where quantum algorithms serve as optimization tools within a QbD-defined design space.
Abstract The emergence of noisy intermediate-scale quantum (NISQ) devices has fueled the development of hybrid quantum-classical algorithms for machine learning (ML), promising potential advantages over classical methods. However, the practical efficacy of these algorithms remains uncertain due to challenges like noise susceptibility, trainability issues, and a lack of rigorous benchmarking. This study presents a comprehensive empirical evaluation of two flagship hybrid algorithms the Variational Quantum Eigensolver (VQE) for classification and the Quantum Approximate Optimization Algorithm (QAOA) for combinatorial optimization against state-of-the-art classical baselines under equivalent resource constraints. Through extensive simulations incorporating realistic noise models, we demonstrate that while these quantum approaches achieve competitive performance (e.g., 91.2% accuracy for VQE on a binary classification task), they consistently underperformed optimized classical models like Support Vector Machines (94.8% accuracy) and require orders of magnitude more computational time. Furthermore, we provide empirical validation of critical barriers to scalability, including the barren plateau phenomenon and significant performance degradation under noise, even with advanced error mitigation. Our results indicate that for the tasks studied, current NISQ era algorithms do not yet provide a tangible quantum advantage. This work contributes a rigorous benchmarking framework and a critical, realistic assessment of the field, suggesting that future progress hinges on fundamental algorithmic innovations and hardware improvements rather than incremental refinements of existing paradigms.
Abstract: This paper explores hybrid quantum-classical optimization algorithms implemented across multiple quantum software development kits (SDKs): Qiskit and Cirq,. We evaluate the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) in terms of convergence rate, final cost value, and fidelity, using both simulators and real quantum hardware backends. Our results offer comparative insights into SDK performance and propose a standardized benchmarking approach for future quantum algorithm research. Keywords: Hybrid Quantum Algorithms, Qiskit, Cirq, VQE, QAOA, Quantum SDKs, Quantum Optimization, NISQ
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most extensively studied variational approaches for tackling combinatorial optimization problems on near-term quantum devices. An extensive body of literature has examined the algorithm from multiple perspectives, including ansatz design, parameter optimization, computational resource requirements, solution quality, and noise effects.This paper adopts these principal analytical dimensions as a structured framework and revisits them from a performance-assessment perspective. By synthesizing representative theoretical, numerical, and experimental contributions, the discussion highlights recurring tendencies in reported results, particularly regarding approximation behavior, depth–noise trade-offs, optimization stability, and resource accounting.The analysis indicates that QAOA performance must be interpreted through a multidimensional lens that jointly considers solution quality, classical and quantum resource costs, optimization dynamics, and hardware constraints. By organizing existing results along common evaluation axes, this work provides a coherent basis for interpreting benchmarking outcomes and for guiding future assessment methodologies in realistic computational settings.
Large-scale combinatorial and continuous optimisation problems remain intractable for classical algorithms as problem dimensionality scales. Quantum computing offers advantages through parallelism, amplitude amplification, and tunnelling, but practical realisation on near-term noisy intermediate-scale quantum (NISQ) devices demands careful algorithm design balancing advantage against noise resilience and circuit depth constraints. This paper presents the Quantum Optimisation Algorithm Suite (QOAS), a systematic framework across four algorithmic paradigms: Adaptive QAOA with dynamic depth scheduling; Variational Quantum Eigensolver (VQE) for QUBO problems; hybrid Quantum Annealing (QA); and Grover-enhanced Branch and Bound (GBB) for constrained integer programming. QOAS is benchmarked on five problem classes (MaxCut, TSP, Portfolio, Drug-Target, Feature Selection) across n = 12-84 qubits on IBM Quantum Eagle (127-qubit) and Falcon (27-qubit). Adaptive QAOA achieves approximation ratio 0.924 (SD = 0.018) for MaxCut at n = 48 -- outperforming standard QAOA (0.848) and Goemans-Williamson (0.878) at equivalent wall-clock time. GBB achieves 28.4x speedup over classical branch-and-bound for the n = 24 drug-target problem. QOAS provides systematic methodology for algorithm selection, circuit depth optimisation, and noise mitigation for NISQ workloads.
The design and operation of renewable energy conversion systems—such as wind turbines, solar photovoltaic arrays, and hybrid storage networks—require balancing multiple, often conflicting objectives, including energy efficiency, cost minimization, environmental impact, and system reliability. Traditional optimization techniques, while effective for isolated parameters, struggle with the combinatorial complexity and nonlinear interdependencies inherent to integrated energy systems. This study explores the application of quantum optimization algorithms in multi-objective renewable energy design, emphasizing how quantum annealing, Quantum Approximate Optimization Algorithm (QAOA), and Variational Quantum Eigensolver (VQE) frameworks can accelerate solution discovery and improve design precision. By leveraging the principles of superposition and entanglement, quantum systems can process vast design spaces in parallel, enabling the rapid evaluation of trade-offs among competing objectives. A hybrid quantum–classical workflow is proposed to integrate quantum solvers into existing computational pipelines for system simulation, control optimization, and energy forecasting. Preliminary modeling results and conceptual simulations indicate that quantum-enhanced optimization not only reduces computation time but also achieves higher Pareto-optimal efficiency compared to conventional multi-objective genetic algorithms and particle swarm optimizers. This interdisciplinary approach demonstrates the transformative potential of quantum computation in sustainable energy system design, supporting the global transition toward carbon neutrality and energy equity. By embedding quantum optimization into renewable infrastructure development, the study provides a foundation for next-generation decision-making frameworks that harmonize performance, sustainability, and scalability.
The journey to develop drugs is long, time-consuming, and costly.Most drugs take years and billions of dollars before they hit the market.Traditional computations remain useful but have inadequacies to accurately reproduce molecular interactions and predict drug efficacy.Quantum computing represents a new tool to potentially revolutionize the challenges brought about by traditional computations in that it can more quickly and accurately solve several of these problems through applying the principles of quantum mechanics.This review examines the possibility of quantum computing to transform pharmaceutical research and drug development.The aim of this review is to give the reader an all-round perspective on the use of quantum computing in drug discovery, with its contributions to molecular modeling, drug-target interaction prediction, and pharmacological property optimization.It promises something new in the application of quantum algorithms to make up for the faults of classical methods used in pharmaceutical research.This review critically synthesizes a number of relevant studies that applied quantum computing capabilities to drug design.Particular attention is brought to quantum algorithms, including but not limited to VQE (Variational Quantum Eigensolver) and QAOA (Quantum Approximate Optimization Algorithm), in determining molecular structures in silico along with the capacity to predict chemical binding affinities.Secondly, the scope of the drugs-discovery application on the various platforms such as IBM Q versus Google Sycamore were compared with current classical computational approach.The quantum computer showed a lot of promise in the simulation of complicated molecular interactions faster than the classical counterparts.A lot of studies emphasize the accuracy quantum simulations have towards the prediction of drug-target binding mechanisms, and this makes the lead optimization process more efficient.However, with scalability and hardware issues, its application in the pharmaceutical research community is still yet to be wide-scale.Quantum computing promises to accelerate the drug development process by improving the speed and accuracy of molecular modeling and drug optimization.Although the field is still in its infancy, its integration into pharmaceutical research could lead to significant reductions in development time and cost.This review underlines the transformative potential of quantum computing and suggests future research directions for overcoming the current limitations and realizing its full potential in precision medicine.