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

Discover Computing

Feasibility-aware warm-initialized QAOA for constrained cloud–fog task scheduling under NISQ-oriented noise

Suresh Kumar Jha, Niroj Kumar Pani, Siddhanta Kumar Singh, Ketan Anand

Published Nov 11, 2026• 0 citations
Publisher

Abstract

Constrained task scheduling in cloud–fog environments is challenging because heterogeneous resources, latency and energy requirements, and capacity constraints create a combinatorial optimization problem in which QAOA may generate infeasible schedules. This paper proposes a feasibility-aware hybrid quantum–classical framework combining Warm-Initialized QAOA with constraint-aware decoding and joint CP-SAT repair under noisy intermediate-scale quantum (NISQ)-oriented conditions. The scheduling problem is formulated as a quadratic unconstrained binary optimization (QUBO) model that jointly captures latency–energy optimization, deadlines, and resource capacities. The framework is evaluated on 12 structured benchmark instances spanning balanced, capacity-tight, deadline-tight, and heterogeneous regimes, with executable QUBOs containing 20–22 logical qubits. Across 96 production configurations under ideal, low, medium, and high noise conditions, 91 configurations ( $$94.79\%$$ ) produced at least one schedule-feasible sampled candidate before repair; this configuration-level success rate is distinct from the shot-level schedule-feasible probability. The joint CP-SAT repair stage successfully restored feasibility in all five configurations for which no feasible sampled candidate was available, yielding $$100\%$$ post-repair feasibility and reducing the mean constraint-violation count from $$0.09375$$ to $$0$$ . For the 91 configurations with a feasible pre-repair selected candidate, the paired mean optimality gap remained unchanged at $$10.60\%$$ after repair, whereas the post-repair mean over all 96 configurations was $$10.79\%$$ because the five repaired cases entered the post-repair denominator. Matched attribution controls further show that the schedule-feasible probability increases from $$0.44\%$$ for uniform initialization at $$p=0$$ to $$29.86\%$$ for warm initialization at $$p=0$$ and $$30.52\%$$ for Warm-Initialized QAOA at $$p=1$$ , indicating that the dominant feasible-region concentration arises from warm initialization, with a smaller incremental contribution from the shallow QAOA evolution. Additional sensitivity, classical-reference, and GPU scalability experiments characterize parameter dependence, classical competitiveness, runtime, and sampling behavior within the investigated NISQ-oriented simulation regime.

DOI
10.1007/s10791-026-10644-6

Related papers

Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers

David Bucher, Maximilian Janetschek, Michael Poppel +3 more

The Quantum Approximate Optimization Algorithm (QAOA) is a leading hybrid heuristic for combinatorial optimization, but efficiently handling hard constraints remains a significant challenge. XY-mixers successfully confine quantum state evolution to a feasible subspace, such as the Hamming-weight-1 sector for one-hot constraints. On the contrary, warm-starting biases the search toward promising regions based on preliminary solutions. Combining these two techniques requires maintaining the essential alignment between the initial state and the mixer Hamiltonian to preserve convergence guarantees. Previous work demonstrated warm-starting with XY-mixers via a biased initial state, but relying only on standard mixer Hamiltonians. Consequently, the initial state is no longer a ground state of the mixer. In this work, we overcome these limitations by formulating a warm-started XY-mixer Hamiltonian for one-hot constraints and proving its ground-state properties. Furthermore, we provide a shallow circuit implementation suitable for NISQ implementations. We embed the warm-starting into a classical heuristic that iteratively updates the bias based on previous samples, called Iterative Warm-Starting (IWS). Extensive numerical simulations on Max-$k$-Cut and Traveling Salesperson Problem instances demonstrate that IWS-QAOA significantly accelerates the solution-finding process, increasing the probability of sampling optimal solutions by orders of magnitude compared to standard XY-QAOA. Finally, we validate our approach on the ibm_boston QPU using hardware-tailored 144-qubit problem instances. By coupling IWS-QAOA with a greedy steepest-descent post-processing strategy to repair infeasible measurements caused by hardware noise, we successfully identify optimal solutions on actual quantum devices.

