---
title: D-regular Max-k-XORSAT
url: https://www.emergentmind.com/topics/d-regular-max-k-xorsat
type: topic
---

# D-regular Max-k-XORSAT

D-regular Max-k-XORSAT is the optimization problem of maximizing the number of satisfied parity constraints in a \(k\)-uniform instance where each variable appears in exactly \(D\) constraints. In the \(\{\pm1\}\) hypergraph formulation often used in the regular setting, with signs \(J_{i_1\ldots i_k}\in\{\pm1\}\), the cost function is
\[
C^{\text{XOR}}_J(z)=\sum_{(i_1,\dots,i_k)\in E} \frac12\bigl(1 + J_{i_1\ldots i_k}\, z_{i_1}\cdots z_{i_k}\bigr),
\]
and MaxCut is recovered at \(k=2\) with all \(J_{ij}=-1\) [2110.14206]. The subject sits at the intersection of bounded-degree approximation, sparse linear algebra over \(\mathbb F_2\), random regular hypergraph geometry, LDPC decoding, and quantum optimization. In the bounded-degree worst case, the optimal additive scale above random assignment is \(1/\sqrt D\) [1505.03424, 2606.13570]; in average-case regular ensembles, the problem admits detailed analyses via QAOA and via reductions to decoding of regular LDPC codes [2110.14206, 2604.24633].

## 1. Formal model and regular-ensemble conventions

In the standard Boolean optimization form, Max-k-XORSAT is a system \(Bx=v \pmod 2\) with \(B\in\{0,1\}^{m\times n}\), each row having Hamming weight \(k\), and objective
\[
\min_{x\in\mathbb F_2^n} |Bx-v|,
\]
equivalently maximizing the number of satisfied constraints \(m-|Bx-v|\). In a \((k,D)\)-regular instance, every row has exactly \(k\) ones and every column has exactly \(D\) ones, so \(mk=nD\); the associated Tanner graph is \((k,D)\)-biregular. In the LDPC language used for Gallager ensembles, the primal code is \(C=\{Bx:x\in\mathbb F_2^n\}\subseteq\mathbb F_2^m\) and the dual code is \(C^\perp=\{d\in\mathbb F_2^m:B^Td=0\}\) [2604.24633].

Two regular conventions coexist in the literature. In bounded-degree approximation results, \(D\) is the variable-degree bound itself, so a D-regular instance is the special case \(\deg(i)=D\) for all variables [1505.03424]. In the large-girth QAOA analysis, the hypergraph is \((D+1)\)-regular, with \(|E|=n(D+1)/q\), and the cost Hamiltonian is normalized by \(\sqrt D\); the resulting formulas therefore use \(D\) as the asymptotic degree parameter even though the literal vertex degree is \(D+1\) [2110.14206]. The distinction is purely notational but matters when comparing formulas across papers.

On random regular instances, the dominant ensemble in the decoding literature is Gallager’s \((k,D)\) ensemble, which produces a random \((k,D)\)-regular bipartite graph and thereby a regular LDPC code [2604.24633]. In the QAOA literature, the dominant ensemble is instead a large-girth regular hypergraph, where girth \(>2p+1\) ensures that every depth-\(p\) neighborhood is a \(D\)-ary \(q\)-uniform hypertree [2110.14206].

## 2. Solution-space geometry, cores, and clustering

The sharpest structural results currently available concern the standard random \(k\)-XORSAT ensemble with fixed clause size \(k\) and asymptotically Poisson variable degrees, not D-regular Max-k-XORSAT directly. In that model, the exact solution set \(\mathsf S=\{x\in\{0,1\}^n:Hx=b\}\) undergoes a sharp clustering transition at \(\alpha_d(k)\), and this threshold coincides with the 2-core threshold. Below \(\alpha_d(k)\), the entire solution set has large conductance under polylogarithmic Hamming moves; above \(\alpha_d(k)\), the solution space decomposes into exponentially many clusters separated by linear Hamming distance, while each individual cluster still has large internal conductance because it admits a polylogarithmically sparse basis [1107.5377].

That picture is not a theorem for D-regular Max-k-XORSAT, but it is the natural structural template. In a D-regular family, the density parameter is \(\alpha=m/n=D/k\), the incidence graph is locally tree-like with fixed offspring rather than Poisson offspring, and the same notions of 2-core, backbone, and periphery remain meaningful. This suggests that a corresponding regular-core threshold should control the onset of shattering, with exact solutions or near-optimal assignments organized around core configurations and extensive periphery degrees of freedom [1107.5377].

