A study published on bioRxiv presents the first proof-of-concept workflow that combines non-linear autoencoders (deep representation learning) with the Quantum Approximate Optimization Algorithm (QAOA) to detect functional modules within biological networks. By training on cardiac (left ventricle) and skeletal muscle transcriptomic data into a 10-dimensional latent space, the research converts the module search problem into a Quadratic Unconstrained Binary Optimization (QUBO) problem mapped onto quantum circuits, precisely capturing the heterogeneous shapes of real biological modules. It demonstrates the potential for quantum computing-based system biology module discovery by achieving high-quality approximations of irregular, dense latent-space networks that are difficult for classical methods to resolve. [Quantum Biology Society] Understanding biological systems, where genes, proteins, and metabolites are intertwined in a vast web, is akin to the "Holy Grail" of modern medicine and biotechnology. While identifying functional modules responsible for specific disease mechanisms or regulatory circuits within these complex networks is a core task of systems biology, existing classical computing methods have faced exponential computational bottlenecks as network scales increase. Recently, an innovative, data-driven workflow combining deep learning and quantum optimization has been unveiled, opening a new chapter in network biology. The paper titled "Quantum Deep Learning Pipeline for Next Generation Network Biology," published on the preprint repository bioRxiv, offers a practical path toward solving these complexity issues using quantum computing. This innovative research was led by a team from the Gisma University of Applied Sciences in Germany, including Milad Yazdi, Kushala Ralpati Srinivas, and Ajay Yadav. ■ A Powerful Combination of Autoencoders and QAOA The research team first input vast transcriptomic data obtained from GTEx Normal datasets (Heart Left Ventricle, Muscle Skeletal, UCSC Xena Toil, etc.) into a non-linear autoencoder—a deep representation learning model—to compress them into a 10-dimensional latent space. After constructing a correlation graph of the complex latent data obtained from this process, they transformed the module discovery problem into a Quadratic Unconstrained Binary Optimization (QUBO) form that quantum circuits can interpret. The key to this approach was solving this optimization problem using the Quantum Approximate Optimization Algorithm (QAOA, depth d=3). ■ The Power of Quantum Computation in Capturing Irregular Modules Experimental results demonstrate that this QAOA-based quantum deep learning pipeline precisely captured the highly heterogeneous and irregular shapes of biological modules that are difficult for classical algorithms to identify. In particular, it successfully achieved high-quality approximations of dense latent-space network structures that are easily overlooked by conventional methods. This serves as significant evidence that quantum computing can surpass the limitations of classical computing architectures in handling the inherent non-linearity and complexity of biological data. ■ A Robust Foundation for Next-Generation Network Biology This achievement goes beyond mere improvements in algorithmic performance. By successfully bridging the data processing power of deep learning with the computational efficiency of quantum optimization, the study proves that quantum computing can contribute as a practical driving force in identifying complex disease mechanisms and precise biological regulatory circuits at the large-scale genomic level. It is evaluated as having established the most robust and scalable technical framework for future next-generation network biology research. https://www.biorxiv.org/content/10.1101/2025.10.28.685074v1
A study published on bioRxiv presents the first proof-of-concept workflow that combines non-linear autoencoders (deep representation learning) with the Quantum Approximate Optimization Algorithm (QAOA) to detect functional modules within biological networks. By training on cardiac (left ventricle) and skeletal muscle transcriptomic data into a 10-dimensional latent space, the research converts the module search problem into a Quadratic Unconstrained Binary Optimization (QUBO) problem mapped onto quantum circuits, precisely capturing the heterogeneous shapes of real biological modules. It demonstrates the potential for quantum computing-based system biology module discovery by achieving high-quality approximations of irregular, dense latent-space networks that are difficult for classical methods to resolve. [Quantum Biology Society] Understanding biological systems, where genes, proteins, and metabolites are intertwined in a vast web, is akin to the "Holy Grail" of modern medicine and biotechnology. While identifying functional modules responsible for specific disease mechanisms or regulatory circuits within these complex networks is a core task of systems biology, existing classical computing methods have faced exponential computational bottlenecks as network scales increase. Recently, an innovative, data-driven workflow combining deep learning and quantum optimization has been unveiled, opening a new chapter in network biology. The paper titled "Quantum Deep Learning Pipeline for Next Generation Network Biology," published on the preprint repository bioRxiv, offers a practical path toward solving these complexity issues using quantum computing. This innovative research was led by a team from the Gisma University of Applied Sciences in Germany, including Milad Yazdi, Kushala Ralpati Srinivas, and Ajay Yadav. ■ A Powerful Combination of Autoencoders and QAOA The research team first input vast transcriptomic data obtained from GTEx Normal datasets (Heart Left Ventricle, Muscle Skeletal, UCSC Xena Toil, etc.) into a non-linear autoencoder—a deep representation learning model—to compress them into a 10-dimensional latent space. After constructing a correlation graph of the complex latent data obtained from this process, they transformed the module discovery problem into a Quadratic Unconstrained Binary Optimization (QUBO) form that quantum circuits can interpret. The key to this approach was solving this optimization problem using the Quantum Approximate Optimization Algorithm (QAOA, depth d=3). ■ The Power of Quantum Computation in Capturing Irregular Modules Experimental results demonstrate that this QAOA-based quantum deep learning pipeline precisely captured the highly heterogeneous and irregular shapes of biological modules that are difficult for classical algorithms to identify. In particular, it successfully achieved high-quality approximations of dense latent-space network structures that are easily overlooked by conventional methods. This serves as significant evidence that quantum computing can surpass the limitations of classical computing architectures in handling the inherent non-linearity and complexity of biological data. ■ A Robust Foundation for Next-Generation Network Biology This achievement goes beyond mere improvements in algorithmic performance. By successfully bridging the data processing power of deep learning with the computational efficiency of quantum optimization, the study proves that quantum computing can contribute as a practical driving force in identifying complex disease mechanisms and precise biological regulatory circuits at the large-scale genomic level. It is evaluated as having established the most robust and scalable technical framework for future next-generation network biology research. https://www.biorxiv.org/content/10.1101/2025.10.28.685074v1
Abstract Purpose Module discovery in omics networks is central to interpretation. Classical pipelines capture broad community structure, but exact search for small, connected, topology aware modules is combinatorial, making exhaustive solutions impractical at genome scale. Moreover, most quantum clique formulations to date optimize only maximal density on non biological graphs, which mismatches the heterogeneous shapes of real biological modules. Methods We trained a symmetric 10-dimensional autoencoder on GTEx normals (Heart Left Ventricle; Muscle Skeletal; UCSC Xena Toil) to obtain tissue-specific latent representations. For each tissue we built a 10*10 latent-node correlation graph and formulated a QUBO that rewards strong edges and penalizes isolated selections (edge threshold τ=0.80). QAOA (depth=3, COBYLA) generated high-probability bitstrings, which we post-filtered to retain connected, non-overlapping subsets; decoder triggered gene sets and multi-library enrichment provided functional interpretation. Results QAOA distilled the Heart graph to three dyads (2-node modules with strong-edge sums ≈0.89/0.95), pairing conduction with mitochondria, conduction with ECM/adhesion, and two contractile nodes. In Muscle, QAOA returned one dominant 6-node module (edge-sum ≈7.0) integrating contractile machinery, electrophysiology, mitochondrial metabolism, and translation; a weaker ECM leaning triplet was visible but fell below the top 10 threshold. Conclusion QAOA based quantum optimization yields discrete, testable modules from latent correlations that match tissue programs. Despite a 10-node demo (current limits), the scale-agnostic design extends to 10^3 10^5 nodes and multi omics via hierarchical compression and hybrid search supporting quantum modeling for next generation network biology.
A study published on bioRxiv demonstrates for the first time the technique of treating protein sequences like sentences in natural language processing (NLP) and parsing them into parameterized quantum circuits using the Quantum Natural Language (QNLP) framework. It establishes a scheme that converts protein sequences into tensor networks represented by wires and boxes, and maps them onto actual quantum circuits through semantic functors. By generating protein syntax trees with a neural network-based parser and converting them into string diagrams optimized for quantum processor execution, the study proves that 'Quantum Tensor Networks (QTN)' achieve overwhelming computational accuracy in classifying vast protein sequences. [Quantum Biology Society] An innovative approach has been proposed to decode protein sequences—the most fundamental and complex codes of living organisms—by converting them into a natural language that quantum computers can comprehend. The paper titled "Application of Quantum Tensor Networks for Protein Classification", published in the preprint repository bioRxiv, introduces a groundbreaking pipeline that applies Quantum Natural Language Processing (QNLP) technology to protein sequence classification, opening a new horizon for next-generation bioinformatics. A research team from Pennsylvania State University, including Debarshi Kundu, Jian Wang, Archisman Ghosh, and Nikolay Dokholyan, led this innovative study. ■ QNLP: Reading Protein Sequences as Sentences The researchers introduced a unique perspective of treating protein sequences, which are arrays of amino acids, as if they were sentences composed in human language. To achieve this, they adopted the 'Quantum Natural Language (QNLP)' framework, which combines state-of-the-art computational natural language processing (NLP) techniques with quantum computing. Within this framework, protein sequences are parsed into syntax trees with grammatical structures through a neural network-based parser, laying the foundation for their direct conversion into parameterized quantum circuits. ■ Transformation into Tensor Networks and String Diagrams In this process, protein sequences are converted into a tensor network scheme, geometrically represented by wires and boxes. The researchers defined a sophisticated semantic function (functor) that perfectly maps this abstract network to the operational structure of actual quantum circuits. The generated syntax trees are ultimately transformed into string diagrams, a format optimized for execution on quantum processors. Consequently, the constructed Quantum Tensor Networks (QTN) demonstrated overwhelming computational accuracy in machine learning tasks that involve extracting features and functionally classifying highly diverse and complex protein sequences, even in environments with a limited number of available qubits. This demonstration is highly significant as it establishes a powerful workflow in drug discovery and biotechnology, enabling rapid and accurate analysis of massive genomic data and protein interaction structures through quantum algorithms, transcending the limits of conventional classical computers. #QuantumTensorNetworks #QNLP #ProteinClassification #QuantumMachineLearning #QuantumLanguageModel #ProteinSequenceAnalysis #QuantumBiology #Biophysics #ArtificialIntelligence #KoreanQuantumBiologySociety https://www.biorxiv.org/content/10.1101/2024.03.11.584501v1
• Published on bioRxiv, proposing the 'Quantum Hamiltonian-based gene-expression model (QHGM)' for Gene Regulatory Network (GRN) inference. • Treats genes as 'qubits', interpreting gene interactions over pseudotime by encoding them into quantum entanglement and Hamiltonian matrices. • Applied to glioblastoma (GBM) single-cell RNA sequencing data, successfully elucidating complex cancer cell developmental networks by overcoming the limitations of classical machine learning models. [Quantum Biology Society] Gene Regulatory Networks (GRNs), which determine the cell fate and phenotype of living organisms, are highly dynamic systems where numerous genes and proteins intricately entangle and interact. Despite the massive influx of data from recent advancements in single-cell RNA sequencing (scRNA-seq) technology, existing classical machine learning models have faced limitations in perfectly capturing the delicate context of biological regulation and non-classical probabilistic features. A recent study has been published that dramatically solves this challenge in systems biology through the 'Quantum Hamiltonian Learning (QHL)' framework, which infers the parameters of a many-body quantum system. The paper, titled "Quantum Hamiltonian Learning using Time-Resolved Measurement Data and its Application to Gene Regulatory Network Inference," published on the preprint repository bioRxiv, showcases an unconventional approach of modeling gene networks as macroscopic quantum systems. A joint research team, including Mohammad Aamir Sohail and Professor Arvind Rao from the University of Michigan, USA, led this innovative study. ■ Genes as Qubits, Regulatory Networks as Hamiltonians The 'Quantum Hamiltonian-based gene-expression model (QHGM)' proposed by the research team treats individual genes as qubits. The unexpressed state of a gene is defined as the basis state |0>, and the expressed state as |1>. Regulatory interactions, such as activation or repression between genes, are encoded as weights within a parameterized Hamiltonian matrix constructed using tensor products. Gene qubits, which initially start in independent separable states, evolve according to the Schrödinger equation along pseudotime, an indicator of cell development that acts as physical time. During this evolution process, complex correlations akin to quantum entanglement are formed between genes according to the interaction rules inputted into the Hamiltonian. ■ Combination of IC-POVM Measurements and VQ-Net AI To extract gene expression data from these entangled quantum states, the researchers introduced single-qubit IC-POVM, an informationally complete quantum measurement technique. These measurement results are linked to the discretized gene expression profiles observed in actual scRNA-seq data. Subsequently, the team developed VQ-Net, a variational quantum network inference algorithm based on a mini-batch empirical risk minimization framework. Based on the scRNA-seq data collected over pseudotime, this algorithm minimizes the negative log-likelihood loss and learns by inversely tracing the weight parameters of the Hamiltonian. ■ Elucidating the Glioblastoma (GBM) Network… Outperforming Classical Models This quantum-biology hybrid model did not stop at mere theory but was deployed in actual cancer research. By analyzing scRNA-seq data from patients with IDH-wild-type glioblastoma (GBM), a malignant brain tumor, the researchers inferred the gene regulatory program governing the differentiation of OPC-like cells. The analysis revealed that the QHGM model accurately pinpointed how core genes such as ASCL1, CDK4, and STMN1 interact with cell-cycle proliferation and extracellular matrix (ECM) components, identifying dense feedback loops and directionality consistent with biological literature. Notably, this method scales polynomially with system size, and recorded overwhelmingly higher accuracy and F1 scores in network edge recovery and weight sign identification than representative classical inference algorithms such as ARACNE, GENIE3, and GeneNet. This study is a groundbreaking achievement demonstrating how powerfully "quantum-like" modeling, which interprets complex biological systems using the mathematical tools of quantum information theory, can be utilized in analyzing actual clinical and multi-omics data. The researchers emphasized that this framework will provide crucial insights for understanding the heterogeneity and plasticity of cancer cells and discovering new therapeutic targets in the future.
A study published on the preprint repository arXiv comprehensively outlines empirical applications of quantum algorithms (such as VQE, QAOA) that can be executed on near-term noisy intermediate-scale quantum (NISQ) hardware to solve key challenges in molecular biology and drug discovery, such as protein folding and molecular docking. Through quantum simulations that overcome the limits of classical computing, it was demonstrated that by directly simulating the Hamiltonian of a chemical system, the 3D energy-minimized state of peptides or small molecule compounds can be accurately predicted with significantly fewer computing resources than before. It provides a practical roadmap for combining quantum machine learning (QML) and molecular biology to dramatically reduce massive computational costs and achieve overwhelming efficiency in the next-generation in silico drug discovery process. [Quantum Biology Society] Problems such as protein folding and molecular docking, which cause the biggest bottlenecks in the drug discovery process, become exponentially more complex as the amino acid sequence gets longer. The number of cases to explore explodes, making it difficult for classical computers to handle their NP-hard complexity. Recently, a groundbreaking demonstration framework aiming to introduce the latest quantum computing algorithms into the pharmaceutical and biotechnology fields to overcome these limitations has been presented, drawing attention from the related industry. The paper titled "Quantum computing for molecular biology," published on the preprint repository arXiv, comprehensively covers the application of practical quantum algorithms (e.g., VQE, QAOA) capable of solving drug discovery challenges that have hit the limits of classical computing, using noisy intermediate-scale quantum (NISQ) hardware. A research team including Alberto Baiardi and Markus Reiher from ETH Zurich in Switzerland, along with Matthias Christandl from the University of Copenhagen in Denmark, led this innovative convergent research. ■ Quantum Simulation: Overcoming the Limits of Classical Computing The research team demonstrated that by utilizing the characteristic of quantum computers to efficiently map and directly simulate the Hamiltonian of chemical systems, the complex 3D energy-minimized states of peptides or small molecule compounds can be accurately found with significantly fewer computing resources than before. This is because quantum computers can fundamentally bypass the "curse of dimensionality," where the computational amount expands exponentially, by naturally simulating the quantum mechanical properties of molecules. ■ A Roadmap for Next-Generation Drug Discovery This research goes beyond simply presenting algorithms; it provides a specific roadmap for next-generation in silico drug discovery processes by combining quantum machine learning (QML) and molecular biology. Through this, it has opened a path to achieve overwhelming efficiency by drastically reducing the massive computational costs and time required to screen drug candidates and optimize their most stable binding structures. This practical guide strongly suggests that quantum computing will become a core foundational technology bringing substantial innovation to the life sciences and pharmaceutical industries in the future. https://arxiv.org/abs/2212.12220
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
• 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.