A Novel Quantum Algorithm for Efficient Attractor Search in Gene Regulatory Networks
Mirko Rossini, Felix M. Weidner, Joachim Ankerhold, Hans A. Kestler

TL;DR
This paper introduces a quantum algorithm inspired by Grover's method to efficiently identify all attractors in Boolean Network models of gene regulation, overcoming exponential complexity in classical approaches.
Contribution
The paper presents a novel quantum search algorithm that iteratively finds new attractors in gene regulatory networks, outperforming existing classical methods.
Findings
Effective in identifying attractors in Boolean Networks
Resistant to noise on NISQ quantum devices
Guarantees discovery of new attractors with each iteration
Abstract
The description of gene interactions that constantly occur in the cellular environment is an extremely challenging task due to an immense number of degrees of freedom and incomplete knowledge about microscopic details. Hence, a coarse-grained and rather powerful modeling of such dynamics is provided by Boolean Networks (BNs). BNs are dynamical systems composed of Boolean agents and a record of their possible interactions over time. Stable states in these systems are called attractors which are closely related to the cellular expression of biological phenotypes. Identifying the full set of attractors is, therefore, of substantial biological interest. However, for conventional high-performance computing, this problem is plagued by an exponential growth of the dynamic state space. Here, we demonstrate a novel quantum search algorithm inspired by Grover's algorithm to be implemented on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Molecular Communication and Nanonetworks
