Document Open Access Logo

Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis

Author Gregory Valiant



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.96.pdf
  • Filesize: 1 MB
  • 13 pages

Document Identifiers

Author Details

Gregory Valiant
  • Department of Computer Science, Stanford University, CA, USA

Acknowledgements

I want to thank Vijaykrishna Gurunathan for discussions on this topic. Vijaykrishna wished to not be included as an author.

Cite AsGet BibTex

Gregory Valiant. Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 96:1-96:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.96

Abstract

We describe two algorithms for multiplying n × n matrices using time and energy Õ(n²) under basic models of classical physics. The first algorithm is for multiplying integer-valued matrices, and the second, quite different algorithm, is for Boolean matrix multiplication. We hope this work inspires a deeper consideration of physically plausible/realizable models of computing that might allow for algorithms which improve upon the runtimes and energy usages suggested by the parallel RAM model in which each operation requires one unit of time and one unit of energy.

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Physics based computing
  • matrix multiplication
  • low-energy computing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Scott Aaronson and Alex Arkhipov. The computational complexity of linear optics. In Proceedings of the 43rd annual ACM Symposium on Theory of Computing, pages 333-342, 2011. Google Scholar
  2. Simon Apers, Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. Quadratic speedup for spatial search by continuous-time quantum walk. Phys. Rev. Lett., 129:160502, October 2022. URL: https://doi.org/10.1103/PhysRevLett.129.160502.
  3. Charles H Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 17(6):525-532, 1973. Google Scholar
  4. Charles H Bennett. Notes on the history of reversible computation. ibm Journal of Research and Development, 32(1):16-23, 1988. Google Scholar
  5. Vannevar Bush. The differential analyzer. a new machine for solving differential equations. Journal of the Franklin Institute, 212(4):447-488, 1931. Google Scholar
  6. Erik D Demaine, Jayson Lynch, Geronimo J Mirano, and Nirvan Tyagi. Energy-efficient algorithms. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pages 321-332, 2016. Google Scholar
  7. Daniel Silva Graça and José Félix Costa. Analog computers and recursive functions over the reals. Journal of Complexity, 19(5):644-664, 2003. Google Scholar
  8. Lov K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th annual Symposium on the Theory of Computing, pages 212-219, 1996. URL: https://doi.org/10.1145/237814.237866.
  9. Miao Hu, Hai Li, Yiran Chen, Qing Wu, Garrett S Rose, and Richard W Linderman. Memristor crossbar-based neuromorphic computing system: A case study. IEEE transactions on neural networks and learning systems, 25(10):1864-1878, 2014. Google Scholar
  10. Miao Hu, John Paul Strachan, Zhiyong Li, Emmanuelle M Grafals, Noraica Davila, Catherine Graves, Sity Lam, Ning Ge, Jianhua Joshua Yang, and R Stanley Williams. Dot-product engine for neuromorphic computing: Programming 1t1m crossbar to accelerate matrix-vector multiplication. In Proceedings of the 53rd annual Design Automation Conference, pages 1-6, 2016. Google Scholar
  11. Sven Köppel, Bernd Ulmann, Lars Heimann, and Dirk Killat. Using analog computers in todayquotesingles largest computational challenges. Advances in Radio Science, 19:105-116, December 2021. URL: https://doi.org/10.5194/ars-19-105-2021.
  12. Rolf Landauer. Irreversibility and heat generation in the computing process. IBM journal of research and development, 5(3):183-191, 1961. Google Scholar
  13. Marian Boykan Pour-El. Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers). Transactions of the American Mathematical Society, 199:1-28, 1974. Google Scholar
  14. Claude E Shannon. Mathematical theory of the differential analyzer. Journal of Mathematics and Physics, 20(1-4):337-354, 1941. Google Scholar
  15. Yichen Shen, Nicholas C Harris, Scott Skirlo, Mihika Prabhu, Tom Baehr-Jones, Michael Hochberg, Xin Sun, Shijie Zhao, Hugo Larochelle, Dirk Englund, et al. Deep learning with coherent nanophotonic circuits. Nature photonics, 11(7):441-446, 2017. Google Scholar
  16. Peter W Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings of the 35th annual Symposium on Foundations of Computer Science, pages 124-134, 1994. Google Scholar
  17. Kei Uchizawa, Takao Nishizeki, and Eiji Takimoto. Energy complexity and depth of threshold circuits. In Fundamentals of Computation Theory: 17th International Symposium, FCT 2009, Wrocław, Poland, September 2-4, 2009. Proceedings 17, pages 335-345. Springer, 2009. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail