← 研踪 PaperTrailarXiv:2611.10588 · v1
Initialization masks overcome decoding obstructions in compressed QAOA
首次提交 2026-11-07 16:52
版本更新 2026-11-07 16:52
雷达观测 2026-11-10 11:14
摘要
In compressed quantum optimization, a variational state is converted into a classical assignment by decoding noncommuting observables. We show that this step creates structural restrictions that changing the initialization can remove, even when increasing circuit depth cannot. For an explicit infinite family of connected cubic graphs on vertices, with a fixed Pauli encoding and deterministic sign decoder, every all-plus QAOA circuit has cut at most , at every finite depth and every real angle sequence. A uniform signed product-state mask at fixed depth-one angles has expected cut , an additive advantage ; an infinite subfamily admits an optimal mask. A second construction retains a linear depth-one separation under weak weighted couplings, a bounded cost-angle domain and a specified production-encoder ordering. Noiseless simulations then test classical mask selection before energy optimization. On 1,699 random cubic MaxCut instances, one selected mask achieves mean ratio , versus for the all-plus baseline and for the best of separately optimized random masks. On complete cohorts of weighted MaxCut, sparse Ising, Max-2-XOR and Max-2-SAT, the selected mask also improves on the baseline at every size, but it trails the pool at small sizes and leads it significantly only at the larger MaxCut and Ising sizes. Finite-pool order statistics separate the effect of selection from that of drawing a random mask. The results distinguish decoded expressivity from optimized energy and empirical performance; they do not establish a quantum computational advantage.
作者备注：24 pages, 6 figures, including technical appendices
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-07 16:52 · 最新观测版本
Initialization masks overcome decoding obstructions in compressed QAOA
In compressed quantum optimization, a variational state is converted into a classical assignment by decoding noncommuting observables. We show that this step creates structural restrictions that changing the initialization can remove, even when increasing circuit depth cannot. For an explicit infinite family of connected cubic graphs on vertices, with a fixed Pauli encoding and deterministic sign decoder, every all-plus QAOA circuit has cut at most , at every finite depth and every real angle sequence. A uniform signed product-state mask at fixed depth-one angles has expected cut , an additive advantage ; an infinite subfamily admits an optimal mask. A second construction retains a linear depth-one separation under weak weighted couplings, a bounded cost-angle domain and a specified production-encoder ordering. Noiseless simulations then test classical mask selection before energy optimization. On 1,699 random cubic MaxCut instances, one selected mask achieves mean ratio , versus for the all-plus baseline and for the best of separately optimized random masks. On complete cohorts of weighted MaxCut, sparse Ising, Max-2-XOR and Max-2-SAT, the selected mask also improves on the baseline at every size, but it trails the pool at small sizes and leads it significantly only at the larger MaxCut and Ising sizes. Finite-pool order statistics separate the effect of selection from that of drawing a random mask. The results distinguish decoded expressivity from optimized energy and empirical performance; they do not establish a quantum computational advantage.
查看此版本解读 →查看此版本原文 ↗