Large-scale industrial networks often exhibit scale-free topologies in which a few hub nodes concentrate most computational demand, whereas Noisy Intermediate-Scale Quantum (NISQ)-era resources remain heterogeneous and constrained by limited qubits, noise, connectivity, and cost. This mismatch motivates a topology-aware QUBO-based framework for heterogeneous quantum resource scheduling over scale-free networks. Our proposed model unifies hub importance, workload demand, hardware capacity constraints, and communication overhead within a single objective, thereby enabling feasible and globally optimized allocations. Experiments on synthetic scale-free networks show that, when solved using an optical Ising machine, the proposed method consistently achieves lower objective values than random assignment and classical metaheuristics, with advantages that grow as network size and hub-node count increase. The optical Ising platform also provides substantial runtime reduction, while simulated annealing and tabu search yield competitive solutions with stable convergence. These results demonstrate the scalability and hardware compatibility of the proposed framework for large-scale quantum resource scheduling under NISQ constraints.
Large-scale industrial networks often exhibit scale-free topologies in which a few hub nodes concentrate most computational demand, whereas Noisy Intermediate-Scale Quantum (NISQ)-era resources remain heterogeneous and constrained by limited qubits, noise, connectivity, and cost. This mismatch motivates a topology-aware QUBO-based framework for heterogeneous quantum resource scheduling over scale-free networks. Our proposed model unifies hub importance, workload demand, hardware capacity constraints, and communication overhead within a single objective, thereby enabling feasible and globally optimized allocations. Experiments on synthetic scale-free networks show that, when solved using an optical Ising machine, the proposed method consistently achieves lower objective values than random assignment and classical metaheuristics, with advantages that grow as network size and hub-node count increase. The optical Ising platform also provides substantial runtime reduction, while simulated annealing and tabu search yield competitive solutions with stable convergence. These results demonstrate the scalability and hardware compatibility of the proposed framework for large-scale quantum resource scheduling under NISQ constraints.
ABSTRACT Quantum computing has entered the noisy intermediate‐scale quantum (NISQ) era, where limited qubit numbers, short coherence times, and high error rates pose significant challenges to reliable large‐scale execution. Efficient scheduling and resource allocation across heterogeneous quantum hardware are therefore crucial for maximizing system throughput, fidelity, and fairness. In this work, we propose a hardware‐aware reinforcement learning framework for quantum task scheduling in distributed NISQ systems. Our design explicitly models qubit‐level variability, including connectivity degree, coherence times, error rates, and throughput, while integrating task‐level constraints such as deadlines, priorities, and concurrency requirements. We formulate the scheduling problem as a constrained optimization task and instantiate it as a Markov decision process (MDP), enabling reinforcement learning agents to learn adaptive strategies. Specifically, we implement deep Q‐network (DQN) and proximal policy optimization (PPO) agents, and compare them against heuristic and random baselines. Experimental results demonstrate that PPO consistently outperforms DQN and heuristic methods, achieving higher task completion rates, fewer deadline violations, and more robust adaptation across different reward configurations. This work bridges quantum hardware modeling with reinforcement learning‐based scheduling, providing a practical pathway for resource optimization in distributed quantum computing environments.
Scalable combinatorial optimization under resource-constrained quantum hardware remains a fundamental challenge in the Noisy Intermediate-Scale Quantum (NISQ) era, due to the mismatch between exponentially growing solution spaces and limited quantum computational capacity. In this work, we propose a NISQ-aware hybrid quantum-classical optimization framework that reformulates large-scale combinatorial optimization as a resource-bounded distribution evolution process. Instead of directly optimizing individual solutions, the proposed framework operates on a probabilistic representation of the solution space, enabling efficient exploration under hardware constraints. Specifically, large problem instances are decomposed into qubit-compatible subproblems via clustering-based decomposition, ensuring resource-bounded optimization. Within each subproblem, a quantum genetic algorithm evolves the solution distribution, while periodically embedded amplitude amplification acts as a controlled quantum enhancement mechanism that accelerates convergence without increasing circuit depth. A classical refinement stage ensures global solution consistency. Extensive experiments on benchmark and synthetic datasets demonstrate that the proposed framework consistently outperforms classical and quantum-inspired baselines, with performance gains that become more pronounced as problem scale increases. This scale-dependent behavior indicates that scalability is achieved through structured decomposition rather than increased quantum complexity. Noise simulations further confirm robustness under realistic NISQ conditions, and ablation studies validate that both quantum evolutionary search and amplitude amplification contribute significantly to performance improvements.
Quantum-inspired optimization (QIO) has emerged as a promising paradigm for solving complex combinatorial problems in industrial scheduling. While most existing studies focus on algorithmic developments and classical implementations, recent advances in nanoscale computing, including memristor-based Ising machines, photonic computing systems, and oscillatory neural networks, have created new opportunities for implementing QUBO- and Ising-based optimization through physical hardware dynamics. This survey provides a comprehensive review of QIO techniques for industrial scheduling, with a particular emphasis on their compatibility with emerging nanoscale computing platforms. We first introduce how representative scheduling problems, including job shop, flexible job shop, and resource-constrained scheduling, can be reformulated into quadratic unconstrained binary optimization (QUBO) models. We then categorize QIO methods into annealing- and Ising-based methods, evolutionary and population-based methods, hybrid quantum-classical and decomposition methods, and emerging learning-augmented approaches, and examine their computational characteristics and compatibility with QUBO or Ising hardware. Beyond algorithmic perspectives, this work highlights the potential role of specialized Ising hardware in enabling highly parallel and potentially energy-efficient optimization. We discuss how QUBO and Ising formulations can be mapped to physical energy-minimization processes in nanoscale devices, thereby providing a computational framework that connects classical optimization, quantum-inspired algorithms, and nanoscale hardware systems. Finally, we identify key challenges, including scalability, penalty calibration, and system integration, and outline future research directions toward hybrid quantum-classical computing ecosystems incorporating nanoscale optimization hardware. This survey positions QIO as a promising paradigm for next-generation intelligent manufacturing, in which optimization algorithms and nanoscale hardware are jointly developed to support low-latency and energy-efficient decision-making.
Heterogeneous HPC workflow scheduling under multiple hard constraints poses a challenging combinatorial optimization problem. Classical exact solvers provide optimal solutions but often face scalability limitations, motivating interest in quantum-inspired Quadratic Unconstrained Binary Optimization (QUBO) formulations as alternative optimization paradigms. This work presents a systematic and reproducible empirical evaluation of QUBO-based scheduling methods against established classical baselines, including MILP, CP-SAT, GA, and HEFT. We evaluate three QUBO variants, single-run simulated annealing, multi-attempt annealing, and a layered QAOA-inspired schedule, together with hybrid enhancement strategies on both ground-truth validation workflows (3–4 tasks) and synthetic scaling instances (5–20 tasks). All solvers are assessed through a unified evaluation pipeline that explicitly tracks feasibility, makespan, and resource utilization under progressive constraint activation and controlled penalty sweeps. Results show that all approaches recover the expected optimal makespan on validation instances, confirming formulation correctness. However, feasibility degradation emerges for specific QUBO variants as constraint interactions intensify, particularly when communication costs are introduced. Penalty sensitivity analysis reveals a sharp feasibility threshold for QUBO-SA, where insufficient penalties consistently fail and moderate-to-strong penalties restore feasibility. Scaling experiments delineate the regimes in which classical solvers and heuristics remain robust across all tested sizes, while QUBO-SA loses feasibility beyond 15 tasks and the QAOA-inspired variant beyond 10 tasks. Overall, the study provides a clear empirical characterization of the reliability boundaries of quantum-inspired QUBO formulations for heterogeneous HPC scheduling and identifies the regimes where classical approaches remain preferable under current formulations and solver capabilities.
Abstract The arrival of noisy intermediate-scale quantum (NISQ) devices defines an era in which quantum utility is fundamentally constrained by finite coherence times, limited qubit counts, gate infidelities, restricted connectivity, and measurement noise. Within this regime, hybrid quantum-classical frameworks have emerged as the dominant operational paradigm, particularly for quantum machine learning (QML). This review identifies a fundamental trade-off between expressivity, trainability, and noise resilience that governs the performance and scalability of NISQ-era QML systems. To contextualize these challenges, we introduce the resource-constrained iterative routing framework, a hardware-aware conceptual architecture that integrates topology-aware classical compression and distributed quantum orchestration to maintain circuit depths within device-dependent limits while routing representations toward symmetry-constrained Hilbert subspaces to mitigate noise-induced barren plateaus. Furthermore, we shift the discussion of quantum advantage away from asymptotic fault-tolerant complexity toward the notion of operational NISQ advantage based on finite-resource scaling, trainability preservation, and sampling complexity. We evaluate the practical resource efficiency of variational quantum algorithms, quantum kernel methods, and quantum neural networks across superconducting, trapped-ion, neutral-atom, and photonic platforms. The review also examines reproducibility challenges, emphasizing benchmarking against optimized classical baselines, and discusses strategies for managing the sampling overhead of error mitigation alongside distributed execution and quantum circuit compilation. Ultimately, NISQ in Practice positions hybrid QML as a physically constrained computational paradigm while outlining a pathway from contemporary noisy workflows toward early fault-tolerant quantum architectures.
The development of quantum computing relies heavily on the effective execution of quantum algorithms. However, current Noisy Intermediate-Scale Quantum (NISQ) computers are plagued by limitations such as short coherence times and significant error rates, posing substantial challenges to scheduling and execution. This paper introduces a novel dynamic resource-aware scheduling algorithm designed to mitigate these challenges. The core of the algorithm lies in its ability to adapt to the fluctuating noise levels and coherence times of the quantum hardware, intelligently prioritizing tasks based on their estimated computational cost and error probability. We demonstrate that this adaptive approach significantly improves the potential for successful quantum algorithm execution on NISQ devices, offering a pathway towards more efficient and reliable quantum computation. The algorithm's effectiveness is evaluated through theoretical analysis and conceptual modeling, focusing on the optimization of resource allocation and task prioritization within the constraints of NISQ technology. This research contributes to the growing field of quantum resource management and scheduling, providing a framework for tackling the complexities inherent in operating quantum computers.