Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Quantum Variational Algorithms for the Aircraft Deconfliction Problem

Tomasz Pecyna, Krzysztof Kurowski, Rafał Różycki, Grzegorz Waligóra, Jan Węglarz

Published Jan 1, 2024• 1 citation
Publisher
DOI
10.1007/978-3-031-63778-0_22

Related papers

Improved variational algorithms for optimization problems in a quantum computer

Panagiotis Kl. Barkoutsos, Anton Robert, Giacomo Nannicini +2 more

Bulletin of the American Physical Society•Mar 5, 2019•0 citations

Variational quantum algorithms

Marco Cerezo, Andrew Arrasmith, Ryan Babbush +8 more

arXiv:2012.09265•Nature Reviews Physics•Aug 12, 2021•4,270 citations

Improving Quantum Optimization Algorithms by Constraint Relaxation

Tomasz Pecyna, Rafał Różycki

Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational-Hamiltonian-based algorithms, struggle to present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning, but they often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for a quantum approximate optimization algorithm that satisfies all the requirements to correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities for finding solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in a linear instead of exponential number of entanglement gates instead and superior performance compared to standard formulations. Specifically, we achieve a higher probability of finding feasible solutions: finding solutions in nine out of nine instances compared to standard Hamiltonian formulations and quadratic programming formulations known from quantum annealers, which only found solutions in seven out of nine instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

Applied Sciences•Sep 10, 2024•3 citations

Variational Quantum Algorithms for A System of Linear Equations

D. (Dildora) Muhamediyeva

•Dec 1, 2023•0 citations

Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem

Pontus Vikstål, Mattias Grönkvist, Marika Svensson +3 more

Airlines today are faced with a number of large-scale scheduling problems. One such problem is the tail-assignment problem, which is the task of assigning individual aircraft to a given set of flights, minimizing the overall cost. Each aircraft is identified by the registration number on its tail fin. In this paper, we simulate the quantum approximate optimization algorithm (QAOA) applied to instances of this problem derived from real-world data. The QAOA is a variational hybrid quantum-classical algorithm recently introduced and likely to run on near-term quantum devices. The instances are reduced to fit on quantum devices with 8, 15, and 25 qubits. The reduction procedure leaves only one feasible solution per instance, which allows us to map the tail-assignment problem onto the exact-cover problem. We find that repeated runs of the QAOA identify the feasible solution with close to unit probability for all instances. Furthermore, we observe patterns in the variational parameters such that an interpolation strategy can be employed, which significantly simplifies the classical optimization part of the QAOA. Finally, we empirically find a relation between the connectivity of the problem graph and the single-shot success probability of the algorithm.

arXiv:1912.10499•Physical Review Applied•Sep 3, 2020•107 citations

Quantum Approach to Optimize Aircraft Cargo Loading

Varsha Nayak, Varun Sahu

Proper planning is required for arranging cargos of different types, sizes and weights across the aircraft, so that the aircraft can fly safely with lesser fuel consumption and its payload capabilities can be utilized to the fullest, to maximize the revenue. Furthermore, along with the optimal loading, considering minimization of the loading/unloading operations at multiple stopovers adds complexity to the planning. In this paper, we present the quantum approach to address these two real-world challenges faced by the aviation industry, that is, maximizing the payload capacity of the aircraft and minimizing the loading/unloading operations across multiple stopovers. We experimented with both quantum annealing based and gate-based algorithms. As per our findings with respect to the performance and capabilities of the quantum platforms, we found D-Wave to be the most promising one as it supports enough qubits to address a realistic problem as compared to gate-based and quantum inspired optimizers. So further experimentation was carried out using D-Wave on Boeing 747-SF aircraft, one of the largest cargo carriers. Since in this work, our study is restricted to Boeing 747-8F aircraft, we can address different models of cargo aircrafts, transportation of cargo in the lower deck of passenger aircraft as a future scope of work, and work with different modes of transit system such as ships, trucks, rails.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Oct 13, 2022•2 citations
Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational-Hamiltonian-based algorithms, struggle to present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning, but they often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for a quantum approximate optimization algorithm that satisfies all the requirements to correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities for finding solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in a linear instead of exponential number of entanglement gates instead and superior performance compared to standard formulations. Specifically, we achieve a higher probability of finding feasible solutions: finding solutions in nine out of nine instances compared to standard Hamiltonian formulations and quadratic programming formulations known from quantum annealers, which only found solutions in seven out of nine instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.
Airlines today are faced with a number of large-scale scheduling problems. One such problem is the tail-assignment problem, which is the task of assigning individual aircraft to a given set of flights, minimizing the overall cost. Each aircraft is identified by the registration number on its tail fin. In this paper, we simulate the quantum approximate optimization algorithm (QAOA) applied to instances of this problem derived from real-world data. The QAOA is a variational hybrid quantum-classical algorithm recently introduced and likely to run on near-term quantum devices. The instances are reduced to fit on quantum devices with 8, 15, and 25 qubits. The reduction procedure leaves only one feasible solution per instance, which allows us to map the tail-assignment problem onto the exact-cover problem. We find that repeated runs of the QAOA identify the feasible solution with close to unit probability for all instances. Furthermore, we observe patterns in the variational parameters such that an interpolation strategy can be employed, which significantly simplifies the classical optimization part of the QAOA. Finally, we empirically find a relation between the connectivity of the problem graph and the single-shot success probability of the algorithm.
Proper planning is required for arranging cargos of different types, sizes and weights across the aircraft, so that the aircraft can fly safely with lesser fuel consumption and its payload capabilities can be utilized to the fullest, to maximize the revenue. Furthermore, along with the optimal loading, considering minimization of the loading/unloading operations at multiple stopovers adds complexity to the planning. In this paper, we present the quantum approach to address these two real-world challenges faced by the aviation industry, that is, maximizing the payload capacity of the aircraft and minimizing the loading/unloading operations across multiple stopovers. We experimented with both quantum annealing based and gate-based algorithms. As per our findings with respect to the performance and capabilities of the quantum platforms, we found D-Wave to be the most promising one as it supports enough qubits to address a realistic problem as compared to gate-based and quantum inspired optimizers. So further experimentation was carried out using D-Wave on Boeing 747-SF aircraft, one of the largest cargo carriers. Since in this work, our study is restricted to Boeing 747-8F aircraft, we can address different models of cargo aircrafts, transportation of cargo in the lower deck of passenger aircraft as a future scope of work, and work with different modes of transit system such as ships, trucks, rails.