Quantum Computing for Airline Planning and Operations
Licentiate thesis, 2023
(QAOA) and Quantum Annealing (QA). We present a heuristic that integrates these quantum algorithms into the existing classical algorithm, which is currently employed to solve airline planning problems in a state-of-the-art commercial solver. We perform numerical simulations of QAOA circuits and find that linear and quadratic algorithm depth in the input size can be required to obtain a one-shot success probability of 0.5. Unfortunately, we are unable to find performance guarantees. Finally, we perform experiments with D-wave’s newly released QA machine and find that it outperforms 2000Q for most instances.
quantum technology
Author
Marika Svensson
Chalmers, Microtechnology and Nanoscience (MC2), Applied Quantum Physics
Hybrid Quantum-Classical Heuristic to Solve Large-Scale Integer Linear Programs
Physical Review Applied,;Vol. 20(2023)
Journal article
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Quantum Information Processing,;Vol. 21(2022)
Journal article
Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem
Physical Review Applied,;Vol. 14(2020)
Journal article
Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm
Physical Review Applied,;Vol. 14(2020)
Journal article
Wallenberg Centre for Quantum Technology (WACQT)
Knut and Alice Wallenberg Foundation (KAW 2017.0449, KAW2021.0009, KAW2022.0006), 2018-01-01 -- 2030-03-31.
Subject Categories (SSIF 2011)
Computational Mathematics
Other Physics Topics
Robotics
Computer Science
Publisher
Chalmers