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

Annals of Operations Research

Quantum bridge analytics: a QUBO approach to the uncapacitated facility location problem

Haitao Li, Rick Hennig, Gary A. Kochenberger, Fred Glover

Published Apr 9, 2026• 0 citations
Publisher
DOI
10.1007/s10479-026-07201-1

Related papers

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models

Fred Glover, Gary A. Kochenberger, Yu Du

4OR•Nov 26, 2019•298 citations

Quantum bridge analytics I: a tutorial on formulating and using QUBO models

Fred Glover, Gary A. Kochenberger, Rick Hennig +1 more

Annals of Operations Research•Apr 7, 2022•301 citations

Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange

Fred Glover, Gary A. Kochenberger, Moses Ma +1 more

Annals of Operations Research•May 2, 2022•30 citations

Quantum Optimisation for Supply Chain: QUBO Formulations and QAOA Solutions for Facility Location and Load Balancing

L. M. Moncayo, Naihui He

•Jan 1, 2025•0 citations

Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange

Fred Glover, Gary A. Kochenberger, Moses Ma +1 more

4OR•Dec 1, 2020•16 citations

Quantum optimisation for supply chain: QUBO formulations and QAOA solutions for facility location and load balancing

Luis A. Moncayo-Martínez, Naihui He

• First use of QAOA for Facility Location (FL) and Load Balancing (LB) in supply chains optimisation. • QAOA successfully solves FL and LB using compact unbalanced-penalisation QUBO models. • Hardware-calibrated QAOA retrieves optimal FL solutions even under realistic gate and readout errors. • Provides reproducible QUBO–to–Ising transformations and full QAOA implementations in PennyLane and Qiskit. Quantum computing is emerging as a promising paradigm for solving combinatorial optimisation problems that are intractable for classical methods. Among the most prominent quantum algorithms is the Quantum Approximate Optimisation Algorithm (QAOA), which has demonstrated potential in addressing NP-hard problems using shallow circuits compatible with Noisy Intermediate-Scale Quantum (NISQ) devices. While QAOA has been applied to logistics and scheduling tasks, foundational supply chain problems such as Facility Location (FL) and Load Balancing (LB) remain largely unexplored. This paper addresses this gap by formulating FL and LB as Quadratic Unconstrained Binary Optimisation (QUBO) models and solving them using QAOA under both noiseless and hardware-calibrated noisy conditions. Two encoding methods are compared: the conventional slack-variable approach and the unbalanced penalisation technique. Results show that unbalanced penalisation consistently outperforms the slack-variable method by achieving higher feasibility and optimality rates and by avoiding the qubit inflation that limits slack-based encodings. FL instances, modelled as minimum dominating sets, exhibit strong performance in both noiseless and noisy simulations, whereas LB instances suffer from depth-induced noise due to their denser constraints. Furthermore, we outline the QUBO-to-Ising transformation process, with open-source implementations in PennyLane and Qiskit. To the best of our knowledge, this work represents the first application of QAOA to FL and LB, bridging the gap between quantum algorithm design and practical supply chain optimisation.

Results in Engineering•Nov 27, 2025•3 citations
• First use of QAOA for Facility Location (FL) and Load Balancing (LB) in supply chains optimisation. • QAOA successfully solves FL and LB using compact unbalanced-penalisation QUBO models. • Hardware-calibrated QAOA retrieves optimal FL solutions even under realistic gate and readout errors. • Provides reproducible QUBO–to–Ising transformations and full QAOA implementations in PennyLane and Qiskit. Quantum computing is emerging as a promising paradigm for solving combinatorial optimisation problems that are intractable for classical methods. Among the most prominent quantum algorithms is the Quantum Approximate Optimisation Algorithm (QAOA), which has demonstrated potential in addressing NP-hard problems using shallow circuits compatible with Noisy Intermediate-Scale Quantum (NISQ) devices. While QAOA has been applied to logistics and scheduling tasks, foundational supply chain problems such as Facility Location (FL) and Load Balancing (LB) remain largely unexplored. This paper addresses this gap by formulating FL and LB as Quadratic Unconstrained Binary Optimisation (QUBO) models and solving them using QAOA under both noiseless and hardware-calibrated noisy conditions. Two encoding methods are compared: the conventional slack-variable approach and the unbalanced penalisation technique. Results show that unbalanced penalisation consistently outperforms the slack-variable method by achieving higher feasibility and optimality rates and by avoiding the qubit inflation that limits slack-based encodings. FL instances, modelled as minimum dominating sets, exhibit strong performance in both noiseless and noisy simulations, whereas LB instances suffer from depth-induced noise due to their denser constraints. Furthermore, we outline the QUBO-to-Ising transformation process, with open-source implementations in PennyLane and Qiskit. To the best of our knowledge, this work represents the first application of QAOA to FL and LB, bridging the gap between quantum algorithm design and practical supply chain optimisation.