LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Quantum Speedup for Index Modulation

Photo by jordansteranka from unsplash

This paper 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 (QUBO) problem consisting of… Click to show full abstract

This paper 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 (QUBO) 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. For both formulations, the numbers of required qubits and non-zero elements in QUBO matrices are analyzed algebraically, and found to be in close agreement with the actual measurement. It is observed that the Grover adaptive search can provide the quantum speedup for the index selection problem. This promising result implies that the on-off structure of index modulation is suitable for quantum computation, and future fault-tolerant quantum computers may be useful for obtaining high-performance index activation patterns.

Keywords: index modulation; quantum speedup; problem; speedup index; index

Journal Title: IEEE Access
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.