quant-pharXiv:2604.02083•New Journal of Physics•Apr 3, 2026•12 citations

Resource-aware QAOA for autoclave batch scheduling in composite manufacturing using QUBO decomposition and parameter transfer

Abdulrazak Jinadu Otaru, Obinna Onyebuchi Barah, Ige Bori +2 more

Abstract Industrial quantum computing requires problem decompositions that respect near-term resource limits while preserving operational value. This study presents a hybrid classical-quantum workflow for autoclave batch scheduling in composite manufacturing, in which release-time and cure-family logic remain in a classical orchestration layer and each batch-selection decision is encoded as a quadratic unconstrained binary optimization (QUBO) problem. Candidate pools of 4–10 jobs produce 8–14 logical-qubit QAOA subproblems after capacity-slack encoding. Depth-1 and depth-2 QAOA were evaluated using noiseless statevector simulation, with depth-2 parameters trained on four instances per problem size and transferred without re-optimization to six held-out instances per size. For transferred depth-2 QAOA, decoded feasible probability mass decreased from 0.956 at 8 qubits to 0.427 at 14 qubits, while optimal-subset probability decreased from 0.05283 to 0.00150. Comparison with an exact uniform-sampling null showed no consistent optimal-subset concentration advantage for transferred $$\text{p}=2$$ QAOA, despite exact best-of-4096 recovery across the held-out instances. The estimated sampling budget for a 95% probability of observing the optimum increased from approximately 55 to 2000 shots. In 15 end-to-end synthetic production scenarios containing 24–48 jobs, no statistically significant differences were detected between transferred QAOA and exact per-batch selection or simulated annealing for any reported schedule metric. Relative to greedy selection, transferred QAOA increased mean autoclave utilization by 2.70% points, corresponding to a 3.3% relative increase. This was the only nominally significant paired difference against greedy selection (unadjusted Wilcoxon $$\:p=0.029$$ ); other schedule metrics improved directionally but were not statistically significant. All results were obtained using noiseless statevector simulation and establish neither quantum advantage nor hardware-level speedup, but rather a testable quantum-classical integration pathway defined by decomposition, parameter reuse, sampling burden, and classical fallback.

Scientific Reports•Nov 12, 2026•0 citations

A Fully Quantum Constraint Satisfying Allocation Method for Multi Resource Cloud Scheduling

B. Sreedhar, P Veeresh

Cloud computing resource management is a multi-dimensional optimization problem with numerous constraints that is very complex and difficult to solve by the traditional heuristic and hybrid algorithms due to constraints satisfaction and scalability. In this paper, we present a new approach that we call Quantum Constraint-Satisfying Allocation (QCSA), a completely quantum scheduling approach that incorporates the feasibility properties directly into the quantum state space. In contrast to penalty-based Quantum Approximate Optimization Algorithms (QAOA), QCSA only searches through feasible allocations, thereby avoiding post-repair overhead and decreasing sensitivity to the parameterization of the penalties. The proposed approach takes advantage of the constraint-satisfying quantum walks and multi-objective phase biasing to concentrate the computational probability mass on optimal solutions. We offer formal proof of feasibility invariance, bounds on success probability, and study convergence properties. Empirical tests on both synthetic and trace-based workloads on cloud configurations clearly show that QCSA outperforms classical and quantum baselines with respect to packing efficiency, SLA violations, and energy usage. In addition, QCSA is robust to workload variability, scalable across job sizes, and latency of quantum execution is low, which are valuable properties for future quantum-native cloud scheduling frameworks.

International Journal of Artificial Intelligence and Machine Learning•Jan 1, 2026•0 citations

Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing

Yuan-Zheng Lei, Yaobang Gong, Xianfeng Terry Yang +1 more

