Parallel computation with molecular-motor-propelled agents in nanofabricated networks

TLDR

Electronic computers excel at high‑speed sequential operations but struggle with combinatorial tasks that benefit from parallel processing. The study demonstrates a parallel computer solving a subset‑sum instance and discusses advances needed to tackle larger combinatorial problems. The system uses a nanostructured network traversed by many molecular‑motor‑driven protein filaments to perform parallel computation. This system is highly energy efficient, avoiding the heating issues that limit electronic computers.

Abstract

Significance Electronic computers are extremely powerful at performing a high number of operations at very high speeds, sequentially. However, they struggle with combinatorial tasks that can be solved faster if many operations are performed in parallel. Here, we present proof-of-concept of a parallel computer by solving the specific instance {2, 5, 9} of a classical nondeterministic-polynomial-time complete (“NP-complete”) problem, the subset sum problem. The computer consists of a specifically designed, nanostructured network explored by a large number of molecular-motor-driven, protein filaments. This system is highly energy efficient, thus avoiding the heating issues limiting electronic computers. We discuss the technical advances necessary to solve larger combinatorial problems than existing computation devices, potentially leading to a new way to tackle difficult mathematical problems.