In highly competitive markets, optimal price setting is a key strategic lever, particularly when item demand is elastic and interrelated. Small changes in the price of one item can significantly influence the demand for others through cross-elasticities, making the search for profit-maximizing price combinations a computationally challenging NP-hard problem. This paper proposes a hybrid quantum–classical approach to address large-scale price optimization under elastic demand with cross-item dependencies. The method combines quantum annealing, executed on D-Wave’s adiabatic quantum computing platform, with classical graph-based clustering to partition the problem into smaller subproblems compatible with current quantum hardware constraints. Each subproblem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model that maximizes total profit while enforcing pricing constraints and incorporating cross-elasticity effects. The system was validated on synthetic datasets simulating item catalogs of up to 2,500 items, with varying price ranges, profit margins, and elasticity densities. Results show that the hybrid solver can deliver high-quality solutions in operationally reasonable times, outperforming pure quantum execution and achieving a substantially more favorable scalability–efficiency trade-off than classical approaches such as exhaustive search and simulated annealing. The proposed framework demonstrates the feasibility of applying quantum annealing to real-world decision-support problems in the near term, even under the technological limitations of current quantum devices. This work anticipates future enhancements in quantum hardware and provides a foundation for integrating quantum optimization into dynamic pricing strategies, allowing organizations to periodically and adaptively recalculate prices as demand patterns and market conditions evolve in commerce and e-commerce environments.
In highly competitive markets, optimal price setting is a key strategic lever, particularly when item demand is elastic and interrelated. Small changes in the price of one item can significantly influence the demand for others through cross-elasticities, making the search for profit-maximizing price combinations a computationally challenging NP-hard problem. This paper proposes a hybrid quantum–classical approach to address large-scale price optimization under elastic demand with cross-item dependencies. The method combines quantum annealing, executed on D-Wave’s adiabatic quantum computing platform, with classical graph-based clustering to partition the problem into smaller subproblems compatible with current quantum hardware constraints. Each subproblem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model that maximizes total profit while enforcing pricing constraints and incorporating cross-elasticity effects. The system was validated on synthetic datasets simulating item catalogs of up to 2,500 items, with varying price ranges, profit margins, and elasticity densities. Results show that the hybrid solver can deliver high-quality solutions in operationally reasonable times, outperforming pure quantum execution and achieving a substantially more favorable scalability–efficiency trade-off than classical approaches such as exhaustive search and simulated annealing. The proposed framework demonstrates the feasibility of applying quantum annealing to real-world decision-support problems in the near term, even under the technological limitations of current quantum devices. This work anticipates future enhancements in quantum hardware and provides a foundation for integrating quantum optimization into dynamic pricing strategies, allowing organizations to periodically and adaptively recalculate prices as demand patterns and market conditions evolve in commerce and e-commerce environments.
Quantum computing offers transformative potential for addressing complex combinatorial optimization challenges in logistics and supply chain management. This paper presents a comprehensive investigation of quantum annealing and hybrid quantum-classical algorithms applied to unit load device (ULD) configuration and disruption management in air cargo and multimodal logistics networks. We formulate the ULD loading and placement problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that incorporates weight, volume, center-of-gravity, structural stress, and compatibility constraints. A stratified hybrid architecture spanning physical quantum hardware, algorithmic middleware, and decision-support layers is proposed. Through extensive numerical experiments and comparison with classical solvers, we demonstrate superior payload utilization (up to 96.5%), favorable computational scaling, and rapid disruption recovery. Real-world industry pilots, including quantum-assisted route optimization achieving substantial carbon emission reductions and hybrid solutions at major ports, are analyzed. Results indicate that while noisy intermediate-scale quantum (NISQ) hardware limitations persist, hybrid approaches already deliver measurable gains in operational efficiency, cost reduction, and supply-chain resilience. The work provides a practical roadmap for near-term adoption of quantum technologies in high-stakes logistics environments. Keywords— Quantum annealing, Unit load device (ULD), QUBO, Logistics optimization, Disruption management, Hybrid quantum-classical algorithms, Air cargo, Supply chain resilience
Managing inventory in large-scale supply chains necessitates quick, cost-effective decisions that adhere to constraints such as storage limits and variable demand. This paper describes a novel hybrid approach that uses both quantum and classical computers to tackle inventory problems structured as Quadratic Unconstrained Binary Optimization (QUBO). Each choice variable, such as restocking a product, is represented in binary form, with related costs and penalties built into the objective function. Business constraints are communicated indirectly using adjustable weights, allowing the model to remain unconstrained while discouraging unrealistic conclusions. Optimization is carried out using both classical methods like simulated annealing and quantum solvers such as D-Wave and QAOA, where a hybrid strategy selects the most viable solution. The results indicate that the hybrid system consistently produces lower total costs and better constraint compliance compared to individual solvers, especially for complex, high-dimensional datasets. To ensure secure, automated execution of these optimized decisions, a blockchain layer is introduced. Inventory actions—such as placing orders or updating stock—are carried out through smart contracts that provide tamper-proof, verifiable enforcement. By employing a lightweight Proof of Authority (PoA) mechanism, transaction validation remains fast while maintaining transparency across all nodes in the network. This integration of quantum optimization with blockchain automation enables a responsive and trustworthy framework for modern inventory management.
Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.
The optimization of multidrug cancer treatment schedules is a high-dimensional combinatorial optimization problem involving nonlinear tumor dynamics, pharmacokinetic interactions, and stringent toxicity constraints. When exploring large therapeutic search spaces, conventional optimization algorithms often exhibit limited scalability and become trapped in local optima. This simulation study proposes a hybrid quantum-classical optimization framework that employs QA to generate adaptive treatment schedules for precision oncology. The treatment scheduling problem is formulated as a quadratic unconstrained binary optimization (QUBO) model, which encodes drug combinations, dosing intervals, toxicity constraints, and synergistic interactions within an Ising Hamiltonian compatible with D-Wave quantum annealing hardware. Global combinatorial optimization is performed using a D-Wave Advantage quantum annealer, while sequential least squares programming refines continuous dosage parameters under pharmacokinetic and toxicity constraints. Tumor progression is represented using a modified Gompertz growth model coupled with first-order pharmacokinetic dynamics. The proposed framework was evaluated using synthetic Digital Twin datasets generated from clinically realistic pharmacokinetic and tumor growth parameters. Simulation results demonstrated a maximum tumor regression ratio of 0.98 ± 0.02, compared with 0.82 ± 0.05 for standard-of-care protocols, while maintaining a lower cumulative toxicity index (40 ± 5 versus 75 ± 8) and reducing optimization time to less than 2 s for 120-variable scheduling problems. The hybrid framework exhibited near-linear computational scalability and maintained robustness under stochastic dosage perturbations (TRR > 0.95 at σ = 0.25). However, predictive classification performance remained limited (AUC = 0.49), highlighting the need for validation using longitudinal clinical datasets and multimodal patient-specific data. These findings demonstrate the potential of hybrid quantum-classical optimization as a scalable computational framework for adaptive treatment scheduling and personalized precision oncology.
The rapidly increasing number of heterogeneous data ecosystems, such as structured databases, semi-structured data lakes, real-time streams, distributed knowledge graphs, has further complicated the issue of query planning and optimization in modern information systems extensively. The optimization of queries is essentially an NP-hard combinatorial problem especially when based on multi-join queries, distributed execution plan, dynamic cost model, and uncertainty in the data access patterns. Even decades of concept and engineering advances, classical database optimizers are rapidly becoming unable to offer a globally optimal execution plan when faced with high-dimensional data, high data volatility, with a very tight latency constraint. Good news Recent breakthroughs in quantum computing propose promising computational paradigms that can be used to solve combinatorial optimization problems via quantum parallelism, superposition, and entanglement. Nevertheless, even the near-term quantum hardware is limited in the number of available qubits, noise, and decoherence, making it impractical to achieve fully quantum database systems in any perceived future. This is also the reason why quantum-classical hybrid algorithms are being developed: designed to add quantum optimization subroutines to classical database architectures is guaranteed without breaking their compatibility with existing execution engines. The following paper presents a framework of scalable quantum-classical hybrid computing of complex query planning in heterogeneous data ecosystems. The framework breaks down query optimization into classical and quantum-amenable optimization, which allows NP-hard subproblems, such as join ordering, operator placement, and cost minimization, to be transformed into quantum optimization models such as Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonians. Classical elements handle query parsing, semantic analysis, constraint verification, and orchestration, whereas quantum processors are called selectively to solve combinatorial decision-making tasks. The suggested architecture will consist of a layered execution, hybrid execution, cost-model encoding approach, and adaptive fallback mechanisms to make them robust to quantum hardware variability. This has been experimentally tested with simulated quantum annealing and variational quantum algorithms that exhibit a quantifiable improvement in the quality and scalability of optimization and heuristics based on entirely classical algorithms, especially in high-dimensional query plans. The findings confirm the practicability of quantum query optimization and put down a feasible route to implement quantum algorithms in the serving machine of the next-generation data management systems.
Quantum computing, leveraging principles such as superposition and entanglement, has shown remarkable potential in solving complex optimization problems. Quantum annealing (QA) is particularly effective for combinatorial optimization and has gained increasing attention in financial applications. However, financial decision-making problems typically involve conflicting objectives, such as the trade-off between minimizing risk and maximizing returns, posing challenges for current QA approaches in efficiently encoding multi-objective problems and constraints. To address this gap, we propose the first quantum annealing framework for bi-objective weighted portfolio optimization based on the trend ratio model, integrating D-Wave's latest constrained quadratic model (CQM) hybrid solver. Our approach offers flexibility to accommodate diverse investor preferences. Experimental evaluations using real-world U.S. stock market data demonstrate the effectiveness of our method, showing higher-quality solutions and faster runtimes compared to classical multi-objective optimization algorithms. These promising results highlight the significant potential of quantum computing in practical financial optimization scenarios.