Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2408.08814 · Patterns

A novel quantum algorithm for efficient attractor search in gene regulatory networks

Mirko Rossini, Felix M. Weidner, Joachim Ankerhold, Hans Armin Kestler

Published Jul 3, 2025• 2 citations
arXivHTMLPDF

Abstract

Describing gene interactions in cells is challenging due to their complexity and the limited microscopic detail available. Boolean networks offer a powerful, coarse-grained approach to modeling these dynamics using binary agents and their interactions. In this context, attractors-stable states of the system-are associated with biological phenotypes, making their identification biologically important. However, traditional computing struggles with the exponential growth of the state space in such models. Here, we present a novel quantum search algorithm for identifying attractors in synchronous Boolean networks, specifically designed for use on quantum computers. The algorithm iteratively suppresses known attractor basins, increasing the probability of detecting new ones. Unlike classical methods, it guarantees the discovery of a new attractor in each run. Early tests demonstrate strong resilience to noise on current NISQ (noisy intermediate-scale quantum) devices, marking a promising advance toward practical quantum-enhanced biological modeling.

DOI
10.1016/j.patter.2025.101295

Related papers

Solving the Complex Metabolic Networks of Living Organisms with Real Quantum Computers... A Practical Breakthrough in Systems B

inquantio

• Published in the international journal Patterns, successfully implementing the dynamics of biological Boolean networks (BNs) on a real quantum processing unit (QPU). • Demonstrated the efficiency of utilizing quantum superposition states to compute gene knockout and overexpression perturbation experiments in a single ensemble operation. • Traced back the predecessors of an attractor using Grover's search algorithm and successfully estimated the basin size through quantum counting techniques. [Quantum Biology Society] When analyzing complex biological mechanisms such as intracellular gene expression or metabolic pathways, classical computers face the limitation of exponentially expanding state spaces to compute as the number of components (nodes) increases. Recently, an empirical study that groundbreakingly resolved this fundamental computational bottleneck in systems biology through quantum computing has been published, drawing significant attention. A paper titled "Leveraging quantum computing for dynamic analyses of logical networks in systems biology" was published in Patterns, a data science journal published by Cell Press. A joint research team, including Felix M. Weidner and Professor Hans A. Kestler from Ulm University in Germany, presented a groundbreaking proof of principle for implementing the dynamics of biological logical networks using qubits. ■ 'Quantum Superposition' Taming Exponential Expansion In biological Boolean networks (BNs), when there are n components, the number of states the entire system can have increases exponentially to 2ⁿ. Focusing on the fact that the dimension of the computational space of an entangled system of qubits also expands exponentially, the research team successfully matched the exponential growth of network states to a system of multiple qubits. In a 5-gene network experiment (Emx2, Pax6, Coup-tfi, Sp8, Fgf8) modeling the development of the mammalian cerebral cortex, the research team created a uniform superposition of all possible initial states using Hadamard gates. With just a single run of the quantum state transition circuit, they were able to simultaneously evaluate multiple classical state transitions and ultimately converge the system into an attractor state, which signifies a stable phenotype. ■ 'Quantum Perturbation' Experiments Instead of Genetic Scissors In traditional biological research, an enormous number of classical simulations are required to understand the impact of specific gene knockouts or overexpression. However, in a quantum network model, biologically meaningful stable state information can be efficiently extracted through algorithms that utilize quantum properties such as superposition. The research team processed combinations of perturbations of multiple genes in a single ensemble operation using superposition states, and successfully derived a more realistic basin size by weighting specific genes to reflect prior biological knowledge. ■ Tracing the Origins of Disease with Grover's Algorithm What is particularly notable is that by combining the characteristics of quantum circuits with Grover's search algorithm, they traced back the initial predecessors that caused a specific final phenotype (attractor). Furthermore, they successfully estimated the total number of states leading to that attractor using quantum counting techniques. Such quantum backtracking techniques can serve as highly powerful and practical analytical tools for inversely identifying the pathogenic pathways of complex metabolic diseases at the molecular network level and selecting key target proteins. ■ Going Beyond Simulators to Successfully Run on Real Quantum Hardware (QPU) This research did not stop at a simple theoretical proposal. The research team directly ran and demonstrated this biological quantum circuit while comparing the performance of two real quantum computers with classical simulators. This is evaluated as a major breakthrough proving that algorithms impossible to implement on classical hardware can be introduced to real quantum computers for the dynamic analysis of biological systems.

•Jul 13, 2026•0 citations

Identifying Protein Co-Regulatory Network Logic by Solving B-Sat Problems Through Gate-Based Quantum Computing

Aspen Erlandsson Brisebois, Jason Broderick, Zahed Khatooni +3 more

