Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings

TL;DR

This paper establishes polynomial lower bounds of (n^{1.5}) for non-commutative arithmetic circuits computing explicit polynomials, advancing understanding of circuit complexity over non-commutative rings.

Contribution

It provides the first super-linear lower bounds for non-commutative arithmetic circuits over rings, improving upon prior bounds that were only slightly super-linear.

Findings

Proves (n^{1.5}) lower bound for product gates in non-commutative circuits

Shows similar bounds for polynomial functions over certain non-commutative rings

Extends bounds to degree-d polynomials with (d\u221a{n}) lower bound

Abstract

We prove a lower bound of $\Omega\left(n^{1.5}\right)$ for the number of product gates in non-commutative arithmetic circuits for an explicit $n$-variate degree-$n$ polynomial $f_{n}$ (over every field). We observe that this implies that over certain non-commutative rings $R$, any arithmetic circuit that computes the induced polynomial function $f_{n}: R^n \rightarrow R$, using the ring operations of addition and multiplication in $R$, requires at least $\Omega\left(n^{1.5}\right)$ multiplications. More generally, for any $d\geq 2$ and sufficiently large $n$, we obtain a lower bound of $\Omega\left(d\sqrt{n}\right)$ for $n$-variate degree-$d$ polynomials, for both these models. Prior to our work, the only known lower bounds for the size of non-commutative circuits, or for the size of arithmetic circuits over any ring, were slightly super-linear in $\max\{n,d\}$: $\Omega\left(n\log d\right)$ by Baur and Strassen, and $\Omega\left(d\log n\right)$ by Nisan. (Nisan's bound was proved for non-commutative arithmetic circuits and implies a bound for arithmetic circuits over non-commutative rings by our observation).