Real-world QUBO formulations frequently involve multiple heterogeneous objectives and constraints, where the relative scaling between objectives and penalty terms critically affects solution feasibility and quality. In practice, these scaling parameters are highly problem-dependent and may even change over time due to varying operating conditions, making manual tuning impractical and non-scalable.
The proposed methodology addresses this challenge by introducing a data-driven and systematic approach to estimate objective scaling factors based on the structure of the feasible solution space. By decoupling constraint satisfaction and objective evaluation, the method enables robust normalization of objectives without requiring prior domain-specific parameter tuning. This significantly reduces the barrier to applying QUBO-based optimization in large-scale, real-world systems.
Importantly, the approach is inherently scalable and compatible with a wide range of Ising-based solvers, including quantum annealers, quantum-inspired hardware, and GPU-based simulators. Furthermore, because the formulation remains within the QUBO/Ising framework, it can be naturally extended to gate-based quantum algorithms such as QAOA, supporting hybrid quantum-classical workflows.
This flexibility makes the method particularly suitable for dynamic optimization scenarios such as energy systems, logistics, and manufacturing, where problem structures evolve over time and robust, automated scaling is essential for sustained operational performance.