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

arXiv:2511.15590 · Future Generation Computer Systems

QTIS: A QAOA-Based Quantum Time Interval Scheduler

José A. Tirado-Domínguez, Eladio Gutiérrez, Oscar Plata

quant-phcs.ETSubmitted Nov 19, 2025• Announced Nov 20, 2025• 1 citation
arXivHTMLPDF

Abstract

Task scheduling with constrained time intervals and limited resources remains a fundamental challenge across domains such as manufacturing, logistics, cloud computing, and healthcare. This study presents a novel variant of the Quantum Approximate Optimization Algorithm (QAOA) designed to address the task scheduling problem formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model. The proposed method, referred to as Quantum Time Interval Scheduler (QTIS), integrates an ancilla-assisted quantum circuit to dynamically detect and penalize overlapping tasks, enhancing the enforcement of scheduling constraints. Two complementary implementations are explored for overlap detection: a quantum approach based on RY rotations and CCNOT gates, and a classical alternative relying on preprocessed interval comparisons. QTIS decomposes the problem Hamiltonian, Hp, into two components, each parameterized by a distinct angle. The first component encodes the objective function, while the second captures penalty terms associated with overlapping intervals, which are controlled by the auxiliary circuit. Subsequently, three minimization strategies are evaluated: standard QAOA, T-QAOA, and HT-QAOA, showing that employing separate parameters for the different components of the problem Hamiltonian leads to lower energy values and improved solution quality. Results confirm the efficiency of QTIS in scheduling tasks with fixed temporal windows while minimizing conflicts, demonstrating its potential to advance hybrid quantum-classical optimization in complex scheduling environments.

DOI
10.1016/j.future.2026.108594
Comments
19 pages, 13 figures

Related papers

Quantum optimization for the Physician Scheduling Problem

Baha Mlaouhi, Chahid Ahabchane, Iyed Benslimen

Scheduling medical staff in healthcare institutions is a complex and critical task that requires balancing operational constraints, personnel availability, quality of care, and staff well-being. These interdependent factors make the creation of optimal schedules particularly challenging necessitating sophisticated approaches that effectively reconcile institutional needs and medical staff expectations. This project explores an innovative alternative approach: quantum optimization. By formulating the scheduling problem as a QUBO (Quadratic Unconstrained Binary Optimization) model, we aim to leverage the capabilities of quantum algorithms, particularly the Quantum Approximate Optimization Algorithm (QAOA) This framework allows constraints and objectives to be reformulated as quadratic functions, facilitating their integration into Ising models and their resolution on quantum gate_based circuit systems.To this end, we implement a hybrid quantum-classical solution using QAOA on IBM’s Qiskit platform. We analyze QAOA’s performance on problem instances of up to 27 qubits, and compare it against classical solvers such as CPLEX. Through this comparative approach, we assess the practical viability of quantum optimization in medical staff scheduling and contribute to the broader investigation of quantum computing in operational planning within healthcare systems.

International Conference on Embedded Systems and Artificial Intelligence (ESAI)•Dec 18, 2025•0 citations

Applying Quantum Approximate Optimization Algorithm to the Oversubscribed Satellite Scheduling Problem

Marco Baioletti, Fabrizio Fagiolo, Angelo Oddi +1 more

This paper explores the application of the quantum approximate optimization algorithm (QAOA) to the oversubscribed satellite scheduling problem (OSSP), a critical challenge in optimizing communication tasks between satellites and ground stations. The OSSP involves assigning tasks within predefined time windows while minimizing conflicts from overlapping assignments, a problem inherently combinatorial in nature. By formulating the OSSP as a quadratic unconstrained binary optimization problem and translating it into a quantum circuit suitable for QAOA, we present an algorithm for the optimization of the QAOA’s parameters as the number of circuit levels [Formula: see text] increases, by retaining the best parameter values found at each iteration. Experimental evaluations on quantum simulators demonstrate the effectiveness of our approach, thus realizing the QAOA’s potential in addressing complex scheduling tasks efficiently and providing insights into its scalability and applicability in real-world satellite operations.

Journal of Aerospace Information Systems•Mar 24, 2026•0 citations

Quantum Knapsack: Optimizing Resource Allocation with QAOA

Mahfouz, Zein, Bhaskaran Potty Thulasi Lakshmi, Sreedevi

Combinatorial Optimization (CO) is one of the most important areas in the field of optimization, with practical applications found in every industry, including both the private and public sectors. In recent years, it was discovered that a mathematical formulation known as QUBO (Quadratic Unconstrained Binary Optimization) problem can embrace an exceptional variety of important CO problems found in the industry. In this work, we explore the Quantum Approximate Optimization Algorithm (QAOA) as a quantum computing approach to solve the Knapsack Problem efficiently by formulating the problem as a QUBO model. Here we implemented QAOA on a quantum emulator, leveraging quantum superposition and entanglement to explore multiple solutions simultaneously. The method offers a promising route for solving large, complex scheduling and resource allocation problems that are tough for classical algorithms, with potential applications in logistics, HPC resource scheduling, and energy optimization.

