Jukna–Schnitger Conjecture in Circuit Complexity

• Jukna–Schnitger’s Conjecture is the belief that nonlinear preprocessing does not significantly reduce the complexity of computing linear operators.
• Recent work in the static cell-probe model shows that for random linear operators, even slight advantages over guessing require superlinear query-time lower bounds.
• Implications extend to circuit complexity, where arbitrary-gate circuits still face substantial wire lower bounds despite non-linear techniques.

Searching arXiv for papers relevant to Jukna–Schnitger’s Conjecture and closely related formulations. Jukna–Schnitger’s Conjecture, in the formulation used in recent lower-bound work, is the folklore belief that non-linear gates do not help in computing a linear operator (Ko, 2 Sep 2025). The conjectural theme arises in circuit complexity, static data structures, and communication lower bounds, and it is typically studied through a cell-probe analogue in which an input vector $X \in \mathbb{F}_2^n$ is preprocessed into memory and each query asks for a linear form $(M_i,X)$ determined by a row of a linear operator $M \in \mathbb{F}_2^{m\times n}$ (Ko, 2 Sep 2025). Recent work gives the first formal evidence for this intuition for random linear operators, breaking the longstanding logarithmic barrier in the high-space regime; by contrast, a distinct matrix covering-number conjecture emphasized by Jukna and motivated by depth-3 lower bounds has been explicitly refuted (Ko, 2 Sep 2025, Hambardzumyan et al., 2022).

1. Conjectural content and formal models

In the relevant literature, Jukna–Schnitger’s Conjecture is not presented as a single universal theorem statement but as a guiding principle: arbitrary non-linear preprocessing, or arbitrary non-linear gates, should not substantially reduce the complexity of computing a linear operator (Ko, 2 Sep 2025). The principal formalization used in recent work is the static cell-probe model. In that model, one preprocesses an input $X \in \mathbb{F}_2^n$ into a data structure of size $s$, and on query $i$ one must output either $(M_i,X)$ or, equivalently,

$\chi_{M_i}(X):=(-1)^{(M_i,X)},$

where $M_i$ is the $i$-th row of $(M_i,X)$0 (Ko, 2 Sep 2025).

The paper "Lower Bounds for Linear Operators" formulates the target phenomenon by contrasting a conjectured strong lower bound with the older barrier. The stronger form sought there is

$(M_i,X)$1

for some constant $(M_i,X)$2, where $(M_i,X)$3 is the number of outputs (Ko, 2 Sep 2025). Earlier methods, by comparison, yielded only logarithmic-barrier lower bounds of the form

$(M_i,X)$4

which become weak in the high-space regime (Ko, 2 Sep 2025).

This formalization makes precise the claim that non-linear preprocessing should not materially outperform linear preprocessing for “most” linear operators. A plausible implication is that the conjecture is best understood not as a statement about a single function family, but as a structural assertion about the complexity of linear operators under highly general computational resources.

2. Static cell-probe evidence for random linear operators

The strongest progress reported in the supplied material concerns random linear operators. For $(M_i,X)$5, the main theorem in (Ko, 2 Sep 2025) proves that any static data structure for computing the corresponding operator must satisfy

$(M_i,X)$6

The paper also gives an equivalent parameterized statement: if

$(M_i,X)$7

then there exists a set $(M_i,X)$8 of $(M_i,X)$9 linear functions from $M \in \mathbb{F}_2^{m\times n}$0 that cannot be answered by an $M \in \mathbb{F}_2^{m\times n}$1-space, $M \in \mathbb{F}_2^{m\times n}$2-probe data structure (Ko, 2 Sep 2025).

The significance of this result lies in its departure from prior lower bounds. The paper emphasizes the high-space regime, noting that when $M \in \mathbb{F}_2^{m\times n}$3, earlier methods gave only $M \in \mathbb{F}_2^{m\times n}$4, whereas the new argument yields