A closely related algorithmic phenomenon is known for sequential local algorithms in the Poisson-degree random \(k\)-XORSAT model. There, for any \(r>r_{\mathrm{core}}(k)\), sequential local algorithms with certain local rules fail with high probability; this includes Unit Clause Propagation for \(k\ge 9\) and local rules that compute exact marginals on trees, including Belief Propagation and Survey Propagation, for \(k\ge 13\) [2404.17775]. A plausible implication is that once a regular 2-core with analogous overlap-gap structure emerges, local decimation-based methods should encounter the same topological barrier in D-regular ensembles.

## 3. Worst-case approximability at bounded degree

For bounded-degree Max-k-XOR, the central worst-case fact is that degree control changes the approximation landscape. For any odd \(k\), there is a randomized polynomial-time algorithm that, on any instance of Max-kXOR with degree at most \(D\), finds an assignment satisfying at least
\[
\frac12 + \frac{c}{\sqrt D},
\]
where \(c=\exp(-O(k))\); since a D-regular instance is a special case of degree at most \(D\), this applies directly to D-regular Max-k-XORSAT [1505.03424]. The same paper shows that the \(1/\sqrt D\) dependence is optimal in general: already for Max-2XOR on a D-regular graph with random signs, with high probability every assignment has value at most \(1/2 + O(1/\sqrt D)\) [1505.03424].

The bounded-degree hardness theory now matches this scaling. For any finite field \(\mathbb F_q\), any \(1\le r\le q-1\), any \(k\ge 3\), and sufficiently large \(D\), it is NP-hard under randomized reductions to approximate Max-Ek-LINSAT\((q,r)\) of degree at most \(D\) within
\[
\frac rq + \mathcal O_{q,r}\!\left(\frac{1}{\sqrt D}\right).
\]
Specializing to Boolean parity constraints gives bounded-degree Max-Ek-XORSAT hardness beyond
\[
\frac12 + \mathcal O\!\left(\frac{1}{\sqrt D}\right),
\]
so the optimal worst-case dependence on \(D\) is \(\Theta(1/\sqrt D)\) [2606.13570].

The direct consequence for D-regular Max-k-XORSAT is that regularity does not improve the asymptotic approximation exponent in the worst case: any polynomial-time classical or quantum algorithm is confined to the \(1/\sqrt D\) scale, and any genuine advantage can only appear in the constant prefactor. For Boolean instances this matches the algorithmic upper bound up to the \(k\)-dependent constant; for general \(\mathbb F_q\), the hardness extends but the corresponding \(1/\sqrt D\) algorithmic guarantee is not yet known [2606.13570].

## 4. QAOA on large-girth regular hypergraphs

The most explicit direct analysis of D-regular-type Max-k-XORSAT in the quantum optimization literature is the study of QAOA on large-girth regular hypergraphs. There the instance is Max-\(q\)-XORSAT on a \((D+1)\)-regular \(q\)-uniform hypergraph, with cost
\[
C^{\text{XOR}}_J(z)=\sum_{(i_1,\dots,i_q)\in E} \frac12\bigl(1 + J_{i_1\ldots i_q} z_{i_1}\cdots z_{i_q}\bigr),
\]
scaled Hamiltonian
\[
C_J = \frac{1}{\sqrt D}\sum_{(i_1,\ldots,i_q)\in E} J_{i_1\ldots i_q} Z_{i_1}\cdots Z_{i_q},
\]
and standard mixer \(B=\sum_j X_j\) [2110.14206].

Because girth \(>2p+1\), every depth-\(p\) neighborhood of a hyperedge is a \(D\)-ary \(q\)-uniform hypertree, and a sign-gauge argument shows that on such a hypertree the QAOA expectation is independent of the pattern of clause signs \(J\). The expected satisfied-clause fraction therefore reduces to a single-hyperedge quantity:
\[
\frac{1}{|E|}\,{}_J\!\langle\gamma,\beta| C^{\text{XOR}}_J |\gamma,\beta\rangle_J
= \frac12 + \nu_p^{[q]}(D,\gamma,\beta)\sqrt{\frac{q}{2D}}.
\]
The paper derives an exact finite-\(D\) hypertree recursion for \(\nu_p^{[q]}(D,\gamma,\beta)\) with time complexity \(O(p\,4^{pq})\) and memory \(O(4^p)\), and an infinite-\(D\) matrix iteration with time \(O(p^2 4^p)\) and memory \(O(p^2)\) [2110.14206].

