# Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication

arXiv: https://arxiv.org/abs/2006.14652 · HTML: https://mlsanity.com/paper/2006.14652/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jun 2020.

## Built on by (most cited first, 1 of 1)

- [Neuromorphic-based metaheuristics: A new generation of low power, low latency and small footprint optimization algorithms](https://mlsanity.com/paper/2505.16362/) (2025)

## Abstract (arXiv)

Boolean circuits of McCulloch-Pitts threshold gates are a classic model of neural computation studied heavily in the late 20th century as a model of general computation. Recent advances in large-scale neural computing hardware has made their practical implementation a near-term possibility. We describe a theoretical approach for multiplying two N by N matrices that integrates threshold gate logic with conventional fast matrix multiplication algorithms, that perform O(Nω) arithmetic operations for a positive constant ω < 3. Our approach converts such a fast matrix multiplication algorithm into a constant-depth threshold circuit with approximately O(Nω) gates. Prior to our work, it was not known whether the Theta(N3)-gate barrier for matrix multiplication was surmountable by constant-depth threshold circuits. Dense matrix multiplication is a core operation in convolutional neural network training. Performing this work on a neural architecture instead of off-loading it to a GPU may be an appealing option.