Quantum Speedup for Index Modulation

Abstract

This letter presents a quantum-assisted index modulation for next-generation IoT wireless networks. The NP-hard index selection problem is first formulated by a quadratic unconstrained binary optimization problem consisting of constraints of feasible solutions. To minimize the number of qubits required for a quantum circuit, this formulation is then simplified by a dictionary-based approach that partially exploits a classical computer. It is observed that the Grover adaptive search can provide the quantum speedup for the index selection problem. This promising result implies that a future fault-tolerant quantum computer may be useful for solving optimization problems encountered in wireless communications.