返回
Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem
DOI:10.1103/PhysRevApplied.14.034009.png)
摘要
En 中文
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.
Keyword:
SIMPLEX-METHOD
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
7.1K
被引数:
2.8W
机构
引用论文
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
SCIENTIFIC REPORTS
IF3.9
Facile Synthesis, Characterization, Nanocrystal Growth and Photoluminescence Properties of GeS Nanowires
Nano
IF0
Mechanical, but not infective, pacemaker erosion may be successfully managed by re-implantation of pacemakers.
Heart
IF0

