Overcoming computational challenges in air transportation: A quantum computing perspective of the status quo and future applicability

Recent research breakthroughs in quantum computing, such as Microsoft’s topological qubits, hold the promise of revolutionizing complex optimization problems, particularly in the air transportation industry. This study aims to estimate the mid-term scalability of quantum computing in air transportation, focusing on prevalent optimization problems including network design, airline scheduling, and gate assignment. These problems are computationally intensive and often intractable for classical computers due to their highly combinatorial nature. We develop a framework to assess the potential scalability of quantum algorithms for these problems, considering factors such as qubit count and error rates. Our findings suggest that significant advancements in quantum hardware and algorithms are necessary before quantum computing can outperform classical methods in this domain. Therefore, while quantum computing offers a promising tool for solving complex optimization problems in air transportation, its real-world application remains a distant goal. We believe that our work helps guiding researchers and industry professionals in their pursuit of quantum-enhanced air transport solutions.