Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909035274436608 |
|---|---|
| author | Hashemi, Seyedkhashayar Valiante, Elisabetta Rozada, Ignacio Noori, Moslem |
| author_facet | Hashemi, Seyedkhashayar Valiante, Elisabetta Rozada, Ignacio Noori, Moslem |
| contents | The evolution of multiple-input, multiple-output (MIMO) systems requires the efficient detection algorithms to overcome the exponential computational complexity of optimal maximum likelihood detection. Reformulating MIMO detection as a quadratic unconstrained binary optimization (QUBO) problem enables the use of highly parallel, physics-inspired, hardware-accelerated solvers and non-von Neumann architectures. However, embedding continuous-valued QUBO coefficients into hardware introduces quantization noise due to finite precision, which can severely degrade detection accuracy. This paper presents a rigorous analysis of the performance impact of finite-precision, hardware-accelerated QUBO solvers in MIMO detection. We analytically derive the probability distribution functions of the QUBO matrix entries and introduce novel homogeneous and heterogeneous quantization schemes based on either instantaneous channel state information or its statistical features. We further derive a sufficient condition on the precision required to maintain the optimal solution after quantization. Extensive numerical experiments, across various MIMO system sizes and modulation orders (up to 256-QAM), show that heterogeneous quantization matches the full-precision baseline bit error rate using significantly fewer bits than homogeneous approaches. We provide hardware-aware guidelines for selecting the optimal quantization strategy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_11626 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints Hashemi, Seyedkhashayar Valiante, Elisabetta Rozada, Ignacio Noori, Moslem Information Theory Emerging Technologies The evolution of multiple-input, multiple-output (MIMO) systems requires the efficient detection algorithms to overcome the exponential computational complexity of optimal maximum likelihood detection. Reformulating MIMO detection as a quadratic unconstrained binary optimization (QUBO) problem enables the use of highly parallel, physics-inspired, hardware-accelerated solvers and non-von Neumann architectures. However, embedding continuous-valued QUBO coefficients into hardware introduces quantization noise due to finite precision, which can severely degrade detection accuracy. This paper presents a rigorous analysis of the performance impact of finite-precision, hardware-accelerated QUBO solvers in MIMO detection. We analytically derive the probability distribution functions of the QUBO matrix entries and introduce novel homogeneous and heterogeneous quantization schemes based on either instantaneous channel state information or its statistical features. We further derive a sufficient condition on the precision required to maintain the optimal solution after quantization. Extensive numerical experiments, across various MIMO system sizes and modulation orders (up to 256-QAM), show that heterogeneous quantization matches the full-precision baseline bit error rate using significantly fewer bits than homogeneous approaches. We provide hardware-aware guidelines for selecting the optimal quantization strategy. |
| title | Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints |
| topic | Information Theory Emerging Technologies |
| url | https://arxiv.org/abs/2605.11626 |