Quantum Speedup of the Dispersion and Codebook Design Problems

In this article, we propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in c...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on quantum engineering 2024, Vol.5, p.1-16
Hauptverfasser:	Yukiyoshi, Kein, Mikuriya, Taku, Rou, Hyeon Seok, de Abreu, Giuseppe Thadeu Freitas, Ishikawa, Naoki
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Adaptive search techniques Codebook design Combinatorial analysis Complexity theory Design optimization Dicke state Dispersion dispersion problem Grover adaptive search (GAS) index modulation (IM) multiple-access systems Quantum computing Qubits (quantum computing) Search algorithms Search problems Transforms Vector spaces Vectors Wireless communication Wireless communications
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!