A quantum algorithm for solving weapon target assignment problem

Acar E., Hatipoğlu S., YILMAZ İ.

Engineering Applications of Artificial Intelligence, cilt.125, 2023 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 125
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1016/j.engappai.2023.106668
  • Dergi Adı: Engineering Applications of Artificial Intelligence
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, Civil Engineering Abstracts
  • Anahtar Kelimeler: NP-hard problem, Quantum algorithm, Quantum computing, Weapon target assignment
  • İstanbul Gelişim Üniversitesi Adresli: Evet

Özet

Quantum computers, known to have the potential for exponential speedup in solving some problems due to their superposition property, are expected to facilitate the solution of NP-hard optimisation problems. This study proposes a quantum algorithm to solve the weapon target assignment problem (WTAP), one of the NP-hard optimisation problems. The proposed quantum algorithm is a gate-based approach, and scenario examples are executed on Qiskit quantum computing platform and IBM Lima quantum computer with Falcon r4T processor type. The results manifest that the proposed quantum algorithm has low space and time complexity, demonstrating its memory and computational resources efficiency.