QTIS: A QAOA-Based Quantum Time Interval Scheduler

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.

19 pages, 13 figures

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Quantum algorithms: an overview
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Hybrid quantum-classical algorithms for approximate graph coloring
• A case study of variational quantum algorithms for a job shop scheduling problem
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Topology-Driven Quantum Architecture Search Framework
• Quantum Alternating Operator Ansatz for Solving the Minimum Exact Cover Problem
• Combinatorial Optimization with Quantum Computers
• Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling