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 Quantum Computing and Engineering (QCE)

A Quantum-Inspired Approach to Emergency Patient Allocation Using Digital Annealing

Chia‐Ho Ou, Bo-Yuan Zhu, Zongwei Huang, Chih-Yu Chen, Ching‐Ray Chang, Wen-Hsi Huang, Wei‐Cheng Chen

Published Sep 17, 2023• 3 citations
Publisher

Abstract

This paper presents a quantum-inspired optimization scheme for patient allocation, aimed at the expedient and efficient distribution of medical resources. The objective is to minimize patients' waiting times and optimize the usage of available medical capacity by allocating patients to the most appropriate hospitals based on the severity of their injuries. This allocation problem is situated within the urban context, seeking to minimize the distance between patients and hospitals. Traditionally, solving such large-scale allocation problems in expansive urban areas poses significant computational challenges. However, by incorporating quantum-inspired methods, we model this problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, which is solved using a digital annealer. We conducted an experimental study on the digital annealing device and compared its performance with that of a conventional simulated annealing algorithm. The results demonstrate that our proposed digital annealing approach to patient allocation offers superior performance and effectiveness.

DOI
10.1109/qce57702.2023.10272

Related papers

Real-Time Healthcare Workforce Rescheduling using a Quantum Computer: A Novel Approach to Dynamic Staff Allocation in Hospital Settings

Indraneel Borgohain

Real-time healthcare workforce scheduling represents a critical optimization challenge with direct implications for patient care quality and operational efficiency. This article introduces a quantum computing approach to dynamic hospital staff rescheduling that addresses the complex constraints of medical workforce allocation when facing unexpected absences. By formulating the problem as a quadratic unconstrained binary optimization (QUBO) model suitable for quantum processing, demonstrate how quantum annealing and gate-based quantum algorithms can rapidly identify optimal staff substitutions while balancing factors such as specialist qualifications, shift duration, fatigue management, and geographical proximity. The simulation results indicate that quantum-accelerated scheduling can significantly reduce the average time to fill critical absences compared to classical heuristic methods while maintaining high adherence to staffing quality metrics. This has substantial potential to mitigate the downstream clinical impacts of staffing disruptions, particularly in high-acuity hospital departments where timely specialist presence is essential for patient outcomes.

European Journal of Computer Science and Information Technology•Apr 15, 2025•0 citations

Optimizing Human Resource Allocation in Long-Term Care Using Quantum and Digital Annealing

Chia‐Ho Ou, Jhih-Ying Chen, Wun-Ci Cao +3 more

This study proposes a Quadratic Unconstrained Binary Optimization (QUBO) optimization model for scheduling home care workers in long-term care services. The Simulated Annealing (SA) algorithm, D-Wave Hybrid quantum annealer, Compal Quantix digital annealer, and Fujitsu DA3 digital annealer are conducted for performance evaluations on the proposed model. Experimental results show that the Compal Quantix and Fujitsu DA3 digital annealers significantly reduce the commuting distance of home care workers for optimizing human resource allocation more effectively than other schemes.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•2 citations

Micro-mobility dispatch optimization via quantum annealing incorporating historical data

Takeru Goto, Masayuki Ohzeki

This paper proposes a novel dispatch formulation for micro-mobility vehicles using a Quantum Annealer (QA). In recent years, QA has gained increasing attention as a high-performance solver for combinatorial optimization problems. Meanwhile, micro-mobility services have been rapidly developed as a promising means of realizing efficient and sustainable urban transportation. In this study, the dispatch problem for such micro-mobility services is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling efficient solving through QA. Furthermore, the proposed formulation incorporates historical usage data to enhance operational efficiency. Specifically, customer arrival frequencies and destination distributions are modeled into the QUBO formulation through a Bayesian approach, which guides the allocation of vacant vehicles to designated stations for waiting and charging. Simulation experiments are conducted to evaluate the effectiveness of the proposed method, with comparisons to conventional formulations such as the vehicle routing problem. Additionally, the performance of QA is compared with that of classical solvers to reveal its potential advantages for the proposed dispatch formulation. The effect of reverse annealing on improving solution quality is also investigated.

quant-pharXiv:2601.20887•Jan 29, 2026•0 citations

Micro-mobility dispatch optimization via quantum annealing incorporating historical data

Takeru Goto, Masayuki Ohzeki

This paper proposes a novel dispatch formulation for micro-mobility vehicles using a quantum annealing (QA). In recent years, QA has gained increasing attention as a high-performance solver for combinatorial optimization problems. Meanwhile, micro-mobility services have been rapidly developed as a promising means of realizing efficient and sustainable urban transportation. In this study, the dispatch problem for such micro-mobility services is formulated as a quadratic unconstrained binary optimization (QUBO) problem, enabling efficient solving through QA. Furthermore, the proposed formulation incorporates historical usage data to enhance operational efficiency. Specifically, customer arrival frequencies and destination distributions are modeled into the QUBO formulation through a Bayesian approach, which guides the allocation of vacant vehicles to designated stations for waiting and charging. Simulation experiments are conducted to evaluate the effectiveness of the proposed method, with comparisons to conventional formulations such as the vehicle routing problem. Additionally, the performance of QA is compared with that of classical solvers to reveal its potential advantages for the proposed dispatch formulation. The effect of reverse annealing on improving solution quality is also investigated.

Scientific Reports•May 9, 2026•0 citations

Solving optimal electric vehicle charging station placement problem using digital quantum annealing

Chia‐Ho Ou, Chung-Chieh Cheng, Chih‐Yu Chen +2 more

It is imperative to reduce carbon dioxide emissions and fossil fuel consumption to ensure the Earth's sustainable future and mitigate negative impacts like extreme climate changes caused by greenhouse gases. Electric vehicles (EVs) play a pivotal role in this context, where the convenience of charging stations is crucial in influencing consumer choices. This paper formulates the placement of charging stations as an optimization problem, considering factors like station density, accessibility, coverage, and regional cost variations, to minimize total construction costs. The problem is mapped onto a quadratic unconstrained binary optimization (QUBO) model. The QUBO can efficiently represent and solve complex combinatorial optimization problems, making it suitable for quantum and advanced classical algorithms. Utilizing digital quantum annealing, the optimal or near-optimal solutions are efficiently identified. The performance of the proposed approach is compared with classical algorithms, including mixed linear programming and simulated annealing, demonstrating significant advancements of digital annealing.

Journal of Communications and Networks•Aug 1, 2025•8 citations

Quantum and Digital Annealing for the Quadratic Assignment Problem

Philippe Codognet, Daniel Díaz, Salvador Pinto Abreu

The Quadratic Assignment Problem is a a classical constrained optimization problem used to model many real-life applications. We present experiments in solving the Quadratic Assignment Problem by means of Quantum Annealing and Quantum-inspired Annealing. We describe how to model this classical combinatorial problem in terms of QUBO (Quadratic Unconstrained Binary optimization) for implementing it on hardware solvers based on quantum or quantum-inspired annealing (D-Wave, Fujitsu Digital Annealing Unit and Fixstars Amplify Annealing Engine). We present performance result for these implementations and compare them with well established metaheuristic solvers on classical hardware, such as Robust Tabu Search and External Optimization.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2022•12 citations
This paper presents a quantum-inspired optimization scheme for patient allocation, aimed at the expedient and efficient distribution of medical resources. The objective is to minimize patients' waiting times and optimize the usage of available medical capacity by allocating patients to the most appropriate hospitals based on the severity of their injuries. This allocation problem is situated within the urban context, seeking to minimize the distance between patients and hospitals. Traditionally, solving such large-scale allocation problems in expansive urban areas poses significant computational challenges. However, by incorporating quantum-inspired methods, we model this problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, which is solved using a digital annealer. We conducted an experimental study on the digital annealing device and compared its performance with that of a conventional simulated annealing algorithm. The results demonstrate that our proposed digital annealing approach to patient allocation offers superior performance and effectiveness.
Real-time healthcare workforce scheduling represents a critical optimization challenge with direct implications for patient care quality and operational efficiency. This article introduces a quantum computing approach to dynamic hospital staff rescheduling that addresses the complex constraints of medical workforce allocation when facing unexpected absences. By formulating the problem as a quadratic unconstrained binary optimization (QUBO) model suitable for quantum processing, demonstrate how quantum annealing and gate-based quantum algorithms can rapidly identify optimal staff substitutions while balancing factors such as specialist qualifications, shift duration, fatigue management, and geographical proximity. The simulation results indicate that quantum-accelerated scheduling can significantly reduce the average time to fill critical absences compared to classical heuristic methods while maintaining high adherence to staffing quality metrics. This has substantial potential to mitigate the downstream clinical impacts of staffing disruptions, particularly in high-acuity hospital departments where timely specialist presence is essential for patient outcomes.
This study proposes a Quadratic Unconstrained Binary Optimization (QUBO) optimization model for scheduling home care workers in long-term care services. The Simulated Annealing (SA) algorithm, D-Wave Hybrid quantum annealer, Compal Quantix digital annealer, and Fujitsu DA3 digital annealer are conducted for performance evaluations on the proposed model. Experimental results show that the Compal Quantix and Fujitsu DA3 digital annealers significantly reduce the commuting distance of home care workers for optimizing human resource allocation more effectively than other schemes.
This paper proposes a novel dispatch formulation for micro-mobility vehicles using a Quantum Annealer (QA). In recent years, QA has gained increasing attention as a high-performance solver for combinatorial optimization problems. Meanwhile, micro-mobility services have been rapidly developed as a promising means of realizing efficient and sustainable urban transportation. In this study, the dispatch problem for such micro-mobility services is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling efficient solving through QA. Furthermore, the proposed formulation incorporates historical usage data to enhance operational efficiency. Specifically, customer arrival frequencies and destination distributions are modeled into the QUBO formulation through a Bayesian approach, which guides the allocation of vacant vehicles to designated stations for waiting and charging. Simulation experiments are conducted to evaluate the effectiveness of the proposed method, with comparisons to conventional formulations such as the vehicle routing problem. Additionally, the performance of QA is compared with that of classical solvers to reveal its potential advantages for the proposed dispatch formulation. The effect of reverse annealing on improving solution quality is also investigated.
This paper proposes a novel dispatch formulation for micro-mobility vehicles using a quantum annealing (QA). In recent years, QA has gained increasing attention as a high-performance solver for combinatorial optimization problems. Meanwhile, micro-mobility services have been rapidly developed as a promising means of realizing efficient and sustainable urban transportation. In this study, the dispatch problem for such micro-mobility services is formulated as a quadratic unconstrained binary optimization (QUBO) problem, enabling efficient solving through QA. Furthermore, the proposed formulation incorporates historical usage data to enhance operational efficiency. Specifically, customer arrival frequencies and destination distributions are modeled into the QUBO formulation through a Bayesian approach, which guides the allocation of vacant vehicles to designated stations for waiting and charging. Simulation experiments are conducted to evaluate the effectiveness of the proposed method, with comparisons to conventional formulations such as the vehicle routing problem. Additionally, the performance of QA is compared with that of classical solvers to reveal its potential advantages for the proposed dispatch formulation. The effect of reverse annealing on improving solution quality is also investigated.
It is imperative to reduce carbon dioxide emissions and fossil fuel consumption to ensure the Earth's sustainable future and mitigate negative impacts like extreme climate changes caused by greenhouse gases. Electric vehicles (EVs) play a pivotal role in this context, where the convenience of charging stations is crucial in influencing consumer choices. This paper formulates the placement of charging stations as an optimization problem, considering factors like station density, accessibility, coverage, and regional cost variations, to minimize total construction costs. The problem is mapped onto a quadratic unconstrained binary optimization (QUBO) model. The QUBO can efficiently represent and solve complex combinatorial optimization problems, making it suitable for quantum and advanced classical algorithms. Utilizing digital quantum annealing, the optimal or near-optimal solutions are efficiently identified. The performance of the proposed approach is compared with classical algorithms, including mixed linear programming and simulated annealing, demonstrating significant advancements of digital annealing.
The Quadratic Assignment Problem is a a classical constrained optimization problem used to model many real-life applications. We present experiments in solving the Quadratic Assignment Problem by means of Quantum Annealing and Quantum-inspired Annealing. We describe how to model this classical combinatorial problem in terms of QUBO (Quadratic Unconstrained Binary optimization) for implementing it on hardware solvers based on quantum or quantum-inspired annealing (D-Wave, Fujitsu Digital Annealing Unit and Fixstars Amplify Annealing Engine). We present performance result for these implementations and compare them with well established metaheuristic solvers on classical hardware, such as Robust Tabu Search and External Optimization.