Structural Bottlenecks in QAOA Mixer Design: Transport and Causal Reach
Abstract
The choice of mixer is a central design decision in the Quantum Approximate Optimization Algorithm (QAOA), yet different structural limitations of a mixer need not be captured by a single metric. We identify two complementary structural bottlenecks for shallow QAOA: configuration-space transport, which limits how strongly probability can concentrate on high-quality solutions, and finite-depth causal reach, which limits which parts of a problem instance can influence a local objective term. In Part I, we derive first-order mixer-dependent objective bounds in complementary small-β and small-γ regimes. For connected regular mixer graphs, the two leading-order expressions are exactly equivalent through a graph-Laplacian identity and reduce to the same cost-weighted Dirichlet energy. We then derive a non-perturbative upper envelope from the layer-wise ℓ1 spreading of the mixer unitary, yielding a cost-distribution-dependent necessary spreading condition for attaining a target approximation ratio. In Part II, we study the locality bottleneck for MaxCut by augmenting the transverse-field mixer with problem-graph-aligned two-local interactions. The resulting k-hop construction has causal radius at most (k+1)p at depth p; for the k=1 architectures studied numerically, this gives radius 2p. Across cycles, circular ladders, and high-girth regular bipartite graphs, X+XX and X+YY improve the best-found approximation ratios over the standard X mixer at equal depth, while X+YY at depth p comes within about one approximation-ratio point of plain X at depth 2p in the reach-matched cases examined. The unequal performance of the equal-reach XX and YY augmentations shows that satisfying a structural capability does not by itself guarantee performance. Together, the results provide complementary structural insights for mixer design.
Related
- Overcoming Transport Layer Bottlenecks to Quantify Ionic Parameters from Transient Ion Current Measurements of Perovskite Solar Cells
- Depth analysis of the Quantum Approximate Optimization Algorithm with a Grover mixer
- Causal memory and structural complexity of correlated quantum sequences
- Search for dark photon dark matter near 1 meV using a superconducting mixer
- Stages of turbulence generation and decay in a T-shaped mixer
BibTeX
@misc{gulati2026structural,
title = {{Structural Bottlenecks in QAOA Mixer Design: Transport and Causal Reach}},
author = {Jasjyot Singh Gulati and Tharrmashastha SAPV},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40424},
eprint = {2610.40424},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40424},
}
RIS
TY - UNPB
TI - Structural Bottlenecks in QAOA Mixer Design: Transport and Causal Reach
AU - Jasjyot Singh Gulati
AU - Tharrmashastha SAPV
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40424
UR - https://arxiv.org/abs/2610.40424
AB - The choice of mixer is a central design decision in the Quantum Approximate Optimization Algorithm (QAOA), yet different structural limitations of a mixer need not be captured by a single metric. We identify two complementary structural bottlenecks for shallow QAOA: configuration-space transport, which limits how strongly probability can concentrate on high-quality solutions, and finite-depth causal reach, which limits which parts of a problem instance can influence a local objective term. In Part I, we derive first-order mixer-dependent objective bounds in complementary small-β and small-γ regimes. For connected regular mixer graphs, the two leading-order expressions are exactly equivalent through a graph-Laplacian identity and reduce to the same cost-weighted Dirichlet energy. We then derive a non-perturbative upper envelope from the layer-wise ℓ_1 spreading of the mixer unitary, yielding a cost-distribution-dependent necessary spreading condition for attaining a target approximation ratio. In Part II, we study the locality bottleneck for MaxCut by augmenting the transverse-field mixer with problem-graph-aligned two-local interactions. The resulting k-hop construction has causal radius at most (k+1)p at depth p; for the k=1 architectures studied numerically, this gives radius 2p. Across cycles, circular ladders, and high-girth regular bipartite graphs, X+XX and X+YY improve the best-found approximation ratios over the standard X mixer at equal depth, while X+YY at depth p comes within about one approximation-ratio point of plain X at depth 2p in the reach-matched cases examined. The unequal performance of the equal-reach XX and YY augmentations shows that satisfying a structural capability does not by itself guarantee performance. Together, the results provide complementary structural insights for mixer design.
ER -