Pith. sign in

REVIEW 1 cited by

X-ResQ: Reverse Annealing for Quantum MIMO Detection with Flexible Parallelism

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.18778 v2 pith:7A6QTUI4 submitted 2024-02-29 cs.NI quant-ph

classification cs.NIquant-ph
keywords mimox-resqdetectionquantumannealingdetectordetectorsparallelism
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum Annealing (QA)-accelerated MIMO detection is an emerging research approach in the context of NextG wireless networks. The opportunity is to enable large MIMO systems and thus improve wireless performance. The approach aims to leverage QA to expedite the computation required for theoretically optimal but computationally-demanding Maximum Likelihood detection to overcome the limitations of the currently deployed linear detectors. This paper presents X-ResQ, a QA-based MIMO detector system featuring fine-grained quantum task parallelism that is uniquely enabled by the Reverse Annealing (RA) protocol. Unlike prior designs, X-ResQ has many desirable system properties for a parallel QA detector and has effectively improved detection performance as more qubits are assigned. In our evaluations on a state-of-the-art quantum annealer, fully parallel X-ResQ achieves near-optimal throughput (over 10 bits/s/Hz) for $4\times6$ MIMO with 16-QAM using six levels of parallelism with 240 qubits and $220~\mu$s QA compute time, achieving 2.5--5$\times$ gains compared against other tested detectors. For more comprehensive evaluations, we implement and evaluate X-ResQ in the non-quantum digital setting. This non-quantum X-ResQ demonstration showcases the potential to realize ultra-large $1024\times1024$ MIMO, significantly outperforming other MIMO detectors, including the state-of-the-art RA detector classically implemented in the same way.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering

    cs.ET 2026-01 conditional novelty 6.0 of 10

    A fully on-chip FPGA p-bit parallel-tempering solver with graph sparsification detects 64x64 BPSK MIMO below MMSE at 4.7 ms/instance, and 2D parallel tempering removes the copy-constraint tuning bottleneck with ~250-5...

Pith tools