•Nov 17, 2025•0 citations

Optimizing Distributed Systems With Quantum Computing

Manish Patil, Shraddha Sanjay Mhetre

As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.

International Journal of Advances in Signal and Image Sciences•Sep 25, 2025•0 citations

Quantum-classical hybrid algorithm using quantum annealing for multi-objective job shop scheduling

Kenta Sawamura, Kensuke Araki, Naoki Maruyama +2 more

Efficient production planning is essential in modern manufacturing to improve performance indicators such as lead time and to reduce reliance on human intuition. While mathematical optimization approaches, formulated as job shop scheduling problems, have been applied to automate this process, solving large-scale production planning problems remains computationally demanding. Moreover, many practical scenarios involve conflicting objectives, making traditional scalarization techniques ineffective in finding diverse and useful Pareto-optimal solutions. To address these challenges, we developed a quantum-classical hybrid algorithm that decomposes the problem into two subproblems: resource allocation and task scheduling. Resource allocation is formulated as a quadratic unconstrained binary optimization problem and solved using annealing-based methods that efficiently explore complex solutions. Task scheduling is modeled as a mixed-integer linear programming problem and solved using conventional solvers to satisfy detailed scheduling constraints. We validated the proposed method using benchmark instances based on foundry production scenarios. Experimental results demonstrate that our hybrid approach achieves superior solution quality and computational efficiency compared to traditional monolithic methods. This work offers a promising direction for high-speed, multi-objective scheduling in industrial applications.

quant-pharXiv:2511.03257•Nov 6, 2025•0 citations

Quantum Optimization for Airline Itinerary and Scheduling: A QUBO and QAOA Approach

Vaibhav V. Khedekar

Abstract Airline itinerary and scheduling represent some of the most difficult computational problems that exist in transportation. The problems require choosing the best flight routes while determining schedules and allocating resources through various constraints which include regulatory requirements and maintenance schedules and dynamic demand patterns. The solution of small and medium-scale instances has been achieved through mixed-integer programming and heuristic methods including simulated annealing and genetic algorithms and branch-and-price but these methods become impractical for larger real-world instances due to exponential scaling issues. Quantum computing has introduced fresh solutions which enable the resolution of these problems. Quantum mechanical phenomena particularly superposition and entanglement enable optimization algorithms to examine an exponentially expanded solution space simultaneously. Our research applies a basic airline scheduling problem to the Traveling Salesman Problem (TSP) before converting it into a Quadratic Unconstrained Binary Optimization (QUBO) problem. The Quantum Approximate Optimization Algorithm (QAOA) serves as a hybrid quantum-classical method to solve this formulation. The experimental evaluation of a 4-city scenario shows that quantum-based optimization generates performance levels comparable to traditional methods and indicates that improved quantum hardware development will provide computational benefits for complex airline scheduling problems. This research holds dual importance because it can minimize operational expenses and improve scheduling performance and it establishes fundamental principles for complex combinatorial problem optimization across the transportation industry. The research establishes fundamental principles for quantum-enabled applications that will revolutionize airline operations and other transportation networks by solving critical scalability and solution quality problems.