The Quantum Approximate Optimization Algorithm (QAOA) is a leading framework for quantum combinatorial optimization. The Vehicle Routing Problem (VRP), a core problem in logistics and transportation, is a natural application target, but it poses a major feasibility challenge for standard QAOA because feasible solutions occupy only a tiny fraction of the search space, and the conventional Pauli-$X$ mixer can disrupt partial solution structures that satisfy key local constraints. To address this issue, we propose a constraint-aware QAOA framework with two complementary components. First, we design a lightweight initialization strategy that encodes a selected subset of simple yet informative local one-hot constraints into the initial state, thereby reducing the initial superposition space and increasing the probability mass on states with important local structure. Second, we introduce a hybrid XY-$X$ mixer that preserves the constraint structure imposed at initialization while retaining exploratory flexibility over the remaining unconstrained degrees of freedom during QAOA evolution. We evaluate the proposed framework against standard QAOA under three progressively more realistic regimes: ideal statevector simulation, finite-shot sampling, and noisy finite-shot sampling. Across all regimes, the proposed method consistently achieves lower average energy and higher feasible-solution ratios than standard QAOA, indicating more effective guidance toward structurally valid, lower-cost VRP solutions. However, the performance gap narrows in the noisy regime. Because this setting adopts a hardware-inspired error model based on near-best-reported laboratory-level qubit gate and readout fidelities, the observed attenuation suggests that the practical advantage of the more structured mixer is likely to grow as quantum hardware improves and error rates decline.

cs.ETCross-listedarXiv:2604.07218•Transportation Research Part C Emerging Technologies•Apr 9, 2026•0 citations

An Empirical Evaluation of Quantum-Inspired QUBO Methods for Heterogeneous HPC Workflow Mapping and Scheduling

Aasish Kumar Sharma, Christian Boehme, Julian Martin Kunkel

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.

arXiv:2605.25350•ISC High Performance (ISC)•Jun 1, 2026•0 citations

Noise-Adaptive QAOA with Standardized Validation for Small-Scale Engineering Job-Shop Scheduling

Sohag Chakma Ud. Chowdhury

Efficient Job-Shop Scheduling (JSS) is still a challenging combinatorial optimisation problem in engineering systems because of machine-capacity constraints, operation precedence requirements and the exponential growth of the search space for the scheduling problem. The Quantum Approximate Optimization Algorithm (QAOA) has been shown to be a promising approach to solving these optimisation problems, however, when using realistic quantum noise models, the scheduling quality and reliability of the solution can be compromised. This work presents a noise-adaptive QAOA framework that automatically scales the number of shots measured, the classical optimiser, and the circuit depth, informed by an estimated quantum-noise level, and adaptively uses different error mitigation strategies. The scheduling problem is then formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem and tested with small-scale engineering benchmark instances, under various simulated noise circumstances. Comparative simulation results show that the proposed adaptive strategy is able to keep the optimality gap low and feasible-solution rate high in every instance, and achieve competitive scheduling performance as compared to a fixed-depth noisy QAOA. The study shows how the adaptive selection of quantum parameters can enhance the robustness of QAOA for small systems of engineering scheduling problems in the presence of noisy quantum devices.

