Híradástechnika/Infocommunications journal

Exploring Embeddings for MIMO Channel Decoding on Quantum Annealers

Ádám Marosits, Zsolt Tabi, Zsófia Kallus, Péter Vaderna, István Gódor, Zoltán Zimborás

Published Jan 1, 2021• 6 citations

Abstract

Quantum Annealing provides a heuristic method leveraging quantum mechanics for solving Quadratic Unconstrained Binary Optimization problems. Existing Quantum Annealing processing units are readily available via cloud platform access for a wide range of use cases. In particular, a novel device, the D-Wave Advantage has been recently released. In this paper, we study the applicability of Maximum Likelihood (ML) Channel Decoder problems for MIMO scenarios in centralized RAN. The main challenge for exact optimization of ML decoders with ever-increasing demand for higher data rates is the exponential increase of the solution space with problem sizes. Since current 5G solutions can only use approximate methodologies, Kim et al. [1] leveraged Quantum Annealing for large MIMO problems with phase shift keying and quadrature amplitude modulation scenarios. Here, we extend upon their work and present embedding limits for both more complex modulation and higher receiver / transmitter numbers using the Pegasus P16 topology of the D-Wave Advantage system.

DOI: 10.36244/icj.2021.1.2

Related papers

Evaluation of Quantum Annealer Performance via the Massive MIMO Problem

Zsolt Tabi, Ádám Marosits, Zsófia Kallus +3 more

Quantum annealing offers an appealing route to handle large-scale optimization problems. Existing Quantum Annealing processing units are readily available via cloud platform access for solving Quadratic Unconstrained Binary Optimization (QUBO) problems. In particular, the novel D-Wave Advantage device has been recently released. Its performance is expected to improve upon the previous state-of-the-art D-Wave 2000Q annealer, due to higher number of qubits and the Pegasus topology. Here, we present a comparative study via an ensemble of Maximum Likelihood (ML) Channel Decoder problems for MIMO scenarios in Centralized Radio Access Network (C-RAN) architectures. The main challenge for exact optimization of ML decoders with ever-increasing demand for higher data rates is the exponential increase of the solution space with problem sizes. Since current 5G solutions mainly use approximate methodologies, Kim et al. leveraged Quantum Annealing for large MIMO problems with Phase Shift Keying and Quadrature Amplitude Modulation scenarios. Here, we extend their work and analyze experiments for more complex modulations and larger MIMO antenna array sizes. By implementing the extended QUBO formulae on the novel annealer architecture, we uncover the limits of state-of-the-art quantum optimization for the massive MIMO ML decoder. We report on the improvements and discuss the uncovered limiting factors learned from the 64-QAM extension. We include the enhanced evaluation of raw annealer sampling via implementation of post-processing methods in the comparative analysis between D-Wave 2000Q and D-Wave Advantage system.

IEEE AccessJan 1, 202130 citations

Leveraging quantum annealing for large MIMO processing in centralized radio access networks

Minsung Kim, Davide Venturelli, Kyle Jamieson

User demand for increasing amounts of wireless capacity continues to outpace supply, and so to meet this demand, significant progress has been made in new MIMO wireless physical layer techniques. Higher-performance systems now remain impractical largely only because their algorithms are extremely computationally demanding. For optimal performance, an amount of computation that increases at an exponential rate both with the number of users and with the data rate of each user is often required. The base station's computational capacity is thus becoming one of the key limiting factors on wireless capacity. QuAMax is the first large MIMO centralized radio access network design to address this issue by leveraging quantum annealing on the problem. We have implemented QuAMax on the 2,031 qubit D-Wave 2000Q quantum annealer, the state-of-the-art in the field. Our experimental results evaluate that implementation on real and synthetic MIMO channel traces, showing that 10 µs of compute time on the 2000Q can enable 48 user, 48 AP antenna BPSK communication at 20 dB SNR with a bit error rate of 10-6 and a 1,500 byte frame error rate of 10-4.

arXiv:2001.04014ACM Special Interest Group on Data CommunicationAug 14, 201997 citations

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

