Quantum Computing in Logistics and Supply Chain Management an Overview
read the original abstract
The work explores the integration of quantum computing into logistics and supply chain management, emphasising its potential for use in complex optimisation problems. The discussion introduces quantum computing principles, focusing on quantum annealing and gate-based quantum computing, with the Quantum Approximate Optimisation Algorithm and Quantum Annealing as key algorithmic approaches. The paper provides an overview of quantum approaches to routing, logistic network design, fleet maintenance, cargo loading, prediction, and scheduling problems. Notably, most solutions in the literature are hybrid, combining quantum and classical computing. The conclusion highlights the early stage of quantum computing, emphasising its potential impact on logistics and supply chain optimisation. In the final overview, the literature is categorised, identifying quantum annealing dominance and a need for more research in prediction and machine learning is highlighted. The consensus is that quantum computing has great potential but faces current hardware limitations, necessitating further advancements for practical implementation.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
A fidelity metric for quantum annealing benchmarked by extreme scaling quantum Monte-Carlo simulations
Introduces an equation-of-state accuracy metric ε for quantum annealing and benchmarks it via large-scale variational and Green-function quantum Monte Carlo simulations on Rydberg systems, reporting ε values of 10^{-2...
-
An Error-aware and Adaptive Method for the Estimation of Quantum Observables on Qudit-Based Quantum Computers
AQUIRE is the first error-aware adaptive Bayesian protocol for simultaneously estimating the mean and error of observables on qudit quantum computers using generalized Pauli operators and overlap grouping.
-
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems
AtomTreeSearch embeds a neutral-atom quantum MWIS subroutine inside Monte Carlo Tree Search and matches or exceeds OR-Tools and simulated annealing on TSP instances up to 100 cities.
-
Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem
Iterative cutting-plane generation and arc preprocessing reduce TSP model size and yield performance gains on classical, direct quantum, and hybrid D-Wave solvers.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.