•Apr 22, 2025•0 citations
Task scheduling with constrained time intervals and limited resources remains a fundamental challenge across domains such as manufacturing, logistics, cloud computing, and healthcare. This study presents a novel variant of the Quantum Approximate Optimization Algorithm (QAOA) designed to address the task scheduling problem formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model. The proposed method, referred to as Quantum Time Interval Scheduler (QTIS), integrates an ancilla-assisted quantum circuit to dynamically detect and penalize overlapping tasks, enhancing the enforcement of scheduling constraints. Two complementary implementations are explored for overlap detection: a quantum approach based on RY rotations and CCNOT gates, and a classical alternative relying on preprocessed interval comparisons. QTIS decomposes the problem Hamiltonian, Hp, into two components, each parameterized by a distinct angle. The first component encodes the objective function, while the second captures penalty terms associated with overlapping intervals, which are controlled by the auxiliary circuit. Subsequently, three minimization strategies are evaluated: standard QAOA, T-QAOA, and HT-QAOA, showing that employing separate parameters for the different components of the problem Hamiltonian leads to lower energy values and improved solution quality. Results confirm the efficiency of QTIS in scheduling tasks with fixed temporal windows while minimizing conflicts, demonstrating its potential to advance hybrid quantum-classical optimization in complex scheduling environments.
Scheduling medical staff in healthcare institutions is a complex and critical task that requires balancing operational constraints, personnel availability, quality of care, and staff well-being. These interdependent factors make the creation of optimal schedules particularly challenging necessitating sophisticated approaches that effectively reconcile institutional needs and medical staff expectations. This project explores an innovative alternative approach: quantum optimization. By formulating the scheduling problem as a QUBO (Quadratic Unconstrained Binary Optimization) model, we aim to leverage the capabilities of quantum algorithms, particularly the Quantum Approximate Optimization Algorithm (QAOA) This framework allows constraints and objectives to be reformulated as quadratic functions, facilitating their integration into Ising models and their resolution on quantum gate_based circuit systems.To this end, we implement a hybrid quantum-classical solution using QAOA on IBM’s Qiskit platform. We analyze QAOA’s performance on problem instances of up to 27 qubits, and compare it against classical solvers such as CPLEX. Through this comparative approach, we assess the practical viability of quantum optimization in medical staff scheduling and contribute to the broader investigation of quantum computing in operational planning within healthcare systems.
This paper explores the application of the quantum approximate optimization algorithm (QAOA) to the oversubscribed satellite scheduling problem (OSSP), a critical challenge in optimizing communication tasks between satellites and ground stations. The OSSP involves assigning tasks within predefined time windows while minimizing conflicts from overlapping assignments, a problem inherently combinatorial in nature. By formulating the OSSP as a quadratic unconstrained binary optimization problem and translating it into a quantum circuit suitable for QAOA, we present an algorithm for the optimization of the QAOA’s parameters as the number of circuit levels [Formula: see text] increases, by retaining the best parameter values found at each iteration. Experimental evaluations on quantum simulators demonstrate the effectiveness of our approach, thus realizing the QAOA’s potential in addressing complex scheduling tasks efficiently and providing insights into its scalability and applicability in real-world satellite operations.
Combinatorial Optimization (CO) is one of the most important areas in the field of optimization, with practical applications found in every industry, including both the private and public sectors. In recent years, it was discovered that a mathematical formulation known as QUBO (Quadratic Unconstrained Binary Optimization) problem can embrace an exceptional variety of important CO problems found in the industry. In this work, we explore the Quantum Approximate Optimization Algorithm (QAOA) as a quantum computing approach to solve the Knapsack Problem efficiently by formulating the problem as a QUBO model. Here we implemented QAOA on a quantum emulator, leveraging quantum superposition and entanglement to explore multiple solutions simultaneously. The method offers a promising route for solving large, complex scheduling and resource allocation problems that are tough for classical algorithms, with potential applications in logistics, HPC resource scheduling, and energy optimization.
As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.
Efficient production planning is essential in modern manufacturing to improve performance indicators such as lead time and to reduce reliance on human intuition. While mathematical optimization approaches, formulated as job shop scheduling problems, have been applied to automate this process, solving large-scale production planning problems remains computationally demanding. Moreover, many practical scenarios involve conflicting objectives, making traditional scalarization techniques ineffective in finding diverse and useful Pareto-optimal solutions. To address these challenges, we developed a quantum-classical hybrid algorithm that decomposes the problem into two subproblems: resource allocation and task scheduling. Resource allocation is formulated as a quadratic unconstrained binary optimization problem and solved using annealing-based methods that efficiently explore complex solutions. Task scheduling is modeled as a mixed-integer linear programming problem and solved using conventional solvers to satisfy detailed scheduling constraints. We validated the proposed method using benchmark instances based on foundry production scenarios. Experimental results demonstrate that our hybrid approach achieves superior solution quality and computational efficiency compared to traditional monolithic methods. This work offers a promising direction for high-speed, multi-objective scheduling in industrial applications.
Abstract Airline itinerary and scheduling represent some of the most difficult computational problems that exist in transportation. The problems require choosing the best flight routes while determining schedules and allocating resources through various constraints which include regulatory requirements and maintenance schedules and dynamic demand patterns. The solution of small and medium-scale instances has been achieved through mixed-integer programming and heuristic methods including simulated annealing and genetic algorithms and branch-and-price but these methods become impractical for larger real-world instances due to exponential scaling issues. Quantum computing has introduced fresh solutions which enable the resolution of these problems. Quantum mechanical phenomena particularly superposition and entanglement enable optimization algorithms to examine an exponentially expanded solution space simultaneously. Our research applies a basic airline scheduling problem to the Traveling Salesman Problem (TSP) before converting it into a Quadratic Unconstrained Binary Optimization (QUBO) problem. The Quantum Approximate Optimization Algorithm (QAOA) serves as a hybrid quantum-classical method to solve this formulation. The experimental evaluation of a 4-city scenario shows that quantum-based optimization generates performance levels comparable to traditional methods and indicates that improved quantum hardware development will provide computational benefits for complex airline scheduling problems. This research holds dual importance because it can minimize operational expenses and improve scheduling performance and it establishes fundamental principles for complex combinatorial problem optimization across the transportation industry. The research establishes fundamental principles for quantum-enabled applications that will revolutionize airline operations and other transportation networks by solving critical scalability and solution quality problems.