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

IEEE Congress on Evolutionary Computation (CEC)

Two Stage Quantum Optimization for the School Timetabling Problem

Otto Menegasso Pires, Rafael de Santiago, Jerusa Marchi

Published Jun 28, 2021• 3 citations
Publisher

Abstract

Timetabling is an NP-Hard problem that searches for periodic scheduling of events that must meet a set of hard and soft constraints. Because of the difficulty in finding an exact solution, the use of heuristics to address the problem is a common practice. When only the hard constraints are considered, the timetabling problem can be reduced to graph vertex coloring. This similarity between both problems has motivated the use of graph coloring heuristics as a means to solve the timetabling problem. We propose the use of the Quantum Approximate Optimization Algorithm as a heuristic to solve the school timetabling problem. The QAOA is a hybrid quantum-classical algorithm that can be used to address combinatorial optimization problems. We simulated QAOA in a minimal example with 42 qubits using the Ket Quantum Programming Language and our results showed that it is possible to apply QAOA to the school timetabling problem.

DOI
10.1109/cec45853.2021.9504701

Related papers

Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

Young-Hyun Oh, Hamed Mohammadbagherpoor, Patrick Dreher +3 more

The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal solution for graph coloring problems. However, this naive approach can increase the computation cost exponentially as the graph size and the number of colors increase. To mitigate such intolerable overhead, we investigate the methods to take the advantages of quantum computing properties to find a solution for multi-coloring graph problems in polynomial time. We utilize the variational quantum eigensolver (VQE) technique and quantum approximate optimization algorithm (QAOA) to find solutions for three combinatorial applications by both transferring each problem model to the corresponding Ising model and by using the calculated Hamiltonian matrices. Our results demonstrate that VQE and QAOA algorithms can find one of the best solutions for each application. Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time.

arXiv:1911.00595•Nov 1, 2019•30 citations

Efficient hybrid variational quantum algorithm for solving graph coloring problem

Dongmei Liu, Li, Jian, Cheng, Xiubo +3 more

In the era of Noisy Intermediate Scale Quantum (NISQ) computing, available quantum resources are limited. Many NP-hard problems can be efficiently addressed using hybrid classical and quantum computational methods. This paper proposes a hybrid variational quantum algorithm designed to solve the $k$-coloring problem of graph vertices. The hybrid classical and quantum algorithms primarily partition the graph into multiple subgraphs through hierarchical techniques. The Quantum Approximate Optimization Algorithm (QAOA) is employed to determine the coloring within the subgraphs, while a classical greedy algorithm is utilized to find the coloring of the interaction graph. Fixed coloring is applied to the interaction graph, and feedback is provided to correct any conflicting colorings within the subgraphs. The merging process into the original graph is iteratively optimized to resolve any arising conflicts. We employ a hierarchical framework that integrates feedback correction and conflict resolution to achieve $k$-coloring of arbitrary graph vertices. Through experimental analysis, we demonstrate the effectiveness of the algorithm, highlighting the rapid convergence of conflict evolution and the fact that iterative optimization allows the classical algorithm to approximate the number of colorings. Finally, we apply the proposed algorithm to optimize the scheduling of a subway transportation network, demonstrating a high degree of fairness.

arXiv:2504.21335•Apr 30, 2025•2 citations

Integrating Quantum Approximate Optimization Algorithm with Machine Learning for Graph-Structured Problem Solving

Dr. Mamta Singh

The integration of quantum algorithms into machine learning pipelines offers a promising direction for addressing complex combinatorial optimization problems inherent in graph-structured data. This study investigates the use of the Quantum Approximate Optimization Algorithm (QAOA) as a quantum subroutine within a hybrid quantum–classical framework to enhance machine learning solutions for graph-based tasks. QAOA is employed to solve NP-hard graph optimization problems such as Max-Cut, graph coloring, and community detection, which are reformulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. The solutions provided by QAOA are then incorporated into machine learning models, such as Graph Neural Networks (GNNs) or clustering algorithms, as enriched features or optimized graph partitions. The hybrid approach is evaluated on benchmark datasets, demonstrating competitive accuracy and improved scalability in certain problem instances compared to purely classical methods. The findings highlight the potential of leveraging near-term quantum hardware for augmenting classical learning systems in domains such as logistics, social network analysis, and computational biology.

•Mar 25, 2026•0 citations

Quantum Approximate Optimization with Hard and Soft Constraints

Stuart Hadfield, Zhihui Wang, Eleanor Gilbert Rieffel +3 more

Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is: what experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. In this work, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles.

•Nov 3, 2017•59 citations

Hybrid quantum-classical algorithms for approximate graph coloring

Sergey B. Bravyi, Alexander Kliesch, Robert König +1 more

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

arXiv:2011.13420•Quantum•Mar 30, 2022•118 citations

Formulation and quantum resolution of a railway timetabling problem

Grange, Camille, Valentina Pozzoli, François Ramond +1 more

