Exploring Airline Gate-Scheduling Optimization Using Quantum Computers

Mohammadbagherpoor, Hamed; Dreher, Patrick; Ibrahim, Mohannad; Oh, Young-Hyun; Stone, Richard E.; Stojković, Mirela

doi:10.48550/arxiv.2111.09472

Cited by 3 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is clear that the problem size is an important factor as the currently available quantum solvers are limited in the number of qubits. There are several works that try to formulate models that are more efficient in the number of qubits used [7,18,31,36] and further research can be pursued in this direction.…”

Section: Discussionmentioning

confidence: 99%

Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing

Glos¹,

Kundu²,

Salehi³

2022

Preprint

View full text Add to dashboard Cite

Optimization of pre-production vehicle configurations is one of the challenges in the automotive industry. Given a list of tests requiring cars with certain features, it is desirable to find the minimum number of cars that cover the tests and obey the configuration rules. In this paper, we model the problem in the framework of satisfiability and solve it by utilizing the newly introduced hybrid constrained quadratic model (CQM) solver provided by D-Wave. The problem definition is based on the "Optimizing the Production of Test Vehicles" use case given in the BMW Quantum Computing Challenge. We formulate a constrained quadratic model for the problem and use a greedy algorithm to configure the cars. We benchmark the results obtained from the CQM solver with the results from the classical solvers like CBC (Coin-or branch and cut) and Gurobi. We conclude that the performance of the CQM solver is comparable to classical solvers in optimizing the number of test vehicles. As an extension to the problem, we describe how the scheduling of the tests can be incorporated into the model.

show abstract

Section: Discussionmentioning

confidence: 99%

Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing

Glos¹,

Kundu²,

Salehi³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Instead, they are amenable to noisy intermediate-scale quantum (NISQ) devices (see, e.g., Refs. [1,[4][5][6][7][8][9][10] for various proof-ofprinciple demonstrations). While such algorithms are typically heuristics without proven performance guarantees, there are indications that VQAs can outperform classical algorithms for certain computationally hard problems.…”

Section: Introductionmentioning

confidence: 99%

“…One method for mitigating this issue is to constrain the algorithm to only search the feasible subspace. This idea was originally proposed for quantum annealing [18] and later adapted to variational algorithms [10,19]. The applicability of the latter approach for FGA was investigated by deriving suitable algorithmic primitives for constraint invariance [20].…”

Section: Introductionmentioning

confidence: 99%

“…The applicability of the latter approach for FGA was investigated by deriving suitable algorithmic primitives for constraint invariance [20]. Reference [10] implemented a proof-of-principle VQE for the FGA problem using an encoding incorporating some of the constraints on IBM's quantum hardware, thus demonstrating the suitability of problem for digital quantum devices.…”

Section: Introductionmentioning

confidence: 99%

“…We adopt an encoding that avoids a dominant subspace of invalid solutions, which is similar to the one of Ref. [10], with the addition of a cyclic mapping. Our study demonstrates that utilizing this encoding, the CVaR-VQE performs significantly better than the naive encoding used in previous works.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer

Chai¹,

Funcke²,

Hartung³

et al. 2023

Preprint

View full text Add to dashboard Cite

We investigate the performance of the variational quantum eigensolver (VQE) for the optimal flight gate assignment problem. This problem is a combinatorial optimization problem that aims at finding an optimal assignment of flights to the gates of an airport, in order to minimize the passenger travel time. To study the problem, we adopt a qubit-efficient binary encoding with a cyclic mapping, which is suitable for a digital quantum computer. Using this encoding in conjunction with the Conditional Value at Risk (CVaR) as an aggregation function, we systematically explore the performance of the approach by classically simulating the CVaR-VQE. Our results indicate that the method allows for finding a good solution with high probability, and the method significantly outperforms the naive VQE approach. We examine the role of entanglement for the performance, and find that ansätze with entangling gates allow for better results than pure product states. Studying the problem for various sizes, our numerical data show that the scaling of the number of cost function calls for obtaining a good solution is not exponential for the regimes we investigate in this work.

show abstract

Evaluation of Parameterized Quantum Circuits With Cross-Resonance Pulse-Driven Entanglers

Ibrahim

Mohammadbagherpoor

Rios

et al. 2022

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for a VQA is crucial to its overall performance, especially on near-term devices. In this paper, we utilize pulse-level access to quantum machines, our understanding of their twoqubit interactions, and, more importantly, our knowledge of VQAs, to customize the design of two-qubit entanglers. Our analysis shows that utilizing customized pulse gates for ansatze reduces state preparation times by more than half, maintains expressibility relative to standard ansatze, and produces PQCs that are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Experiments using IBM Quantum hardware demonstrate that our pulse-based PQC configurations are more capable of solving MaxCut and Chemistry problems compared to a standard configuration. INDEX TERMSQuantum computing, variational quantum algorithms (VQAs), parameterized quantum circuits (PQCs), pulse level control, hamiltonian tomography, barren-plateaus VOLUME 4, 2016 1 This article has been accepted for publication in IEEE Transactions on Quantum Engineering.

show abstract

Exploring Airline Gate-Scheduling Optimization Using Quantum Computers

Cited by 3 publications

References 18 publications

Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing

Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing

Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer

Evaluation of Parameterized Quantum Circuits With Cross-Resonance Pulse-Driven Entanglers

Contact Info

Product

Resources

About