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 International Conference on ICT in Business Industry & Government (ICTBIG)

Harnessing Quantum Computing for Optimizing CO-PO Alignment Through QUBO Modelling

Poornima G. Naik, Rajani Sudhir Kamath, S. S. Jamsandekar

Published Dec 12, 2025• 0 citations
Publisher

Abstract

This research investigates the application of quantum computing, specifically quantum annealing, to optimize the alignment of Course Outcomes (COs) with Program Outcomes (POs) under Outcome-Based Education (OBE). CO-PO mapping is inherently combinatorial, growing exponentially with the number of courses and outcomes, making classical optimization methods computationally expensive and often suboptimal. We reformulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model using one-hot encoded binary variables to represent discrete$\mathbf{C O -} \mathbf{P O}$correlation levels. The Hamiltonian formulation integrates alignment maximization, discrepancy minimization, and penalty-based enforcement of educational constraints. A prototype implementation using D-Wave's Ocean SDK demonstrates that quantum annealing achieves superior CO-PO alignment, reducing discrepancies and execution time. Experimental evaluation on an MCA curriculum dataset shows a 34 % improvement in alignment score and a 55 % reduction in discrepancies compared to manual mapping, while achieving sub-minute runtime versus several hours for classical methods. These results highlight the potential of quantum-assisted optimization for data-driven, efficient, and sustainable curriculum design.

DOI
10.1109/ictbig68706.2025.11323595

Related papers

Quantum Annealing Combinatorial Optimization (QACO)

Jincheng Zhang

This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.

•Sep 3, 2026•0 citations

Designing Specification-Oriented Quantum Algorithm Education for Interdisciplinary Graduate Students

Yuko Murakami, Tomohiro Inagaki

Graduate students across diverse disciplines increasingly encounter advanced computational technologies such as generative AI and quantum computing, even when their primary research does not involve statistical modeling or intensive programming. This paper reports a case study of a graduate-level course that adopts specification-oriented computational education, guiding students to formalize objectives, constraints, and procedures as explicit specifications before code implementation.Quantum optimization was used as a pedagogical theme, with the Traveling Salesman Problem linking classical search and quantum annealing through a Quadratic Unconstrained Binary Optimization formulation. The course combined face-to-face collaborative activities with short on-demand modules introducing a basic quantum annealing workflow. To analyze learning outcomes without affecting official course grades, we developed a rubric-based evaluation framework focusing on specification quality and logical coherence, and conducted an exploratory AI-assisted analysis to reflect on the feasibility and risks of automated assessment. The paper presents a concrete design pattern for integrating quantum algorithms into interdisciplinary graduate education while maintaining fairness in course grading.

International Conference on Information Technology and Education Technology (ITET)•Jun 1, 2026•0 citations

A Constraint Programming Approach for QUBO Solving and Quantum Annealing

Philippe Codognet

Quantum Annealing is an alternative type of computation in which problems are encoded in quantum Hamiltonians (energy functions) and quantum dynamics is used to find solutions (ground states of minimal energy). Quantum computers such as the D-Wave systems are indeed implementing those ideas in hardware, as well as "quantum-inspired" devices based on classical electronics such as Fujitsu’s Digital Annealing Unit. All those systems use the same modeling language: Quadratic Unconstrained Binary Optimization (QUBO). However, QUBO is a low-level language and for modeling combinatorial problems such as constraint satisfaction and constrained optimization problems, we need to introduce higher-level abstractions in order to define complex constraints.

International Conference on Art, Science, and Engineering of Programming (<Programming>)•Mar 11, 2024•2 citations

Quantum Computing and Optimization through QUBO in Education: A Case Study on Efficient Multi-agent Route Planning

Renáta Rusnáková, Martin Chovanec, Sylvia Maťašová +1 more

This article explores the use of QUBO as a practical and educational framework for solving complex optimization problems. QUBO models are widely applicable across fields such as scheduling, routing, and resource allocation, and are compatible with classical, hybrid, and quantum solvers. We discuss the core principles behind QUBO, its connection to physical systems like the Ising model, and its growing relevance in research and education. To demonstrate the practical side, we apply QUBO to a real-world-inspired Multi-agent Route Planning problem, where the goal is to maximize the network coverage while minimizing the total overlap of vehicle-routes. This use-case helps illustrate how QUBO formulations can model trade-offs, encode constraints, and scale to larger problem sizes. In addition, we evaluate midsized instances of the problem on D-Wave Systems’ Advantage2 quantum annealer. The study aims to bridge theoretical optimization with hands-on experimentation, making it suitable for both teaching and applied research.

International Conference on Emerging eLearning Technologies and Applications (ICETA)•Nov 13, 2025•0 citations

Quantum annealing approach to the minimum distance problem of quantum codes

Anonymous, Ashish Kakkar, Anatoly Y. Dymarsky

Quantum error-correcting codes (QECCs) are at the heart of fault-tolerant quantum computing. As the size of quantum platforms is expected to grow, one of the open questions is to design new optimal codes of ever-increasing size. A related challenge is to certify the quality of a given code by evaluating its minimum distance, a quantity characterizing code's capacity to preserve quantum information. This problem is known to be NP-hard. Here we propose to harness the power of contemporary quantum platforms to address this question, and in this way help design quantum platforms of the future. Namely, we introduce an approach to compute the minimum distance of quantum stabilizer codes by reformulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem and leveraging established QUBO algorithms and heuristics as well as quantum annealing (QA) to address the latter. The reformulation as a QUBO introduces only a logarithmic multiplicative overhead in the required number of variables. We demonstrate the formulation using the D-Wave Advantage 4.1 quantum annealer and the hybrid quantum-classical algorithm Qbsolv, and benchmark the resulting QUBO-based implementations against specialized classical distance-finding methods. The QA- and SA-assisted implementations show broadly comparable performance, while the classical comparison clarifies the relative strengths of heuristic optimization and exact distance certification. Our results establish a solver-independent QUBO formulation with only a logarithmic multiplicative overhead in the number of variables and characterize connectivity and minor embedding as central limitations of its present implementation on quantum-annealing hardware.