Quantum computing has been a ground-breaking domain for several years. Its new computational paradigm promises to impact the railway transports domain through quantum algorithms that solve hard combinatorial problems where a good or optimal solution is needed. It could open interesting applications for hard real-time problems, integrated problems, etc. Thus, it is crucial to study the type of railway decision or optimization problems quantum computation could tackle and to what extent their solving could be improved. In this paper, we characterize the quantum approaches over classical methods on a problem of optimal timetabling design. This problem consists of finding the transportation plan maximizing the operating profit according to the customers' demand and the availability and cost of the network and the rolling stock. The combinatorial complexity of this problem prevents its efficient solving by current classical computers on large perimeters. Quantum computers could overcome this issue and provide better solutions within less time. We present two families of quantum algorithms for solving combinatorial problems: meta-heuristics (Quantum Approximate Optimization Algorithm, Quantum Annealing) and exact search algorithms (Grover's algorithm). First, we simplify the initial timetabling problem so that the current quantum technology can handle it. Then, we reformulate it for each kind of algorithm. Finally, a small case study and a real-life instance illustrate the implementation of quantum algorithms on available quantum devices.

•Jun 6, 2022•0 citations
Timetabling is an NP-Hard problem that searches for periodic scheduling of events that must meet a set of hard and soft constraints. Because of the difficulty in finding an exact solution, the use of heuristics to address the problem is a common practice. When only the hard constraints are considered, the timetabling problem can be reduced to graph vertex coloring. This similarity between both problems has motivated the use of graph coloring heuristics as a means to solve the timetabling problem. We propose the use of the Quantum Approximate Optimization Algorithm as a heuristic to solve the school timetabling problem. The QAOA is a hybrid quantum-classical algorithm that can be used to address combinatorial optimization problems. We simulated QAOA in a minimal example with 42 qubits using the Ket Quantum Programming Language and our results showed that it is possible to apply QAOA to the school timetabling problem.
The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal solution for graph coloring problems. However, this naive approach can increase the computation cost exponentially as the graph size and the number of colors increase. To mitigate such intolerable overhead, we investigate the methods to take the advantages of quantum computing properties to find a solution for multi-coloring graph problems in polynomial time. We utilize the variational quantum eigensolver (VQE) technique and quantum approximate optimization algorithm (QAOA) to find solutions for three combinatorial applications by both transferring each problem model to the corresponding Ising model and by using the calculated Hamiltonian matrices. Our results demonstrate that VQE and QAOA algorithms can find one of the best solutions for each application. Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time.
In the era of Noisy Intermediate Scale Quantum (NISQ) computing, available quantum resources are limited. Many NP-hard problems can be efficiently addressed using hybrid classical and quantum computational methods. This paper proposes a hybrid variational quantum algorithm designed to solve the kkk-coloring problem of graph vertices. The hybrid classical and quantum algorithms primarily partition the graph into multiple subgraphs through hierarchical techniques. The Quantum Approximate Optimization Algorithm (QAOA) is employed to determine the coloring within the subgraphs, while a classical greedy algorithm is utilized to find the coloring of the interaction graph. Fixed coloring is applied to the interaction graph, and feedback is provided to correct any conflicting colorings within the subgraphs. The merging process into the original graph is iteratively optimized to resolve any arising conflicts. We employ a hierarchical framework that integrates feedback correction and conflict resolution to achieve kkk-coloring of arbitrary graph vertices. Through experimental analysis, we demonstrate the effectiveness of the algorithm, highlighting the rapid convergence of conflict evolution and the fact that iterative optimization allows the classical algorithm to approximate the number of colorings. Finally, we apply the proposed algorithm to optimize the scheduling of a subway transportation network, demonstrating a high degree of fairness.
The integration of quantum algorithms into machine learning pipelines offers a promising direction for addressing complex combinatorial optimization problems inherent in graph-structured data. This study investigates the use of the Quantum Approximate Optimization Algorithm (QAOA) as a quantum subroutine within a hybrid quantum–classical framework to enhance machine learning solutions for graph-based tasks. QAOA is employed to solve NP-hard graph optimization problems such as Max-Cut, graph coloring, and community detection, which are reformulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. The solutions provided by QAOA are then incorporated into machine learning models, such as Graph Neural Networks (GNNs) or clustering algorithms, as enriched features or optimized graph partitions. The hybrid approach is evaluated on benchmark datasets, demonstrating competitive accuracy and improved scalability in certain problem instances compared to purely classical methods. The findings highlight the potential of leveraging near-term quantum hardware for augmenting classical learning systems in domains such as logistics, social network analysis, and computational biology.
Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is: what experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. In this work, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles.
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.
Quantum computing has been a ground-breaking domain for several years. Its new computational paradigm promises to impact the railway transports domain through quantum algorithms that solve hard combinatorial problems where a good or optimal solution is needed. It could open interesting applications for hard real-time problems, integrated problems, etc. Thus, it is crucial to study the type of railway decision or optimization problems quantum computation could tackle and to what extent their solving could be improved. In this paper, we characterize the quantum approaches over classical methods on a problem of optimal timetabling design. This problem consists of finding the transportation plan maximizing the operating profit according to the customers' demand and the availability and cost of the network and the rolling stock. The combinatorial complexity of this problem prevents its efficient solving by current classical computers on large perimeters. Quantum computers could overcome this issue and provide better solutions within less time. We present two families of quantum algorithms for solving combinatorial problems: meta-heuristics (Quantum Approximate Optimization Algorithm, Quantum Annealing) and exact search algorithms (Grover's algorithm). First, we simplify the initial timetabling problem so that the current quantum technology can handle it. Then, we reformulate it for each kind of algorithm. Finally, a small case study and a real-life instance illustrate the implementation of quantum algorithms on available quantum devices.