Exploring Airline Gate-Scheduling Optimization Using Quantum Computers

Abstract

This paper investigates the application of quantum computing technology to airline gate-scheduling quadratic assignment problems (QAP). We explore the quantum computing hardware architecture and software environment required for porting classical versions of these type of problems to quantum computers. We discuss the variational quantum eigensolver and the inclusion of space-efficient graph coloring to the Quadratic Unconstrained Binary Optimization (QUBO). These enhanced quantum computing algorithms are tested with an 8 gate and 24 flight test case using both the IBM quantum computing simulator and a 27 qubit superconducting transmon IBM quantum computing hardware platform.

References in corpus (10)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• A Quantum Approximate Optimization Algorithm
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Accelerated Variational Quantum Eigensolver
• Flight Gate Assignment with a Quantum Annealer
• Quantum Computer Architecture: Towards Full-Stack Quantum Accelerators
• Airport Gate Scheduling for Passengers, Aircraft, and Operation