When are Quantum Algorithms Applicable for Signal Decoding in Wireless Communication?

Abstract

Multiple-input multiple-output (MIMO) technology utilizes multiple antennas at the transmitter and receiver to enhance data transmission speeds and reliability. Traditional MIMO decoding methods, however, can become increasingly complex as the number of antennas and modulation order rises. Quantum computing brings forth a new realm of information processing with significant potential. This study investigates the applicability of quantum algorithms for decoding information in MIMO wireless communication systems. Specifically, the Dürr-Høyer quantum search, based on Grover’s algorithm, and optimal quantum sorting algorithms are leveraged to reduce the query complexity with an analysis of the complexity and achievable bit error rate performance of the quantum-assisted decoders. The study considers cases of MIMO diversity, spatial modulation, and multiplexing transmission using both maximum-likelihood and fixed-complexity sphere decoders. By examining a variety of communication scenarios, this work aims to assess the applicability of quantum algorithms across different operational regimes and aids in extending the methodology to other communication systems.

Keywords

• Dürr-Høyer (DH) algorithm
• fixed-complexity sphere decoder (FCSD)
• Grover’s algorithm
• maximum-likelihood (ML) decoder
• multiple-input multiple-output (MIMO) communication
• quantum algorithm