For Max-\(q\)-XORSAT numerics, the infinite-\(D\) iteration was optimized up to \(3\le q\le 6\) and \(1\le p\le 14\). The resulting \(\bar\nu_p^{[q]}\) increases with \(p\). For even \(q\ge 4\), however, locality and large girth impose a limitation: because \(n\gtrsim D^p\), one remains in the regime \(p<\varepsilon\log n\), and overlap-gap results imply that \(\bar\nu_p^{[q]}/\Pi_q\) does not converge to 1 as \(p\to\infty\) in this regular large-girth setting [2110.14206]. In that sense, the paper identifies both an exact calculational framework and a structural obstruction.

## 5. LDPC decoding, Regev reduction, and locally-quantum decoders

A different direct route to D-regular Max-k-XORSAT views the problem as nearest-codeword search in a regular LDPC code. For a \((k,D)\)-regular constraint matrix \(B\) and right-hand side \(v\), the objective is
\[
f(x)=|Bx-v|,
\]
so maximizing satisfied constraints is equivalent to finding the codeword \(c=Bx\in C\) closest to \(v\). Regev’s reduction converts this optimization task into decoding the dual code \(C^\perp=\{d:B^Td=0\}\) under a coherent superposition of bit-flip errors, and thereby into a decoding problem on a regular LDPC code with parity-check matrix \(B^T\) [2604.24633].

On Gallager’s \((k,D)\) ensemble, the locally-quantum-decoding paper exploits a special block structure: there exists a subset of checks whose supports partition the \(m\) constraint bits into disjoint blocks of size \(D\). A blockwise “Fine-Grained Unambiguous Measurement” (FGUM) is then applied inside Regev’s reduction. The resulting effective channel is a block erasure channel, and after classical recovery on the erased blocks one obtains an expected satisfied fraction
\[
\frac{\langle s\rangle}{m}
=
1 - (1-e_{\max})(1-2^{1-D})\,\frac{\hat I_D^*}{D},
\]
where \(e_{\max}\) is the maximal block-erasure rate still decodable with high probability on the random Gallager code, and \(\hat I_D^*\) is the average Hamming weight of a specially chosen coset-leader set \(I_D^*\) [2604.24633].

This decoder strongly outperforms classical belief propagation on the same instances, and for some \((k,D)\) the approximate optima achieved by the quantum decoder surpass both Prange’s algorithm and simulated annealing. However, the same work constructs an enhanced classical algorithm, “Turbo Prange”, which exactly matches the asymptotic performance of Regev+FGUM on Gallager-ensemble D-regular Max-k-XORSAT. In the large-\(D\) regime, both achieve
\[
\frac{\langle s\rangle}{m}
=
\frac12 + \frac{1}{\sqrt{2\pi D}} + O(D^{-1}),
\]
so the locally-quantum decoder improves substantially over BP and standard Prange yet stops short of a proven quantum advantage [2604.24633].

## 6. Annealing, regular embeddings, and broader algorithmic implications

Regular parity systems also expose a sharp distinction between algebraic tractability and local-search tractability. In a planar embedding of k-regular k-XORSAT built from reversible logic gates on a square grid, the resulting classical model has no finite-temperature phase transition, but thermal relaxation into the ground state remains glassy. Under quantum annealing, the same embedding supports a second-order quantum phase transition for \(k=2\) and a first-order transition for \(k=3\), corresponding respectively to polynomial and exponential scaling of the minimum gap and thus of time-to-solution [1904.01860].

That result is about k-regular k-XORSAT rather than D-regular Max-k-XORSAT, so any transfer is interpretive. The reliable lesson is that even when a parity CSP is solvable in polynomial time by Gaussian elimination, regular sparse embeddings can generate slow local dynamics, mixed-boundary-condition effects, and first-order quantum transitions under standard transverse-field interpolation. This suggests that D-regular Max-k-XORSAT should not be viewed as annealing-friendly merely because its underlying algebra is linear [1904.01860].

Taken together, the current picture is unusually coherent. Worst-case bounded-degree theory fixes the correct approximation scale at \(1/\sqrt D\) [1505.03424, 2606.13570]. Large-girth regular analyses show how finite-depth QAOA is controlled by a hypertree recursion and constrained by locality [2110.14206]. Gallager-ensemble studies show that D-regular Max-k-XORSAT is naturally an LDPC decoding problem, enabling both strong classical heuristics and intrinsically quantum local measurements, while also revealing how hard it is to turn those quantum ingredients into a strict advantage [2604.24633]. The remaining open terrain is therefore not the exponent of \(D\), but the exact constants, the role of regular-core geometry in near-optimal states, and whether any nonclassical decoder or nonlocal driver can outperform the best structured classical algorithms on the same regular instances.

Source: https://www.emergentmind.com/topics/d-regular-max-k-xorsat