Quantum Algorithms for Integer Programming Problems

Date

2023-05

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

This study delves into the potential uses of quantum computing algorithms in solving integer programming optimization problems. Specifically, the research investigates the application of Quantum Walks to address the Generalized Birkhoff Polytope of the Transportation Problem, as well as the application of the hybrid quantum-classical Variational Quantum Eigensolver algorithm to solve the Set partitioning problem. The results of this study highlight the potential of quantum computing to provide efficient solutions to important optimization problems.


Embargo status: Restricted until 06/2025. To request the author grant access, click on the PDF link to the left.

Description

Keywords

Optimization, Quantum Optimization, Integer Programming, Quantum Computing, Set Partitioning Problem, Transportation Problem, Quantum Walks, Birkhoff Polytope, VQE

Citation