There is growing awareness that the success of pharmacologic interventions on living organisms is significantly impacted by context and timing of exposure. In turn, this complexity is leading to an increasing focus on regulatory network dynamics in biology and our ability to represent these at a high level of fidelity, in silico. Logic network models continue to show great promise in this domain and their parameter estimation can be formulated as a constraint satisfaction problem (CSP) that is especially well-suited for the often sparse and incomplete data associated with biology. Unfortunately, even in the case of Boolean logic, the combinatorial complexity of these problems grows rapidly, challenging our ability to create such models at physiologically-relevant scales. That said, quantum computing, while still nascent, facilitates novel information-processing paradigms with the potential for transformative impact in problems such as this one. In this work, we take a first step at actualizing this potential by identifying the structure and Boolean decisional logic of a well-studied regulatory network linking five proteins involved in the neural development of the mammalian cortical area of the brain. We identify the protein-protein connectivity and binary decisional logic governing this network by formulating it as a Boolean Satisfiability (B-SAT) problem. We then employ Grover's algorithm to solve the NP-hard problem faster than the exponential time complexity required by deterministic classical algorithms. Using approaches deployed on both quantum simulators and actual noisy intermediate scale quantum (NISQ) hardware, we accurately recover several highlikelihood models from very sparse protein expression data. The results highlight the differential roles of various data types in supporting accurate models; the impact of quantum algorithm design as it pertains to the mutability of quantum hardware, and the opportunities for accelerated discovery enabled by this approach.

arXiv:2504.09365•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

A protocol for the use of cloud-based quantum computers for logical network analysis of biological systems

Felix M. Weidner, Mirko Rossini, Joachim Ankerhold +1 more

Boolean networks are commonly used in systems biology to dynamically model gene regulatory interactions. Here, we present a protocol for implementing Boolean network dynamics as quantum circuits. We describe steps for accessing cloud-based quantum processing units offered by IBM and IonQ and downloading and parsing logic for gene regulatory networks. We then detail procedures for performing simulations of quantum circuits on local devices and visualizing measurement results. For complete details on the use and execution of this protocol, please refer to Weidner et al.1

STAR Protocols•Aug 6, 2023•4 citations

Quantum Entanglement Information Search Algorithm

Jincheng Zhang

This paper introduces a novel information search algorithm leveraging quantum entanglement to enhance data discovery in large datasets. Traditional search methods often struggle with the complexity of identifying subtle correlations, limiting their effectiveness in scenarios with substantial data volumes. We propose a quantum-inspired approach that exploits the unique properties of quantum entanglement to establish a dynamic, probabilistic search framework. The core mechanism involves constructing a 'entanglement-aware' search space, enabling rapid pattern identification and improved matching efficiency. This algorithm is designed to outperform classical search techniques by focusing on higher-dimensional correlations and minimizing the computational cost associated with exhaustive search. The paper details the algorithm's design, analysis of its performance, and potential applications in data analysis and pattern recognition. The focus is on demonstrating the practical benefits of quantum entanglement in a search context, specifically addressing challenges related to scale and speed.

•Aug 31, 2026•0 citations

Quantum Network Biology: A Network-First Perspective on Quantum-Enabled Biological Communication Network Analysis

Swarup Roy, Jugal Kumar Kalita

Modern biology is increasingly represented through graphs, including protein–protein interaction graphs, cell–cell communication networks, host–pathogen interactomes, gene regulatory networks, and disease–gene association networks. These graphs help capture how molecular and cellular entities interact, signal, regulate, and perturb one another. Classical graph algorithms and graph neural networks have taken this a long way. However, several tasks remain difficult, including network alignment, conserved subgraph discovery, disease–module identification, and therapeutic target prioritization. These challenges are not merely software-engineering issues; many arise from hard combinatorial problem structures and become even harder in practice because biological networks are sparse, noisy, and incompletely annotated. This letter proposesQuantum Network Biology(QNB) as a vocabulary, a scope definition and, above all, a benchmark agenda for asking whether quantum and hybrid quantum–classical methods have anything to offer here. We view biological networks as communication systems. In this view, propagation asks how information moves through a network, and a quantum walk offers a different model of that movement, not just a faster version of a classical algorithm. We separate QNB from quantum biology, quantum bioinformatics and quantum network medicine, pair four quantum primitives with specific graph problems, and specify six benchmarks with named datasets, fixed classical baselines and reported metrics. We do not claim demonstrated quantum advantage. Instead, we argue that the criteria for testing such a claim should be defined now.

IEEE Transactions on Molecular Biological and Multi-Scale Communications•Jan 1, 2026•0 citations

Quantum computing for biotechnological innovation: transformative potential in biomedicine and drug discovery

Ji‐Yong Sung, Seung-min Park, Jae‐Ho Cheong