$M \in \mathbb{F}_2^{m\times n}$5

This is the basis for the claim that the result provides the first formal evidence for the conjectural principle in the static cell-probe setting (Ko, 2 Sep 2025).

The same work stresses that the lower bound continues to hold even in a regime of only a small constant advantage over random guessing, rather than the more standard small-error regime. This suggests that the obstruction to fast computation is robust under very weak success guarantees, a feature that is technically important in both data-structure and communication formulations (Ko, 2 Sep 2025).

3. Proof architecture: compression, entropy, and low correlation

The proof strategy in (Ko, 2 Sep 2025) is a contradiction argument organized around three ingredients: compression of the data-structure computation into a communication process, extraction of entropy and near-independence properties, and a combinatorial lemma showing that the resulting configuration is impossible.

The communication simulation uses a 3-player process. Merlin sends the preprocessed memory contents $M \in \mathbb{F}_2^{m\times n}$6 to Bob; Alice, who knows $M \in \mathbb{F}_2^{m\times n}$7 and the query index $M \in \mathbb{F}_2^{m\times n}$8, sends probe addresses; and Bob checks consistency with $M \in \mathbb{F}_2^{m\times n}$9, returning the relevant bit when the path is consistent and otherwise guessing randomly (Ko, 2 Sep 2025). The key quantitative observation is that Alice can pick a path of the decision tree with probability at least $X \in \mathbb{F}_2^n$0. Accordingly, the protocol has overall advantage $X \in \mathbb{F}_2^n$1, and the paper records the corresponding success guarantee as

$X \in \mathbb{F}_2^n$2

From this compression, the proof derives two structural properties. First, Alice’s transcript reveals only limited information about a randomly chosen queried row, yielding a low-information and then high-min-entropy statement. Second, after conditioning on the compressed transcript, the row $X \in \mathbb{F}_2^n$3 and the input $X \in \mathbb{F}_2^n$4 remain almost independent: $X \in \mathbb{F}_2^n$5 The final contradiction is obtained by combining a nontrivial correlation lower bound, large total average min-entropy, and very small mutual information. The combinatorial lemma splits correlation into a Hadamard/discrepancy term and a rectangle/error term, bounding the former via Lindsey’s lemma and min-entropy-to-$X \in \mathbb{F}_2^n$6 estimates, and the latter via Pinsker’s inequality (Ko, 2 Sep 2025).

This proof architecture is noteworthy because it is tailored to the small-advantage regime. A plausible implication is that the technical novelty lies not only in proving a stronger asymptotic tradeoff, but in identifying a proof system capable of surviving exponentially small advantage parameters.

4. Consequences for arbitrary-gate circuits

The same lower bound translates into circuit complexity via a theorem of Viola quoted in (Ko, 2 Sep 2025). If a function $X \in \mathbb{F}_2^n$7 has a depth-$X \in \mathbb{F}_2^n$8 circuit with $X \in \mathbb{F}_2^n$9 wires and arbitrary gates, then $s$0 admits a data structure with

$s$1

for any $s$2 (Ko, 2 Sep 2025). Applying the data-structure lower bound gives a wire lower bound

$s$3

for a specific linear operator $s$4, and the abstract states that this bound holds even for circuits with only a small constant advantage over random guessing (Ko, 2 Sep 2025).

The paper places this in direct relation to the Jukna–Schnitger program. It states that the result makes progress on the question of whether arbitrary gates can significantly reduce the complexity of computing linear operators with many outputs, and it compares the new wire lower bound with earlier bounds such as $s$5 and $s$6 (Ko, 2 Sep 2025). For $s$7, the new asymptotic lower bound is described there as stronger than previous linear-operator-specific bounds.

In this sense, the cell-probe theorem and the circuit theorem are two aspects of the same claim: if random linear operators are hard even after arbitrary preprocessing, then arbitrary-gate circuits computing such operators must still incur superlinear wire complexity. This does not resolve the full conjecture, but it materially narrows the gap between folklore intuition and proved lower bounds.

