Quantum Annealing for Staff Scheduling in Educational Environments

• URL: http://arxiv.org/abs/2510.12278v1
• Date: Tue, 14 Oct 2025 08:29:58 GMT
• Title: Quantum Annealing for Staff Scheduling in Educational Environments
• Authors: Alessia Ciacco, Francesca Guerriero, Eneko Osaba,
• Abstract summary: We address a novel staff allocation problem that arises in the organization of collaborators among multiple school sites and educational levels.<n>The problem emerges from a real case study in a public school in Calabria, Italy, where staff members must be distributed across kindergartens, primary, and secondary schools under constraints of availability, competencies, and fairness.
• Score: 0.13764085113103217
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We address a novel staff allocation problem that arises in the organization of collaborators among multiple school sites and educational levels. The problem emerges from a real case study in a public school in Calabria, Italy, where staff members must be distributed across kindergartens, primary, and secondary schools under constraints of availability, competencies, and fairness. To tackle this problem, we develop an optimization model and investigate a solution approach based on quantum annealing. Our computational experiments on real-world data show that quantum annealing is capable of producing balanced assignments in short runtimes. These results provide evidence of the practical applicability of quantum optimization methods in educational scheduling and, more broadly, in complex resource allocation tasks.

Related papers

• Quantum computing for genomics: conceptual challenges and practical perspectives [0.0]
  We assess the potential of quantum computing to accelerate computation of central tasks in genomics.<n>We discuss state-of-the-art challenges of quantum search, optimization, and machine learning algorithms.
  arXiv  Detail & Related papers  (2025-07-05T17:41:10Z)
• Causally Aligned Curriculum Learning [69.11672390876763]
  This paper studies the problem of curriculum RL through causal lenses.<n>We derive a sufficient graphical condition characterizing causally aligned source tasks.<n>We develop an efficient algorithm to generate a causally aligned curriculum.
  arXiv  Detail & Related papers  (2025-03-21T02:20:38Z)
• Preventing Local Pitfalls in Vector Quantization via Optimal Transport [77.15924044466976]
  We introduce OptVQ, a novel vector quantization method that employs the Sinkhorn algorithm to optimize the optimal transport problem.<n>Our experiments on image reconstruction tasks demonstrate that OptVQ achieves 100% codebook utilization and surpasses current state-of-the-art VQNs in reconstruction quality.
  arXiv  Detail & Related papers  (2024-12-19T18:58:14Z)
• Learning complexity gradually in quantum machine learning models [0.29998889086656577]
  We propose a framework that prioritizes informative data points over the entire training set. By selectively focusing on informative samples, we aim to steer the optimization process toward more favorable regions of the parameter space. Our findings indicate that this strategy could be a valuable approach for improving the performance of quantum machine learning models.
  arXiv  Detail & Related papers  (2024-11-18T19:00:01Z)
• Quantum-Powered Personalized Learning [3.1523832615228295]
  We review existing personalized learning systems, classical machine learning methods, and emerging quantum computing applications in education. Our findings indicate that quantum algorithms offer substantial improvements in efficiency, scalability, and personalization quality compared to classical methods.
  arXiv  Detail & Related papers  (2024-08-25T17:45:48Z)
• Quantum Curriculum Learning [0.0]
  We propose a framework called quantum curriculum learning (Q-CurL) for quantum data.<n>Q-CurL introduces simpler tasks or data to the learning model before progressing to more challenging ones.<n> Empirical evidence shows that Q-CurL significantly enhances training convergence and generalization for unitary learning.
  arXiv  Detail & Related papers  (2024-07-02T16:44:14Z)
• Predicting quantum learnability from landscape fluctuation [4.852613028421959]
  Conflict between trainability and expressibility is a key challenge in variational quantum computing and quantum machine learning. We demonstrate a simple and efficient metric for learnability by comparing the fluctuations of the given training landscape with standard learnable landscapes. It can be estimated efficiently on classical computers via Clifford sampling without actual training on quantum devices.
  arXiv  Detail & Related papers  (2024-06-17T17:50:47Z)
• Dynamic Inhomogeneous Quantum Resource Scheduling with Reinforcement Learning [17.229068960497273]
  A central challenge in quantum information science and technology is achieving real-time estimation and feedforward control of quantum systems. We introduce a new framework utilizing a Transformer model that emphasizes self-attention mechanisms for pairs of qubits. Our method significantly improves the performance of quantum systems, achieving more than a 3$times$ improvement over rule-based agents.
  arXiv  Detail & Related papers  (2024-05-25T23:39:35Z)
• Quantum Optimization Methods for Satellite Mission Planning [0.3252295747842729]
  The ever-growing amount of satellites in orbit underscores the need to operate them efficiently. Current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative.
  arXiv  Detail & Related papers  (2024-04-08T13:36:29Z)
• Understanding Curriculum Learning in Policy Optimization for Online Combinatorial Optimization [66.35750142827898]
  This paper presents the first systematic study on policy optimization methods for online CO problems. We show that online CO problems can be naturally formulated as latent Markov Decision Processes (LMDPs), and prove convergence bounds on natural policy gradient (NPG) Furthermore, our theory explains the benefit of curriculum learning: it can find a strong sampling policy and reduce the distribution shift.
  arXiv  Detail & Related papers  (2022-02-11T03:17:15Z)
• Distributed Deep Learning in Open Collaborations [49.240611132653456]
  We propose a novel algorithmic framework designed specifically for collaborative training. We demonstrate the effectiveness of our approach for SwAV and ALBERT pretraining in realistic conditions and achieve performance comparable to traditional setups at a fraction of the cost.
  arXiv  Detail & Related papers  (2021-06-18T16:23:13Z)
• Decentralized Personalized Federated Learning for Min-Max Problems [79.61785798152529]
  This paper is the first to study PFL for saddle point problems encompassing a broader range of optimization problems. We propose new algorithms to address this problem and provide a theoretical analysis of the smooth (strongly) convex-(strongly) concave saddle point problems. Numerical experiments for bilinear problems and neural networks with adversarial noise demonstrate the effectiveness of the proposed methods.
  arXiv  Detail & Related papers  (2021-06-14T10:36:25Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.