Quantum computing has emerged as a potential catalyst for addressing computational bottlenecks that increasingly constrain biotechnologies, including drug discovery, structural biology, and precision medicine. As biological datasets grow in scale and complexity, classical high-performance computing struggles to efficiently model molecular interactions and high-dimensional biological systems. Recent advances in hybrid quantum-classical algorithms and quantum-enhanced machine learning have enabled early proof-of-concept applications on noisy intermediate-scale quantum (NISQ) devices, offering new strategies for molecular simulation, pattern recognition, and optimization. In this opinion article, we critically assess where quantum computing may deliver realistic near-term value for biomedicine, emphasize hybrid workflows as the most viable path forward, and outline how quantum technologies could complement, not replace, existing computational paradigms as the field progresses toward fault-tolerant systems.

Trends in biotechnology•Mar 5, 2026•6 citations
Describing gene interactions in cells is challenging due to their complexity and the limited microscopic detail available. Boolean networks offer a powerful, coarse-grained approach to modeling these dynamics using binary agents and their interactions. In this context, attractors-stable states of the system-are associated with biological phenotypes, making their identification biologically important. However, traditional computing struggles with the exponential growth of the state space in such models. Here, we present a novel quantum search algorithm for identifying attractors in synchronous Boolean networks, specifically designed for use on quantum computers. The algorithm iteratively suppresses known attractor basins, increasing the probability of detecting new ones. Unlike classical methods, it guarantees the discovery of a new attractor in each run. Early tests demonstrate strong resilience to noise on current NISQ (noisy intermediate-scale quantum) devices, marking a promising advance toward practical quantum-enhanced biological modeling.
• Published in the international journal Patterns, successfully implementing the dynamics of biological Boolean networks (BNs) on a real quantum processing unit (QPU). • Demonstrated the efficiency of utilizing quantum superposition states to compute gene knockout and overexpression perturbation experiments in a single ensemble operation. • Traced back the predecessors of an attractor using Grover's search algorithm and successfully estimated the basin size through quantum counting techniques. [Quantum Biology Society] When analyzing complex biological mechanisms such as intracellular gene expression or metabolic pathways, classical computers face the limitation of exponentially expanding state spaces to compute as the number of components (nodes) increases. Recently, an empirical study that groundbreakingly resolved this fundamental computational bottleneck in systems biology through quantum computing has been published, drawing significant attention. A paper titled "Leveraging quantum computing for dynamic analyses of logical networks in systems biology" was published in Patterns, a data science journal published by Cell Press. A joint research team, including Felix M. Weidner and Professor Hans A. Kestler from Ulm University in Germany, presented a groundbreaking proof of principle for implementing the dynamics of biological logical networks using qubits. ■ 'Quantum Superposition' Taming Exponential Expansion In biological Boolean networks (BNs), when there are n components, the number of states the entire system can have increases exponentially to 2ⁿ. Focusing on the fact that the dimension of the computational space of an entangled system of qubits also expands exponentially, the research team successfully matched the exponential growth of network states to a system of multiple qubits. In a 5-gene network experiment (Emx2, Pax6, Coup-tfi, Sp8, Fgf8) modeling the development of the mammalian cerebral cortex, the research team created a uniform superposition of all possible initial states using Hadamard gates. With just a single run of the quantum state transition circuit, they were able to simultaneously evaluate multiple classical state transitions and ultimately converge the system into an attractor state, which signifies a stable phenotype. ■ 'Quantum Perturbation' Experiments Instead of Genetic Scissors In traditional biological research, an enormous number of classical simulations are required to understand the impact of specific gene knockouts or overexpression. However, in a quantum network model, biologically meaningful stable state information can be efficiently extracted through algorithms that utilize quantum properties such as superposition. The research team processed combinations of perturbations of multiple genes in a single ensemble operation using superposition states, and successfully derived a more realistic basin size by weighting specific genes to reflect prior biological knowledge. ■ Tracing the Origins of Disease with Grover's Algorithm What is particularly notable is that by combining the characteristics of quantum circuits with Grover's search algorithm, they traced back the initial predecessors that caused a specific final phenotype (attractor). Furthermore, they successfully estimated the total number of states leading to that attractor using quantum counting techniques. Such quantum backtracking techniques can serve as highly powerful and practical analytical tools for inversely identifying the pathogenic pathways of complex metabolic diseases at the molecular network level and selecting key target proteins. ■ Going Beyond Simulators to Successfully Run on Real Quantum Hardware (QPU) This research did not stop at a simple theoretical proposal. The research team directly ran and demonstrated this biological quantum circuit while comparing the performance of two real quantum computers with classical simulators. This is evaluated as a major breakthrough proving that algorithms impossible to implement on classical hardware can be introduced to real quantum computers for the dynamic analysis of biological systems.
There is growing awareness that the success of pharmacologic interventions on living organisms is significantly impacted by context and timing of exposure. In turn, this complexity is leading to an increasing focus on regulatory network dynamics in biology and our ability to represent these at a high level of fidelity, in silico. Logic network models continue to show great promise in this domain and their parameter estimation can be formulated as a constraint satisfaction problem (CSP) that is especially well-suited for the often sparse and incomplete data associated with biology. Unfortunately, even in the case of Boolean logic, the combinatorial complexity of these problems grows rapidly, challenging our ability to create such models at physiologically-relevant scales. That said, quantum computing, while still nascent, facilitates novel information-processing paradigms with the potential for transformative impact in problems such as this one. In this work, we take a first step at actualizing this potential by identifying the structure and Boolean decisional logic of a well-studied regulatory network linking five proteins involved in the neural development of the mammalian cortical area of the brain. We identify the protein-protein connectivity and binary decisional logic governing this network by formulating it as a Boolean Satisfiability (B-SAT) problem. We then employ Grover's algorithm to solve the NP-hard problem faster than the exponential time complexity required by deterministic classical algorithms. Using approaches deployed on both quantum simulators and actual noisy intermediate scale quantum (NISQ) hardware, we accurately recover several highlikelihood models from very sparse protein expression data. The results highlight the differential roles of various data types in supporting accurate models; the impact of quantum algorithm design as it pertains to the mutability of quantum hardware, and the opportunities for accelerated discovery enabled by this approach.
Boolean networks are commonly used in systems biology to dynamically model gene regulatory interactions. Here, we present a protocol for implementing Boolean network dynamics as quantum circuits. We describe steps for accessing cloud-based quantum processing units offered by IBM and IonQ and downloading and parsing logic for gene regulatory networks. We then detail procedures for performing simulations of quantum circuits on local devices and visualizing measurement results. For complete details on the use and execution of this protocol, please refer to Weidner et al.1
This paper introduces a novel information search algorithm leveraging quantum entanglement to enhance data discovery in large datasets. Traditional search methods often struggle with the complexity of identifying subtle correlations, limiting their effectiveness in scenarios with substantial data volumes. We propose a quantum-inspired approach that exploits the unique properties of quantum entanglement to establish a dynamic, probabilistic search framework. The core mechanism involves constructing a 'entanglement-aware' search space, enabling rapid pattern identification and improved matching efficiency. This algorithm is designed to outperform classical search techniques by focusing on higher-dimensional correlations and minimizing the computational cost associated with exhaustive search. The paper details the algorithm's design, analysis of its performance, and potential applications in data analysis and pattern recognition. The focus is on demonstrating the practical benefits of quantum entanglement in a search context, specifically addressing challenges related to scale and speed.
Modern biology is increasingly represented through graphs, including protein–protein interaction graphs, cell–cell communication networks, host–pathogen interactomes, gene regulatory networks, and disease–gene association networks. These graphs help capture how molecular and cellular entities interact, signal, regulate, and perturb one another. Classical graph algorithms and graph neural networks have taken this a long way. However, several tasks remain difficult, including network alignment, conserved subgraph discovery, disease–module identification, and therapeutic target prioritization. These challenges are not merely software-engineering issues; many arise from hard combinatorial problem structures and become even harder in practice because biological networks are sparse, noisy, and incompletely annotated. This letter proposesQuantum Network Biology(QNB) as a vocabulary, a scope definition and, above all, a benchmark agenda for asking whether quantum and hybrid quantum–classical methods have anything to offer here. We view biological networks as communication systems. In this view, propagation asks how information moves through a network, and a quantum walk offers a different model of that movement, not just a faster version of a classical algorithm. We separate QNB from quantum biology, quantum bioinformatics and quantum network medicine, pair four quantum primitives with specific graph problems, and specify six benchmarks with named datasets, fixed classical baselines and reported metrics. We do not claim demonstrated quantum advantage. Instead, we argue that the criteria for testing such a claim should be defined now.
Quantum computing has emerged as a potential catalyst for addressing computational bottlenecks that increasingly constrain biotechnologies, including drug discovery, structural biology, and precision medicine. As biological datasets grow in scale and complexity, classical high-performance computing struggles to efficiently model molecular interactions and high-dimensional biological systems. Recent advances in hybrid quantum-classical algorithms and quantum-enhanced machine learning have enabled early proof-of-concept applications on noisy intermediate-scale quantum (NISQ) devices, offering new strategies for molecular simulation, pattern recognition, and optimization. In this opinion article, we critically assess where quantum computing may deliver realistic near-term value for biomedicine, emphasize hybrid workflows as the most viable path forward, and outline how quantum technologies could complement, not replace, existing computational paradigms as the field progresses toward fault-tolerant systems.