Electronics, Communications, and Computing Summit•Sep 3, 2026•0 citations
Constrained task scheduling in cloud–fog environments is challenging because heterogeneous resources, latency and energy requirements, and capacity constraints create a combinatorial optimization problem in which QAOA may generate infeasible schedules. This paper proposes a feasibility-aware hybrid quantum–classical framework combining Warm-Initialized QAOA with constraint-aware decoding and joint CP-SAT repair under noisy intermediate-scale quantum (NISQ)-oriented conditions. The scheduling problem is formulated as a quadratic unconstrained binary optimization (QUBO) model that jointly captures latency–energy optimization, deadlines, and resource capacities. The framework is evaluated on 12 structured benchmark instances spanning balanced, capacity-tight, deadline-tight, and heterogeneous regimes, with executable QUBOs containing 20–22 logical qubits. Across 96 production configurations under ideal, low, medium, and high noise conditions, 91 configurations ( 94.79%94.79\%94.79% ) produced at least one schedule-feasible sampled candidate before repair; this configuration-level success rate is distinct from the shot-level schedule-feasible probability. The joint CP-SAT repair stage successfully restored feasibility in all five configurations for which no feasible sampled candidate was available, yielding 100%100\%100% post-repair feasibility and reducing the mean constraint-violation count from 0.093750.093750.09375 to 000 . For the 91 configurations with a feasible pre-repair selected candidate, the paired mean optimality gap remained unchanged at 10.60%10.60\%10.60% after repair, whereas the post-repair mean over all 96 configurations was 10.79%10.79\%10.79% because the five repaired cases entered the post-repair denominator. Matched attribution controls further show that the schedule-feasible probability increases from 0.44%0.44\%0.44% for uniform initialization at p=0p=0p=0 to 29.86%29.86\%29.86% for warm initialization at p=0p=0p=0 and 30.52%30.52\%30.52% for Warm-Initialized QAOA at p=1p=1p=1 , indicating that the dominant feasible-region concentration arises from warm initialization, with a smaller incremental contribution from the shallow QAOA evolution. Additional sensitivity, classical-reference, and GPU scalability experiments characterize parameter dependence, classical competitiveness, runtime, and sampling behavior within the investigated NISQ-oriented simulation regime.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading hybrid heuristic for combinatorial optimization, but efficiently handling hard constraints remains a significant challenge. XY-mixers successfully confine quantum state evolution to a feasible subspace, such as the Hamming-weight-1 sector for one-hot constraints. On the contrary, warm-starting biases the search toward promising regions based on preliminary solutions. Combining these two techniques requires maintaining the essential alignment between the initial state and the mixer Hamiltonian to preserve convergence guarantees. Previous work demonstrated warm-starting with XY-mixers via a biased initial state, but relying only on standard mixer Hamiltonians. Consequently, the initial state is no longer a ground state of the mixer. In this work, we overcome these limitations by formulating a warm-started XY-mixer Hamiltonian for one-hot constraints and proving its ground-state properties. Furthermore, we provide a shallow circuit implementation suitable for NISQ implementations. We embed the warm-starting into a classical heuristic that iteratively updates the bias based on previous samples, called Iterative Warm-Starting (IWS). Extensive numerical simulations on Max-kkk-Cut and Traveling Salesperson Problem instances demonstrate that IWS-QAOA significantly accelerates the solution-finding process, increasing the probability of sampling optimal solutions by orders of magnitude compared to standard XY-QAOA. Finally, we validate our approach on the ibm_boston QPU using hardware-tailored 144-qubit problem instances. By coupling IWS-QAOA with a greedy steepest-descent post-processing strategy to repair infeasible measurements caused by hardware noise, we successfully identify optimal solutions on actual quantum devices.
Abstract Industrial quantum computing requires problem decompositions that respect near-term resource limits while preserving operational value. This study presents a hybrid classical-quantum workflow for autoclave batch scheduling in composite manufacturing, in which release-time and cure-family logic remain in a classical orchestration layer and each batch-selection decision is encoded as a quadratic unconstrained binary optimization (QUBO) problem. Candidate pools of 4–10 jobs produce 8–14 logical-qubit QAOA subproblems after capacity-slack encoding. Depth-1 and depth-2 QAOA were evaluated using noiseless statevector simulation, with depth-2 parameters trained on four instances per problem size and transferred without re-optimization to six held-out instances per size. For transferred depth-2 QAOA, decoded feasible probability mass decreased from 0.956 at 8 qubits to 0.427 at 14 qubits, while optimal-subset probability decreased from 0.05283 to 0.00150. Comparison with an exact uniform-sampling null showed no consistent optimal-subset concentration advantage for transferred p=2\text{p}=2p=2 QAOA, despite exact best-of-4096 recovery across the held-out instances. The estimated sampling budget for a 95% probability of observing the optimum increased from approximately 55 to 2000 shots. In 15 end-to-end synthetic production scenarios containing 24–48 jobs, no statistically significant differences were detected between transferred QAOA and exact per-batch selection or simulated annealing for any reported schedule metric. Relative to greedy selection, transferred QAOA increased mean autoclave utilization by 2.70% points, corresponding to a 3.3% relative increase. This was the only nominally significant paired difference against greedy selection (unadjusted Wilcoxon  p=0.029\:p=0.029p=0.029 ); other schedule metrics improved directionally but were not statistically significant. All results were obtained using noiseless statevector simulation and establish neither quantum advantage nor hardware-level speedup, but rather a testable quantum-classical integration pathway defined by decomposition, parameter reuse, sampling burden, and classical fallback.
Cloud computing resource management is a multi-dimensional optimization problem with numerous constraints that is very complex and difficult to solve by the traditional heuristic and hybrid algorithms due to constraints satisfaction and scalability. In this paper, we present a new approach that we call Quantum Constraint-Satisfying Allocation (QCSA), a completely quantum scheduling approach that incorporates the feasibility properties directly into the quantum state space. In contrast to penalty-based Quantum Approximate Optimization Algorithms (QAOA), QCSA only searches through feasible allocations, thereby avoiding post-repair overhead and decreasing sensitivity to the parameterization of the penalties. The proposed approach takes advantage of the constraint-satisfying quantum walks and multi-objective phase biasing to concentrate the computational probability mass on optimal solutions. We offer formal proof of feasibility invariance, bounds on success probability, and study convergence properties. Empirical tests on both synthetic and trace-based workloads on cloud configurations clearly show that QCSA outperforms classical and quantum baselines with respect to packing efficiency, SLA violations, and energy usage. In addition, QCSA is robust to workload variability, scalable across job sizes, and latency of quantum execution is low, which are valuable properties for future quantum-native cloud scheduling frameworks.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading framework for quantum combinatorial optimization. The Vehicle Routing Problem (VRP), a core problem in logistics and transportation, is a natural application target, but it poses a major feasibility challenge for standard QAOA because feasible solutions occupy only a tiny fraction of the search space, and the conventional Pauli-XXX mixer can disrupt partial solution structures that satisfy key local constraints. To address this issue, we propose a constraint-aware QAOA framework with two complementary components. First, we design a lightweight initialization strategy that encodes a selected subset of simple yet informative local one-hot constraints into the initial state, thereby reducing the initial superposition space and increasing the probability mass on states with important local structure. Second, we introduce a hybrid XY-XXX mixer that preserves the constraint structure imposed at initialization while retaining exploratory flexibility over the remaining unconstrained degrees of freedom during QAOA evolution. We evaluate the proposed framework against standard QAOA under three progressively more realistic regimes: ideal statevector simulation, finite-shot sampling, and noisy finite-shot sampling. Across all regimes, the proposed method consistently achieves lower average energy and higher feasible-solution ratios than standard QAOA, indicating more effective guidance toward structurally valid, lower-cost VRP solutions. However, the performance gap narrows in the noisy regime. Because this setting adopts a hardware-inspired error model based on near-best-reported laboratory-level qubit gate and readout fidelities, the observed attenuation suggests that the practical advantage of the more structured mixer is likely to grow as quantum hardware improves and error rates decline.
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.
Efficient Job-Shop Scheduling (JSS) is still a challenging combinatorial optimisation problem in engineering systems because of machine-capacity constraints, operation precedence requirements and the exponential growth of the search space for the scheduling problem. The Quantum Approximate Optimization Algorithm (QAOA) has been shown to be a promising approach to solving these optimisation problems, however, when using realistic quantum noise models, the scheduling quality and reliability of the solution can be compromised. This work presents a noise-adaptive QAOA framework that automatically scales the number of shots measured, the classical optimiser, and the circuit depth, informed by an estimated quantum-noise level, and adaptively uses different error mitigation strategies. The scheduling problem is then formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem and tested with small-scale engineering benchmark instances, under various simulated noise circumstances. Comparative simulation results show that the proposed adaptive strategy is able to keep the optimality gap low and feasible-solution rate high in every instance, and achieve competitive scheduling performance as compared to a fixed-depth noisy QAOA. The study shows how the adaptive selection of quantum parameters can enhance the robustness of QAOA for small systems of engineering scheduling problems in the presence of noisy quantum devices.