Related papers: M-QAM MIMO Maximum-Likelihood Detection with QAOA: ML-Rate Offline Angle Design and Correlated Infinite-Size Spin-Glass Models

M-QAM MIMO Maximum-Likelihood Detection with QAOA: ML-Rate Offline Angle Design and Correlated Infinite-Size Spin-Glass Models

URL: http://arxiv.org/abs/2608.17721v1
Date: Tue, 18 Aug 2026 12:45:47 GMT
Title: M-QAM MIMO Maximum-Likelihood Detection with QAOA: ML-Rate Offline Angle Design and Correlated Infinite-Size Spin-Glass Models
Abstract summary: The quantum approximate optimization algorithm (QAOA) targets NP-hard maximum-likelihood (ML) detection in multiple-input multiple-output (MIMO) systems.<n>Tests reach 4096-QAM, 128 antennas, $p=30$ and per-symbol SNR 0-45 dB.<n>The approach points toward near-optimum decoding on deeper noiseless fault-tolerant quantum (FTQ) circuits.
Score: 9.13755431537592
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: The quantum approximate optimization algorithm (QAOA) targets NP-hard maximum-likelihood (ML) detection in multiple-input multiple-output (MIMO) systems. Existing $M$-ary quadrature amplitude modulation (M-QAM) detectors design angles by expected Ising energy: online per instance, warm-started, or ramped, while train-once designs remain B/QPSK-only or block-local, leaving M-QAM without a size-scalable benchmark. Their infinite-size spin-glass theory assumes independent disorder, matching the retained covariances at B/QPSK but not M-QAM's correlated couplings and fields. We develop a correlated infinite-size multi-species spin-glass framework whose covariance-matched evaluators make that energy an offline objective with a size-scalable benchmark. In addition, the ML rate, the exponential rate of sampling the ML string, is for the first time exploited for QAOA angle design in MIMO detection. The energy evaluator is $q$-free at $O(p\,4^p)$ cost while the ML rate transfers angles from a fixed $q_{\rm ref}$-qubit reference. Tests reach 4096-QAM, 128 antennas, $p=30$ and per-symbol SNR 0-45 dB. In simulations, ML rates fall as a power law $r_0\,p^{-α}$, with larger exponents for the sampling design, which tracks exact ML at $5\times5$ 16-QAM (0-20 dB) and $3\times3$ 64-QAM (8-28 dB) while its bit-error rate (BER) advantage widens with SNR to two orders of magnitude. The approach points toward near-optimum decoding on deeper noiseless fault-tolerant quantum (FTQ) circuits.

Related papers

Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms [42.57939149964391]
We study quantum multi-armed bandits (QMAB) and quantum linear bandits (QLB)<n>We prove the first minimax lower bounds of $(Klog(T/K))$ for QMAB and $(dlog(T/d))$ for finite-action QLB.
arXiv Detail & Related papers (2026-08-14T14:04:21Z)
SSTQ:Privacy-Preserving Vector Quantization via Subsampled Stochastic TurboQuant [79.24089819400126]
Subsampled TurboQuant (SSTQ) is a framework that combines overcomplete equal-width tight frames, coordinate subsampling, and privacy-aware quantization.<n>SSTQ achieves mean squared error scaling while using only $lceil log N il + b$ bits per client, where $N = (d)$ is the frame size.<n>We also derive a surrogate privacy-aware codebook objective that reduces the codebook-dependent MSE scaling from $O(4b)$ to $O(2b)$.
arXiv Detail & Related papers (2026-08-05T17:51:25Z)
Offline Channel-Independent QAOA Angles for RIS Power Aggregation: Unit-Circle Phase Dictionaries and Infinite-Size Spin-Glass Limits [0.0]
We introduce a $2M$-phase $$ dictionary for optimizing power on reconfigurable surfaces.<n>We observe performance reaching a near-optimal multi-start single-flip local-search reference for $N!le!16$ under order-2 modeling.<n>The approach suggests a route to near-optimal large-$N$ performance on future fault-tolerant (FTQ) quantum computers.
arXiv Detail & Related papers (2026-06-23T13:07:10Z)
QANTIS: A Hardware-Validated Quantum Platform for POMDP Planning and Multi-Target Data Association [4.11040996037715]
We present QS, a modular platform that integrates quantum belief update (Grover amplitude amplification and BIQAE), QUBO-based data association via FPC-QAOA, and composable error mitigation.<n>On hardware, a single Grover iterate applied to a Tiger belief oracle amplifies a rare observation probability from $0.179$ to $9.07$ ($5.1times$; ISA 18) while preserving the Bayesian posterior.<n>We further demonstrate, to our knowledge, the first closed-loop hybrid quantum-classical Tiger POMDP on superconducting hardware.
arXiv Detail & Related papers (2026-02-28T19:13:44Z)
Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z)
Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs [1.0765359420035392]
We show that the Quantum Approximate Optimization Algorithm (QAOA) for higher-order, random-coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes. We show that the best quantum processors generally find lower energy solutions up to $p=3$ for 27 qubit systems and up to $p=2$ for 127 qubit systems.
arXiv Detail & Related papers (2023-12-02T01:47:05Z)
Quantum Multi-Parameter Adaptive Bayesian Estimation and Application to Super-Resolution Imaging [1.4222887950206657]
In quantum sensing tasks, the user gets $rho_theta$, the quantum state that encodes $theta$. Personick found the optimum POVM $Pi_l$ that minimizes the MMSE over all possible measurements. This result from 1971 is less-widely known than the quantum Fisher information (QFI), which lower bounds the variance of an unbiased estimator.
arXiv Detail & Related papers (2022-02-21T04:12:55Z)
Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning [59.71676469100807]
This work sharpens the sample complexity of synchronous Q-learning to an order of $frac|mathcalS|| (1-gamma)4varepsilon2$ for any $0varepsilon 1$. Our finding unveils the effectiveness of vanilla Q-learning, which matches that of speedy Q-learning without requiring extra computation and storage.
arXiv Detail & Related papers (2021-02-12T14:22:05Z)
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity [67.02490430380415]
We show that model-based MARL achieves a sample complexity of $tilde O(|S||B|(gamma)-3epsilon-2)$ for finding the Nash equilibrium (NE) value up to some $epsilon$ error. We also show that such a sample bound is minimax-optimal (up to logarithmic factors) if the algorithm is reward-agnostic, where the algorithm queries state transition samples without reward knowledge.
arXiv Detail & Related papers (2020-07-15T03:25:24Z)
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
arXiv Detail & Related papers (2020-06-04T17:51:00Z)
Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.