Abdulmohsen A. Alsaui, Ibrahim Al-Nahhal, Octavia A. Dobre

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.

IEEE Open Journal of the Communications SocietyJan 1, 20246 citations

Quantum Annealing with Post-processing of Maximum Likelihood for LDPC Decoding

Yuhang Guo, Han Zeng, Feng Xiong +3 more

In the forthcoming 6G era, driven by the escalating demands for enhanced performance and reliability in communication systems, Low-Density Parity-Check (LDPC) codes emerge as a robust error correction coding scheme poised to effectively meet these requirements. In recent years, with the advancement of quantum computing, a proposal has emerged to integrate classical and quantum computing for the decoding of LDPC. The LDPC decoding can be treated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, thereby allowing the utilization of the D-Wave 2000Q quantum annealer for solving it. Expanding on this groundwork, the paper proposes an approach to enhance quantum annealing performance using classical algorithms. Specifically, it involves performing quantum annealing on the problem first, followed by post-processed using Maximum Likelihood Estimation (MLE) for the multiple outputs, known as QAML. Furthermore, to fully exploit the advantages of quantum annealing, this paper incorporates the energy and frequency of occurrence of candidate codewords as prior information into the Maximum Likelihood Estimation. These are called QAMLE and QAMLF respectively, further enhancing decoding performance. The proposed method is evaluated and compared with direct Quantum Annealing (QA) and Quantum Annealing with post-processing using Minimum Distance (QAMD). Research findings indicate that QAML exhibits a lower bit error rate compared to QA and QAMD.

Information Communication Technologies Conference (ICTC)May 10, 20241 citation

MIMO With 1-b Pre/Postcoding Resolution: A Quantum Annealing Approach

Ioannis Krikidis

In this article, we study the problem of digital pre/postcoding design in multiple-input multiple-output (MIMO) systems with 1-b resolution per complex dimension. The optimal solution that maximizes the received signal-to-noise ratio relies on an NP-hard combinatorial problem that requires exhaustive searching with exponential complexity. By using the principles of alternating optimization and quantum annealing (QA), an iterative QA-based algorithm is proposed that achieves near-optimal performance with polynomial complexity. The algorithm is associated with a rigorous mathematical framework that casts the pre/postcoding vector design to appropriate real-valued quadratic unconstrained binary optimization (QUBO) problems. Experimental results in a state-of-the-art D-WAVE QA device validate the efficiency of the proposed algorithm. To further improve the efficiency of the D-WAVE quantum device, a new preprocessing technique, which preserves the quadratic QUBO matrix from the detrimental effects of the Hamiltonian noise through nonlinear companding, is proposed. The proposed preprocessing technique significantly improves the quality of the D-WAVE solutions as well as the occurrence probability of the optimal solution.

IEEE Transactions on Quantum EngineeringJan 1, 20246 citations

MIMO with 1-bit Pre/Post-Coding Resolution: A Quantum Annealing Approach

Ioannis Krikidis

In this paper, we study the problem of digital pre/post-coding design in multiple-input multiple-output (MIMO) systems with 1-bit resolution per complex dimension. The optimal solution that maximizes the received signal-to-noise ratio relies on an NP-hard combinatorial problem that requires exhaustive searching with exponential complexity. By using the principles of alternating optimization and quantum annealing (QA), an iterative QA-based algorithm is proposed that achieves near-optimal performance with polynomial complexity. The algorithm is associated with a rigorous mathematical framework that casts the pre/post-coding vector design to appropriate real-valued quadratic unconstrained binary optimization (QUBO) problems. Experimental results in a state-of-the-art D-WAVE QA device validate the efficiency of the proposed algorithm. To further improve the efficiency of the D-WAVE quantum device, a new pre-processing technique which preserves the quadratic QUBO matrix from the detrimental effects of the Hamiltonian noise through non-linear companding, is proposed. The proposed pre-processing technique significantly improves the quality of the D-WAVE solutions as well as the occurrence probability of the optimal solution.

arXiv:2406.04708Jun 7, 20240 citations