arXiv:2404.17703•Physical Review A•Sep 4, 2026•3 citations

Solving the resource constrained project scheduling problem with quantum annealing

Luis Fernando Pérez Armas, Stefan Creemers, Samuel Deleplanque

Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research.

Scientific Reports•Jul 22, 2024•40 citations
This research investigates the application of quantum computing, specifically quantum annealing, to optimize the alignment of Course Outcomes (COs) with Program Outcomes (POs) under Outcome-Based Education (OBE). CO-PO mapping is inherently combinatorial, growing exponentially with the number of courses and outcomes, making classical optimization methods computationally expensive and often suboptimal. We reformulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model using one-hot encoded binary variables to represent discreteCO−PO\mathbf{C O -} \mathbf{P O}CO−POcorrelation levels. The Hamiltonian formulation integrates alignment maximization, discrepancy minimization, and penalty-based enforcement of educational constraints. A prototype implementation using D-Wave's Ocean SDK demonstrates that quantum annealing achieves superior CO-PO alignment, reducing discrepancies and execution time. Experimental evaluation on an MCA curriculum dataset shows a 34 % improvement in alignment score and a 55 % reduction in discrepancies compared to manual mapping, while achieving sub-minute runtime versus several hours for classical methods. These results highlight the potential of quantum-assisted optimization for data-driven, efficient, and sustainable curriculum design.
This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.
Graduate students across diverse disciplines increasingly encounter advanced computational technologies such as generative AI and quantum computing, even when their primary research does not involve statistical modeling or intensive programming. This paper reports a case study of a graduate-level course that adopts specification-oriented computational education, guiding students to formalize objectives, constraints, and procedures as explicit specifications before code implementation.Quantum optimization was used as a pedagogical theme, with the Traveling Salesman Problem linking classical search and quantum annealing through a Quadratic Unconstrained Binary Optimization formulation. The course combined face-to-face collaborative activities with short on-demand modules introducing a basic quantum annealing workflow. To analyze learning outcomes without affecting official course grades, we developed a rubric-based evaluation framework focusing on specification quality and logical coherence, and conducted an exploratory AI-assisted analysis to reflect on the feasibility and risks of automated assessment. The paper presents a concrete design pattern for integrating quantum algorithms into interdisciplinary graduate education while maintaining fairness in course grading.
Quantum Annealing is an alternative type of computation in which problems are encoded in quantum Hamiltonians (energy functions) and quantum dynamics is used to find solutions (ground states of minimal energy). Quantum computers such as the D-Wave systems are indeed implementing those ideas in hardware, as well as "quantum-inspired" devices based on classical electronics such as Fujitsu’s Digital Annealing Unit. All those systems use the same modeling language: Quadratic Unconstrained Binary Optimization (QUBO). However, QUBO is a low-level language and for modeling combinatorial problems such as constraint satisfaction and constrained optimization problems, we need to introduce higher-level abstractions in order to define complex constraints.
This article explores the use of QUBO as a practical and educational framework for solving complex optimization problems. QUBO models are widely applicable across fields such as scheduling, routing, and resource allocation, and are compatible with classical, hybrid, and quantum solvers. We discuss the core principles behind QUBO, its connection to physical systems like the Ising model, and its growing relevance in research and education. To demonstrate the practical side, we apply QUBO to a real-world-inspired Multi-agent Route Planning problem, where the goal is to maximize the network coverage while minimizing the total overlap of vehicle-routes. This use-case helps illustrate how QUBO formulations can model trade-offs, encode constraints, and scale to larger problem sizes. In addition, we evaluate midsized instances of the problem on D-Wave Systems’ Advantage2 quantum annealer. The study aims to bridge theoretical optimization with hands-on experimentation, making it suitable for both teaching and applied research.
Quantum error-correcting codes (QECCs) are at the heart of fault-tolerant quantum computing. As the size of quantum platforms is expected to grow, one of the open questions is to design new optimal codes of ever-increasing size. A related challenge is to certify the quality of a given code by evaluating its minimum distance, a quantity characterizing code's capacity to preserve quantum information. This problem is known to be NP-hard. Here we propose to harness the power of contemporary quantum platforms to address this question, and in this way help design quantum platforms of the future. Namely, we introduce an approach to compute the minimum distance of quantum stabilizer codes by reformulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem and leveraging established QUBO algorithms and heuristics as well as quantum annealing (QA) to address the latter. The reformulation as a QUBO introduces only a logarithmic multiplicative overhead in the required number of variables. We demonstrate the formulation using the D-Wave Advantage 4.1 quantum annealer and the hybrid quantum-classical algorithm Qbsolv, and benchmark the resulting QUBO-based implementations against specialized classical distance-finding methods. The QA- and SA-assisted implementations show broadly comparable performance, while the classical comparison clarifies the relative strengths of heuristic optimization and exact distance certification. Our results establish a solver-independent QUBO formulation with only a logarithmic multiplicative overhead in the number of variables and characterize connectivity and minor embedding as central limitations of its present implementation on quantum-annealing hardware.
Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research.