• 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.
• 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.
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 quantum computing platforms. The algorithm performs an iterative suppression of states belonging to basins of previously discovered attractors from a uniform superposition, thus increasing the amplitudes of states in basins of yet unknown attractors. This approach guarantees that a new attractor state is measured with each iteration of the algorithm, an optimization not currently achieved by any other algorithm in the literature. Tests of its resistance to noise have also shown promising performance on devices from the current Noise Intermediate Scale Quantum Computing (NISQ) era.
• Published on bioRxiv, presenting the first quantum algorithm to dramatically accelerate Flux Balance Analysis (FBA), a core technique in cellular metabolism research. • Overcomes the computational limits of existing classical computing by introducing the Quantum Interior Point Method (QIPM) utilizing Quantum Singular Value Transformation (QSVT) technology. • Proves computational advantage by demonstrating accurate convergence to optimal metabolic fluxes through simulations of the glycolysis and TCA cycle networks. [Quantum Biology Society] Biological systems in living organisms, such as cellular metabolism, are intricately entangled with thousands of biochemical reactions. Modeling and analyzing this network, which determines how a cell grows, responds to its environment, and produces energy, requires massive mathematical computations. As the scale increases, existing classical computers easily hit computational limits. Recently, an innovative study solving the optimization problem of such complex metabolic networks at high speed using quantum computing technology has been published, drawing the academic community's attention. A paper titled "Quantum Algorithm for Metabolic Network Analysis" was released on the preprint repository bioRxiv. Through this paper, a research team comprising Ashish Joshi and Takahiko Koyama from Keio University in Japan presented the first instance of reconfiguring Flux Balance Analysis (FBA)—considered a core and standard technique in cellular metabolism research—to be processed on quantum hardware. ■ Overcoming the Wall of Massive Matrices with Quantum Singular Value Transformation (QSVT) Flux Balance Analysis (FBA) is equivalent to the process of solving a massive Linear Programming problem. To overcome the vast matrix inversions occurring in this process, the researchers newly introduced the Quantum Interior Point Method (QIPM) consisting of quantum subroutines. In particular, by utilizing Quantum Singular Value Transformation (QSVT) technology, a state-of-the-art quantum algorithmic technique, they succeeded in transforming the metabolic optimization problem to run efficiently on a quantum computer. Through this, they designed it to dramatically reduce the bottleneck of classical algorithms, where computation time increases exponentially as the network scale grows and constraints become more complex. ■ Successful Simulation of Glycolysis and the TCA Cycle... Proving Computational Advantage This quantum approach provides a firm computational advantage over the existing classical interior point methods in computing large-scale and highly constrained biological networks. Not stopping at a theoretical proposal, the researchers directly demonstrated the practical applicability of this quantum algorithm by conducting numerical simulations on the glycolysis and TCA cycle networks, the core energy metabolic pathways of cells. As a result of the analysis, it was mathematically proven that the quantum solution accurately converges to the optimal metabolic flux, the correct biological target, without error. This study is evaluated as a significant milestone showing that quantum computing technology can be utilized as a practical and powerful tool to solve challenges in complex systems biology and metabolic engineering, going beyond the realms of physics or chemistry. If this algorithm is advanced and applied to actual large-scale quantum hardware in the future, it is expected to revolutionarily accelerate the production of useful substances using microbial engineering or the discovery of therapeutic targets for intractable metabolic diseases.
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 AIP Publishing's APL Quantum, fully applying digital quantum simulation (DQS) to spin biology. • Successfully implemented the quantum spin dynamics of the radical pair mechanism utilizing the 'Trotterization' technique. • Analyzed the noise limits of actual quantum hardware and demonstrated the potential of utilizing quantum computing for the future development of new drugs targeting complex biomolecules. [Quantum Biology Society] In the emerging field of quantum biology, simulating spin-chemistry systems with actual biological complexity has posed computational limitations that are difficult to overcome with conventional classical computers. This is because as the number of elements constituting the spin system increases, the dimension of the Hilbert space required for computation grows exponentially. Recently, a study simulating biological phenomena using an actual digital quantum computer was published to resolve this problem, drawing the attention of the academic community. A paper titled "Simulating spin biology using a digital quantum computer: Prospects on a near-term quantum hardware emulator" was published on August 19 in APL Quantum, a journal of AIP Publishing. This research was led by a multinational joint research team including Pedro H. Alvarez and Clarice D. Aiello. ■ Mapping the Radical Pair Mechanism via Trotterization The radical pair mechanism (RPM), represented by the magnetic field sensing (magnetoreception) ability of migratory birds, centers on the quantum entanglement and coherence phenomena of electron spins in vivo. The research team introduced the Trotterization technique to directly apply gate-based digital quantum simulation (DQS) to biological systems. Through this technique, they successfully mapped the coherent spin dynamics of radical pairs onto quantum circuits. In ideal, noise-free quantum circuit simulations, they obtained accurate spin dynamics results consistent with the conventional classical Haberkorn master equation approach using only about 15 Trotter steps. ■ Analysis of Quantum Hardware Noise Limits and Future Prospects Furthermore, going beyond ideal environments, the research team conducted an in-depth analysis of the impact of realistic error models on simulations using a near-term (NISQ) quantum hardware emulator that mimics the noise profile of an IBM quantum device (e.g., ibmq_jakarta). The analysis revealed that realistic limitations were observed due to the constrained performance and noise (such as phase damping and amplitude damping) of current quantum hardware, including a shift in singlet yield and a decreased ability to sense magnetic field anisotropy. However, the researchers showed that by fitting an analytical model to the measured noisy data, the overall dynamical shape depending on the magnetic field angle could be successfully derived. In addition, they presented a practical upper limit for the number of Trotter steps that can be directly run on quantum devices if error mitigation techniques are introduced in the future. Unlike conventional classical computing methods that face exponential limits, the DQS approach possesses the potential to efficiently model biological spin systems simply through linear resource scaling by adding qubits. This study is evaluated as a groundbreaking first step demonstrating that digital quantum simulation can be utilized as an innovative tool for new drug development targeting complex biomolecules and ultra-precise biosensing modeling by directly calculating the entanglement and coherence of biological phenomena.
• Developed quantum codes based on Grover's algorithm using an IBM 127-qubit quantum simulator for large-scale genetic sequence analysis and optimization. • Successfully searched a 3,022-nucleotide database for a 50-nucleotide target sequence at exponential speeds with high flexibility (allowing up to a 30% mismatch rate). • Successfully constructed a synthetic structure named "Quantum Biological Block (BioBloQu)," which combines components such as a promoter and an enzyme, within a minimal JCVI-syn3.0 cell. [Quantum Biology Society] To process the exponentially growing vast amounts of biological data, research results applying quantum algorithms to genomics in earnest have been released for the first time. Recently, a paper titled "GENETIC ENGINEERING THROUGH QUANTUM CIRCUITS: CONSTRUCTION OF CODES AND ANALYSIS OF GENETIC ELEMENTS BIOBLOQU" was published on bioRxiv, a preprint repository for biology. ■ Breaking Through the Limits of Genetic Analysis with a 127-Qubit Quantum Simulator To analyze and optimize large-scale genetic sequences, the research team newly developed two quantum codes applying Grover's algorithm based on IBM's 127-qubit quantum simulator. As a result of testing this quantum algorithm, they succeeded in finding a specific target sequence consisting of 50 nucleotides within a DNA database composed of up to 3,022 nucleotides. In particular, considering natural genetic variations, it demonstrated overwhelmingly fast and flexible search capabilities compared to existing classical computing exploration methods, even allowing a mismatch rate of up to 30%. ■ 'Quantum Biological Block (BioBloQu)' Planted Inside an Artificial Cell The team's achievements did not stop at simple quantum code development and sequence exploration. Based on these quantum computing-based search results, the researchers focused on the interior of 'JCVI-syn3.0', an artificial cell model that maintains life phenomena with only minimal genes. Here, they successfully constructed a synthetic structure named the 'Quantum Biological Block (BioBloQu)', composed of a promoter, a ribosome binding site (RBS), an enzyme, and a terminator. This achievement is highly significant in that it proved quantum computing technology is not merely at a theoretical level, but is a powerful tool capable of innovatively accelerating the speed of actual genetic exploration and manipulation.
A study published on bioRxiv demonstrates the first hybrid quantum computing framework combining classical Hamming distance filtering with the Grover quantum search algorithm to overcome bottlenecks in massive genomic data analysis. Utilizing the IBM Qiskit 27-qubit simulator, researchers rapidly and flawlessly identified a 50-nucleotide target sequence of a Cas9-like nuclease within a Brazilian biome metagenome database, even under conditions allowing up to a 30% mismatch. The study lays a revolutionary foundation for synthetic genome design by completing simulations that precisely insert a "BioBloQu" (quantum biological block)—composed of a promoter, an RBS, an enzyme, and a terminator—into the explored scar regions of the minimal genome M. mycoides JCVI-Syn3B. [Quantum Biology Society] Modern life sciences are pouring out genomic sequencing data at an exponential rate. However, due to the immense complexity of biological data, existing classical computing methods are facing severe computational bottlenecks in analyzing and manipulating it. To break through these limitations, a disruptive study recently published on the preprint repository bioRxiv, titled "Genetic Engineering with Quantum Circuits: creating codes and studying BioBloQu genetic elements," has brought quantum computers to the forefront of genetic engineering. A joint research team led by Professor Elibio Rech from the Brazilian Agricultural Research Corporation (Embrapa) Genetic Resources and Biotechnology and the Federal University of Rio Grande do Sul (UFRGS) presented this innovative research. ■ Scanning Massive Genomic Databases with Qubits Using the core quantum mechanical principles of superposition and entanglement as the foundation for information processing, the research team developed a hybrid quantum framework that combines classical Hamming distance filtering with the Grover quantum search algorithm. Powered by IBM's Qiskit 27-qubit simulator, this algorithm was used to search for a 50-nucleotide target sequence of a Cas9-like nuclease within a Brazilian biome metagenome database. As a result, the team successfully and swiftly identified the massive genetic data through amplitude amplification, filtering out the sequence perfectly even under conditions allowing up to a 30% mismatch rate. This proves that vast amounts of genetic data, which are unmanageable for classical computers, can be analyzed in a flash through quantum parallel processing. ■ The Era of Synthetic Genome Design Opened by BioBloQu Furthermore, the researchers successfully completed a quantum circuit simulation that accurately inserts a synthetic genetic construct called "BioBloQu" (quantum biological block) into the identified target regions. In the genome of M. mycoides JCVI-Syn3B, an artificially synthesized minimal genome model, the quantum algorithm first identified two 20-nucleotide "scar" regions—which are traces of gene editing. Then, it precisely integrated a tandem genetic block (BioBloQu) composed of a promoter, a ribosome binding site (RBS), an enzyme sequence, and a terminator into that location. This innovative approach goes beyond simply cutting and pasting existing genes physicochemically; it opens up the possibility of designing and assembling novel synthetic genomes from the ground up under the control of quantum algorithms equipped with overwhelming computational power. By directly applying the computational power of quantum mechanics to biotechnology, this research is expected to serve as the starting point for a massive revolution in next-generation quantum-bio data manipulation, customized gene therapy, and synthetic biology. #QuantumComputing #GeneticRecombination #BioBloQu #QuantumAlgorithm #GroverAlgorithm #Metagenome #SyntheticBiology #GenomeDesign #QuantumBiology #KoreanQuantumBiologySociety https://www.biorxiv.org/content/10.1101/2025.05.02.651535v2