Combinatorial Optimization in Transportation and Logistics Networks

Vogiatzis, Chrysafis; Pardalos, Pãnos M.

doi:10.1007/978-1-4419-7997-1_63

Cited by 3 publications

(1 citation statement)

References 77 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, quantum computing has implications for drug discovery [2], materials science [3], and machine learning algorithms [4], amongst other fields. While the aforementioned applications of quantum computing are promising, a significant amount of research is being carried out on the development of quantum-enhanced optimisation techniques for logistics [5][6][7][8], automotive [9], finance [10][11][12] and the defence sector [13].…”

Section: Introductionmentioning

confidence: 99%

A practitioner’s guide to quantum algorithms for optimisation problems

Symons,

Galvin,

Sahin

et al. 2023

J. Phys. A: Math. Theor.

View full text Add to dashboard Cite

Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where quantum computing has potential is in the speed-up of NP-hard optimisation problems that are common in industrial areas such as logistics and finance. Newcomers to the field of quantum computing who are interested in using this technology to solve optimisation problems do not have an easily accessible source of information on the current capabilities of quantum computers and algorithms. This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques and their practical application, focusing on their near-term potential for NISQ devices.The paper starts by drawing parallels between classical and quantum optimisation problems, highlighting their conceptual similarities and differences. Two main paradigms for quantum hardware are then discussed: quantum annealing and gate-based quantum computing. While quantum annealers are effective for some optimisation problems, they have limitations and cannot be used for universal quantum computation. In contrast, gate-based quantum computers offer the potential for universal quantum computation, but they face challenges with hardware limitations and accurate gate implementation. The paper provides a detailed mathematical discussion with references to key works in the field, as well as a more practical discussion with relevant examples.The most popular techniques for quantum optimisation on gate-based quantum computers, the quantum approximate optimisation (QAO) algorithm and the quantum alternating operator ansatz (QAOA) framework, are discussed in detail. However, it is still unclear whether these techniques will yield quantum advantage, even with advancements in hardware and noise reduction. The paper concludes with a discussion of the challenges facing quantum optimisation techniques and the need for further research and development to identify new, effective methods for achieving quantum advantage.

show abstract