Quantum Computing Approaches for Mission Covering Optimization

Abstract

Quantum computing has the potential to revolutionize the way hard computational problems are solved in terms of speed and accuracy. Quantum hardware is an active area of research and different hardware platforms are being developed. Quantum algorithms target each hardware implementation and bring advantages to specific applications. The focus of this paper is to compare how well quantum annealing techniques and the QAOA models constrained optimization problems. As a use case, a constrained optimization problem called mission covering optimization is used. Quantum annealing is implemented in adiabatic hardware such as D-Wave, and QAOA is implemented in gate-based hardware such as IBM. This effort provides results in terms of cost, timing, constraints held, and qubits used.

Quantum-Walk-Inspired Dynamic Adiabatic Local Search

“…Investigating relationships among the frameworks helps to identify violations when mapping frameworks and potential solutions. By studying the mapping, one can extend the techniques from one framework to another for some potential improvement in terms of speed [ 26 ].…”

Performance and Applicability of Post-Quantum Digital Signature Algorithms in Resource-Constrained Environments

“…The potential of quantum computing is continuously enhanced by exploring hardwarespecific quantum algorithms, advancing the theoretical framework for quantum heuristics [1,2], and by contributing to a broad array of other applications that drive the field's overall development. Thereby, the existing cryptographic methods face unprecedented threats.…”