5. A related but distinct Jukna-centered covering-number program

A separate line of work, associated in the supplied material with Pudlák, Rödl, Savický, and Jukna, concerns Boolean matrices with many zero entries but no $s$8 all-zero submatrix (Hambardzumyan et al., 2022). The problem asks whether every $s$9 Boolean matrix $i$0 with at least $i$1 zero-entries and no $i$2 all-zero submatrix must satisfy

$i$3

where $i$4 is the smallest number of all-1 rectangles needed to cover all 1-entries of $i$5 (Hambardzumyan et al., 2022).

The paper "On depth-3 circuits and covering number: an explicit counter-example" shows that this conjecture is false by an explicit construction (Hambardzumyan et al., 2022). It constructs $i$6 Boolean matrices with

$i$7

zero entries, no $i$8 all-zero submatrix, and

$i$9

The construction uses a point-line incidence matrix over the grid $(M_i,X)$0, with

$(M_i,X)$1

rows indexed by points, columns indexed by affine lines $(M_i,X)$2, and matrix entries defined by

$(M_i,X)$3

The lower covering number is then achieved through explicitly defined 1-monochromatic rectangles based on modular constraints, and the total number of such rectangles is bounded by $(M_i,X)$4 (Hambardzumyan et al., 2022).

This conjecture is not the same as the non-linear-gates formulation of Jukna–Schnitger’s Conjecture. However, the supplied material presents it as part of a related lower-bound program centered on Jukna’s research problems and on attempts to obtain strong depth-3 circuit lower bounds from combinatorial covering arguments (Hambardzumyan et al., 2022). The explicit counterexample therefore blocks one direct route in that broader program while leaving open other approaches.

6. Status, open directions, and disambiguation

The current status, on the basis of the supplied papers, is mixed. The strongest positive result is that for random linear operators, arbitrary non-linear preprocessing does not circumvent a substantial query-time lower bound in the static cell-probe model, and this already yields new wire lower bounds for arbitrary-gate circuits (Ko, 2 Sep 2025). At the same time, the full conjectural picture remains open. The same paper explicitly leaves open proving the conjecture for explicit linear operators, obtaining the stronger power-law lower bound

$(M_i,X)$5

and fully resolving the communication-form Multiphase Conjecture in its most general setting (Ko, 2 Sep 2025).

The paper also reports a partial resolution of the communication form of the Multiphase Conjecture by considering the Inner Product (mod 2) problem rather than Set Disjointness when the number of queries $(M_i,X)$6 is super-polynomial, for example $(M_i,X)$7, and the total update time is $(M_i,X)$8 (Ko, 2 Sep 2025). Its progress on Jukna–Schnitger’s Conjecture is stated to apply as well to cases with super-polynomial $(M_i,X)$9. This situates the conjecture within a wider network of lower-bound problems linking data structures, communication, and circuits.

A further point of disambiguation is that not every conjecture bearing on dimensions, bounds, or lower-bound equivalences is related to Jukna–Schnitger. The paper "The Dimension Conjecture Implies The Jacobi Bound Conjecture" proves that the Dimension Conjecture implies the Jacobi Bound Conjecture, and, together with earlier work in the reverse direction, concludes that those two conjectures are equivalent in the authors’ framework (Dupuy et al., 18 Mar 2026). The supplied material states explicitly that Jukna–Schnitger’s Conjecture is not mentioned at all in that paper, and no relation to the Dimension Conjecture or Jacobi Bound Conjecture is identified there (Dupuy et al., 18 Mar 2026).

Taken together, these results present Jukna–Schnitger’s Conjecture as an active lower-bound principle rather than a settled theorem. The best current evidence supports the intuition for random operators and against highly general nonlinear shortcuts, while related Jukna-centered combinatorial conjectures have shown that some older proposed routes to strong explicit lower bounds cannot succeed in their original form.