<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Archiving and Interchange DTD v2.3 20070202//EN" "archivearticle.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="systematic-review" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Comput. Sci.</journal-id>
<journal-title>Frontiers in Computer Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Comput. Sci.</abbrev-journal-title>
<issn pub-type="epub">2624-9898</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fcomp.2025.1464122</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Computer Science</subject>
<subj-group>
<subject>Systematic Review</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Quantum natural language processing and its applications in bioinformatics: a comprehensive review of methodologies, concepts, and future directions</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Pallavi</surname> <given-names>Gundala</given-names></name>
<uri xlink:href="https://loop.frontiersin.org/people/2780956/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Prasanna Kumar</surname> <given-names>Rangarajan</given-names></name>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff><institution>Department of Computer Science and Engineering, Amrita School of Computing, Amrita Vishwa Vidyapeetham</institution>, <addr-line>Chennai</addr-line>, <country>India</country></aff>
<author-notes>
<fn fn-type="edited-by" id="fn0001"><p>Edited by: Fasih Haider, University of Edinburgh, United Kingdom</p></fn>
<fn fn-type="edited-by" id="fn0002"><p>Reviewed by: H. Z. Shen, Northeast Normal University, China</p><p>Imane Guellil, University of Edinburgh, United Kingdom</p></fn>
<corresp id="c001">&#x002A;Correspondence: Rangarajan Prasanna Kumar, <email>r_prasannakumar@ch.amrita.edu</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>18</day>
<month>02</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>7</volume>
<elocation-id>1464122</elocation-id>
<history>
<date date-type="received">
<day>13</day>
<month>07</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>24</day>
<month>01</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2025 Pallavi and Prasanna Kumar.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Pallavi and Prasanna Kumar</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Quantum Natural Language Processing (QNLP) is a relatively new subfield of research that extends the application of principles of natural language processing and quantum computing that has enabled the processing of complex biological information to unprecedented levels. The present comprehensive review analyses the potential of QNLP in influencing many branches of bioinformatics such as genomic sequence analysis, protein structure prediction, and drug discovery and design. To establish a correct background of QNLP techniques, this article is going to explore the basics of quantum computing including qubits, quantum entanglement, and quantum algorithms. The next section is devoted to the application of QNLP in the extraction of material and valuable information and knowledge related to drug discovery and development, prediction and assessment of drug-target interactions. In addition, the paper also explains the application of QNLP in protein structural prediction by quantum embedding, quantum simulation, and quantum optimization for exploring the sequence-structure relationship. However, this study also acknowledges the future of QNLP in bioinformatics in the discussion of the challenges and weaknesses of quantum hardware, data representation, encoding, and the construction and enhancement of the algorithms. This looks into real-life problems solved from industry applications, benchmarking and assessment criteria, and a comparison with other traditional NLP methods. Therefore, the review enunciates the research and application perspectives, as well as the developmental and implementation blueprint for QNLP in bioinformatics. The plan is as follows: its function is to achieve the objectives of precision medicine, new protein design, multi-omics, and green chemistry.</p>
</abstract>
<kwd-group>
<kwd>quantum natural language processing</kwd>
<kwd>bioinformatics</kwd>
<kwd>sustainability</kwd>
<kwd>drug discovery</kwd>
<kwd>knowledge extraction</kwd>
<kwd>protein prediction</kwd>
<kwd>genome analysis</kwd>
</kwd-group>
<counts>
<fig-count count="15"/>
<table-count count="10"/>
<equation-count count="17"/>
<ref-count count="178"/>
<page-count count="32"/>
<word-count count="23907"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Theoretical Computer Science</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="sec1">
<label>1</label>
<title>Introduction</title>
<p>Natural language processing (NLP) is a field of computer science and a subfield of artificial intelligence that aims to make computers understand human language. NLP uses computational linguistics, which is the study of how language works, and various models based on statistics, machine learning, and deep learning. Quantum Natural Language Processing (QNLP) is an integrative approach that encompasses natural language processing and physical theories taken from quantum mechanics to speed up the process of analyzing human language (<xref ref-type="bibr" rid="ref66">Karamlou et al., 2022</xref>). By doing so, it can transform how humans engage with language-based data by proposing new and unique enhancements for a range of purposes such as Text Processing and Preprocessing; semantic analysis; text classification, sentiment analysis; information retrieval; and language translation. Because of principles as superposition and entanglement, QNLP can process enormous amounts of linguistic information simultaneously, which in turn entails a more efficient and comprehensive analysis of language than in classical NLP (<xref ref-type="bibr" rid="ref166">Widdows et al., 2024</xref>). Besides, it is believed that QNLP should be more efficient and precise than conventional NLP due to the peculiarities of quantum computing as the solution to the problems associated with context-dependent and linguistic information.</p>
<p>Quantum systems, on which QNLP is based, are divided into two types: closed and open. Isolated quantum systems evolve under unitary time evolution, that is, by the Schr&#x00F6;dinger equation. These systems are best used in theoretical work and form the basis of QNLP. On the other hand, the open quantum system has contact with other surroundings, the evolution is non-unitary due to dissipation and decoherence(<xref ref-type="bibr" rid="ref165">Weidner et al., 2024</xref>). As a start for the exploration of QNLP techniques, this paper initially concentrates on closed quantum systems, although recognizing that open systems affected by Markovian and non-Markovian processes are essential in quantum computation. This work could be extended in future research by incorporating open quantum system models to expand the areas to which QNLP can be applied.</p>
<sec id="sec2">
<label>1.1</label>
<title>Background and motivation</title>
<p>In the past, ever since the development of modern computing, the application of algorithms and mathematical models in biological studies has expanded tremendously (<xref ref-type="bibr" rid="ref106">Ofer et al., 2021</xref>). Natural language processing is now an indispensable method of data mining in bioinformatics to enable fast and efficient extraction of knowledge from bulk data. However, classical NLP techniques have problems with the organization of complexity, heterogeneity, and scale, typical for biological data, including scientific articles, databases, and experimental outcomes (<xref ref-type="bibr" rid="ref69">Khurana et al., 2023</xref>). These limitations call for a change in the approach to computational strategies.</p>
<p>QNLP alleviates this problem by using quantum computing&#x2019;s strengths of handling big data most efficiently. Quantum circuits and compositional vector-based semantics used in language tasks improve the simulation of biological processes such as interactions between molecules and genomics data analysis. For example, QNLP methods could bring a drastic improvement in such tasks as protein folding prediction, ligand binding constant estimation, and genome-wide sequence comparison. Since there is no currently implementable quantum hardware, the current quantum algorithms, simulators, and prototype quantum systems allow for research into QNLP in bioinformatics (<xref ref-type="bibr" rid="ref54">Havl&#x00ED;&#x010D;ek et al., 2019</xref>).</p>
</sec>
<sec id="sec3">
<label>1.2</label>
<title>Biological challenges, scope, and contribution</title>
<p>Bioinformatics has a significant scope and potential contribution to Quantum Natural Language Processing (QNLP). The knowledge that can be utilized to enhance QNLP models is extracted from biological data using bioinformatics approaches, including text mining and natural language processing. An example of the advanced analytical skills that bioinformatics can contribute to QNLP (<xref ref-type="bibr" rid="ref59">Huang et al., 2015</xref>) is the utilization of NLP approaches for the detection of noncoding RNA and the prediction of protein structure and function. Particularly in light of the quantum advantage in processing massive amounts of data (<xref ref-type="bibr" rid="ref75">Kumar et al., 2024</xref>), the computational models and algorithms utilized in bioinformatics to manage huge datasets may be advantageous for QNLP. Furthermore, novel approaches to language processing in QNLP may be presented by the incorporation of bio-inspired models into computing, as elaborated in reference (<xref ref-type="bibr" rid="ref63">Jim&#x00E9;nez L&#x00F3;pez, 2022</xref>).</p>
<p>At the time of biological data processing, however, conventional NLP methodologies confront several obstacles: The dualistic nature and uncertainty in achieving accurate reading and decoding of sentences in biology using typical natural language processing (NLP) models is sometimes difficult due to the terminology&#x2019;s complexity, which often includes acronyms and multiple meanings (<xref ref-type="bibr" rid="ref86">Locke et al., 2021</xref>). Integration and analysis of biological data are complicated by the heterogeneity of the data (<xref ref-type="bibr" rid="ref57">Hilton et al., 2020</xref>). On the contrary, biological data sources include scientific articles, databases, experimental results, and scientific papers; each possesses its distinct organization, format, and nomenclature. Given the rapid expansion of biological data, traditional natural language processing (NLP) methods may face challenges in efficient processing and analyzing enormous datasets, leading to limitations in scalability and performance (<xref ref-type="bibr" rid="ref84">Liu et al., 2024</xref>). In contrast to classical computers, quantum computers can revolutionize algorithm efficiency through the execution of operations that classical machines are incapable of. This can result in significant accelerations through the avoidance of superfluous computations. The quantum computers can execute intricate computations within days, which would require classical supercomputers an eternity to finish. Despite the lack of fully operational quantum hardware, efforts have continued to create and investigate quantum algorithms for natural language processing (NLP). Recent advancements in prototype construction, coupled with mathematical analysis and the introduction of high-performance quantum computer simulators, have facilitated the investigation of quantum algorithms for a wide range of biological applications (<xref ref-type="bibr" rid="ref107">Ohno-Machado et al., 2013</xref>).</p>
<p>Although these difficulties highlight the need for novel computational techniques, QNLP presents encouraging paths to fill these gaps. This paper outlines a comprehensive approach to explore these possibilities, bridging theoretical and practical aspects of QNLP in bioinformatics.</p>
</sec>
<sec id="sec4">
<label>1.3</label>
<title>Contribution and organization of the paper</title>
<p>The theoretical underpinnings and practical applications of quantum computing and QNLP in the domain of bioinformatics are encompassed within the scope of this article. In addition to outlining forthcoming opportunities and problems, it offers a complete assessment of the existing status of research in this location. The structure of the paper is as follows:</p>
<p>This research employs a systematic research methodology in Section 2 which outlines, detailing the search strategy, inclusion and exclusion criteria, and quality assessment process used for the review of QNLP in bioinformatics. The foundational principles of quantum computing and an assortment of QNLP approaches are presented in Section 3. Potential QNLP applications in various bioinformatics disciplines, including drug discovery and design, protein structure prediction, genomic sequence analysis, and biomedical literature mining, are examined in Section 4. The problems and limitations of QNLP in bioinformatics are examined in Section 5. These encompass constraints imposed by quantum hardware, concerns related to data representation and encoding, as well as the development and optimization of algorithms. Performance evaluation and comparative analysis are the subjects of Section 6. Evaluation metrics and a comparison of traditional NLP approaches versus QNLP methods are all covered. Section 7 provides a critical examination of the findings in relation to the research questions. In conclusion, Section 8 delves into prospective research avenues Future Research Directions, and Roadmap.</p>
</sec>
</sec>
<sec id="sec5">
<label>2</label>
<title>Research methodology</title>
<p>We examine Quantum Natural Language Processing (QNLP) and its bioinformatics applications in this exhaustive review. Our primary objective is to define the fundamental concepts of quantum computing and QNLP methodologies, with an emphasis on their potential advantages over conventional NLP approaches. Then, we examine the myriad bioinformatics applications of QNLP, which include biomedical literature mining, drug discovery and design, protein structure prediction, and genomic sequence analysis. Furthermore, we endeavor to recognize and investigate the barriers and restrictions that plague quantum natural language processing in the field of bioinformatics. These include limitations imposed by quantum hardware, complications related to data representation and encoding, as well as difficulties in developing and optimizing algorithms. To assess the practical implications and efficacy of QNLP, a comparative study is undertaken with traditional NLP methodologies. This analysis is substantiated by benchmarking outcomes and empirical case studies.</p>
<sec id="sec6">
<label>2.1</label>
<title>Research questions</title>
<p>Research Question 1: Investigate the application of quantum computing concepts and methodologies to natural language processing (QNLP).</p>
<p>Research Question 2: In what ways could QNLP be utilized to automate and enhance the drug discovery and design process, namely in literature mining, drug-target interaction prediction, and virtual screening?</p>
<p>Research Question 3: What is the performance of QNLP algorithms about traditional NLP techniques, as evaluated using benchmarking and criteria metrics?</p>
<p>Research Question 4: What are the current limitations and future opportunities for QNLP in bioinformatics?</p>
<p>Our objective is to furnish a comprehensive synopsis of the present state of QNLP in bioinformatics, expose areas where further research is warranted, and establish a framework for the advancement and adoption of QNLP in this field.</p>
</sec>
<sec id="sec7">
<label>2.2</label>
<title>Search strategy</title>
<p>A comprehensive search was performed for this study, covering the period from 2013 to 2024. The search encompassed several reputable databases, such as PubMed, Scopus, IEEE Xplore, ACM Digital Library, and Web of Science. The extensive inquiry was motivated by the particular emphasis on the utilization of quantum-based techniques in addressing bioinformatics obstacles, such as drug development, Protein structure prediction, and genetic analysis, among others. With deliberate intention, we expanded our search beyond medical databases such as PubMed and Medline, which predominantly cover health informatics and biomedical subjects. Conversely, we investigated numerous databases about the domain of computer science (CS). The papers were identified by the utilization of several screening tasks and quantum computing-related keywords &#x2018;Quantum Search Strategy,&#x2019; &#x2018;Quantum Embeddings&#x2019;, &#x2018;Quantum Mapping&#x2019;, &#x2018;Quantum Superposition and Quantum Entanglement&#x2019;, &#x2018;Prediction&#x2019; and incorporating NLP keywords like &#x2018;Relation Extraction&#x2019;, &#x2018;Name entity Recognition&#x2019;, &#x2018;Semantic Analysis, Sentiment Analysis&#x2019;, &#x2018;Knowledge discovery&#x2019;, &#x2018;Machine learning in NLP&#x2019;.</p>
</sec>
<sec id="sec8">
<label>2.3</label>
<title>Selection criteria</title>
<p>The criteria for including articles in this selection were as follows:</p>
<list list-type="alpha-lower">
<list-item><p>Articles must be written in English;</p></list-item>
<list-item><p>Publication date must be 2013 or later;</p></list-item>
<list-item><p>Articles must make initial and significant contributions to the field.</p></list-item>
<list-item><p>Articles must be published as original journal articles or conference proceedings.</p></list-item>
</list>
<p>This review did not include if:</p>
<list list-type="alpha-lower">
<list-item><p>The research was published in the form of a summary, research report, conference abstract, news article, internet-based material, or workshop report, or as a research protocol.</p></list-item>
<list-item><p>The study was identified as duplicates using a systematic approach which includes automatic detection through Zotero followed by manual verification.</p></list-item>
<list-item><p>Articles focused on research involving animals or non-human samples.</p></list-item>
<list-item><p>Articles did not address any of the research questions.</p></list-item>
</list>
<p>Quality Assessment Criteria (QAC) were created to guarantee the dependability and methodological soundness of the included studies. These standards assess the research based on its contributions to the area, methodological transparency, and relevancy. In addition to ensuring consistency in evaluating the caliber of research, the QACs aid in standardizing the inclusion process.</p>
<table-wrap position="anchor" id="tab1">
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">QAC</th>
<th align="left" valign="top">Assessment criteria</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">QAC 1</td>
<td align="left" valign="top">Does the study utilize quantum natural language processing (QNLP) techniques?</td>
</tr>
<tr>
<td align="left" valign="top">QAC 2</td>
<td align="left" valign="top">Is the study relevant to bioinformatics tasks?</td>
</tr>
<tr>
<td align="left" valign="top">QAC 3</td>
<td align="left" valign="top">Is there a clear motivation for the research?</td>
</tr>
<tr>
<td align="left" valign="top">QAC 4</td>
<td align="left" valign="top">Does the study confirm the experimental findings with adequate evaluation metrics?</td>
</tr>
<tr>
<td align="left" valign="top">QAC 5</td>
<td align="left" valign="top">Is there a clear motivation for the research that aligns with solving specific challenges in bioinformatics?</td>
</tr>
<tr>
<td align="left" valign="top">QAC 6</td>
<td align="left" valign="top">Are the experimental setups, including experimental environments and dataset details, described in detail?</td>
</tr>
<tr>
<td align="left" valign="top">QAC 7</td>
<td align="left" valign="top">Does the key contributions and limitations of the study.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Each study has been evaluated using the QAC scoring system:</p>
<table-wrap position="anchor" id="tab2">
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Score</th>
<th align="left" valign="top">Criteria</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle">0</td>
<td align="left" valign="middle">If does not meet mentioned QAC</td>
</tr>
<tr>
<td align="left" valign="middle">1</td>
<td align="left" valign="middle">Partially met the QAC</td>
</tr>
<tr>
<td align="left" valign="middle">2</td>
<td align="left" valign="middle">Completely met QAC</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, the initial search yielded a total of 1,417 records from the specified databases. After eliminating 450 duplicate articles, 967 records remained for screening. Subsequently, based on the pre-established inclusion criteria, 737 articles were excluded, leaving us with 230 articles for consideration in the second round of the selection process. Following a thorough examination of the full-text articles, a total of 184 papers were included in this systematic review. The next section begins with the review of the foundational principles of quantum computing and an assortment of QNLP approaches.</p>
<fig position="float" id="fig1">
<label>Figure 1</label>
<caption>
<p>PRISMA diagram.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g001.tif"/>
</fig>
</sec>
</sec>
<sec id="sec9">
<label>3</label>
<title>Quantum computing concepts and QNLP techniques</title>
<p>Quantum Natural Language Processing (QNLP) is an academic discipline that is founded upon the ideas and concepts of quantum computing, which are inherently distinct from the paradigms of classical computing. To comprehend the potential of QNLP and its bioinformatics applications, it is essential first to grasp quantum computing&#x2019;s fundamentals. This section presents a comprehensive outline of the foundational principles, establishing the preparatory stage for the following discourse on QNLP methodologies and their ramifications within the realm of bioinformatics.</p>
<sec id="sec10">
<label>3.1</label>
<title>Fundamental quantum computing concepts</title>
<p>In contrast, quantum computers unlock an entirely new realm of potentialities. The initial obstacle in describing quantum computing is elucidating its information management system. Data is usually maintained in quantum bits, or qubits, which is a quantum version of classical computer bits present in a quantum processor. Integrating quantum computers in artificial intelligence (AI) has implications (<xref ref-type="bibr" rid="ref119">Portugal, 2022</xref>). AI algorithms, which can be based on traditional computation techniques, could give by quantum processors the ability to gain vast processing capabilities. Defined by specific features such as superposition, interference, entanglement, DE coherence, gates, and circuits. For altering the way how AI deals with data, quantum computing opens the grounds for progressively complex and swift AI operations and the emergence of new quantum algorithms given these phenomena (<xref ref-type="bibr" rid="ref117">Piattini et al., 2020</xref>).</p>
<sec id="sec11">
<label>3.1.1</label>
<title>Qubit</title>
<p>Quantum bits are actual physical systems of a photon with a specific polarization or an ion trapped in a magnetic field. a qubit is described as the basic information unit of a quantum computer. A qubit is different from a classical computer bit which can be either 0 or 1 at any one time but a qubit can be 0 and 1 simultaneously. Observe <xref ref-type="fig" rid="fig2">Figure 2</xref> where the behavior of the coin shows the classical and quantum physics stating the key difference between the deterministic and probabilistic systems which introduces the quantum superposition and entanglement. In classical the coin has two possible states Head or Tail when it is spinning it lands on either head or tail so it has a chance of 50% for both head and tail. In quantum, the coin blends in both head and tail calculating the probability of the states and giving the state that has a high probability value. This is called superposition which can make quantum computers solve many problems altogether hence making them so efficient for specific tasks.</p>
<fig position="float" id="fig2">
<label>Figure 2</label>
<caption>
<p>Classical bit vs. quantum bit.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g002.tif"/>
</fig>
<p>Qubits are basics units of quantum computer systems and are physically implemented through certain entities such as ions subjected to magnetic fields. A qubit can be in any state other than 0 and 1 as Schrodinger&#x2019;s cat is alive and dead state at the same time (<xref ref-type="bibr" rid="ref12">Black et al., 2002</xref>). A qubit exhibits one of the following collapse states when observed? Interactions with a single qubit can affect the entire state, as groups of qubits can correlate. Qubits, which are denoted by the complex coefficients <italic>&#x03B1;</italic> and <italic>&#x03B2;</italic>, exist in a superposition of the states 0 and 1, whereas bits are the fundamental units of traditional computing.</p>
<p>In <xref ref-type="fig" rid="fig3">Figure 3</xref> watching a qubit changing its state, these coefficients pertain to physical measurements. In the domain of quantum information, the qubit, represented by the Dirac notation |0&#x27E9; and consisting of two states, serves as the comparable entity. |1&#x27E9;, where |&#x2022;&#x27E9; denotes a quantum state. The main difference between quantum and classical information is that, as <xref ref-type="disp-formula" rid="EQ1">Equation 1</xref> illustrates, a qubit can exist in any superposition of the states |0&#x27E9; and |1&#x27E9;.</p>
<disp-formula id="EQ1"><label>(1)</label><mml:math id="M1"><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03A8;</mml:mi><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo stretchy="true">|</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mspace width="0.5em"/><mml:mo stretchy="true">|</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="true">&#x232A;</mml:mo></mml:math></disp-formula>
<disp-formula id="EQ2"><label>(2)</label><mml:math id="M2"><mml:mi mathvariant="normal">Where</mml:mi><mml:mspace width="thickmathspace"/><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi><mml:mspace width="thickmathspace"/><mml:mspace width="thickmathspace"/><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mo stretchy="true">|</mml:mo><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:mo stretchy="true">|</mml:mo><mml:mspace width="thickmathspace"/><mml:mi>&#x03B2;</mml:mi><mml:mspace width="thickmathspace"/><mml:msup><mml:mo stretchy="true">|</mml:mo><mml:mn>2</mml:mn></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></disp-formula>
<fig position="float" id="fig3">
<label>Figure 3</label>
<caption>
<p>Qubit representation along with superposition.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g003.tif"/>
</fig>
<p>The frequencies of the distinct states in quantum computing are denoted by the complex coefficients <italic>&#x03B1;</italic> and <italic>&#x03B2;</italic>. As a fundamental principle of quantum physics, these amplitudes are highly susceptible to the impact of physical measurement. A qubit&#x2019;s state will be altered during the measurement process, by the principles of quantum mechanics (<xref ref-type="bibr" rid="ref31">Dejpasand and Sasani Ghamsari, 2023</xref>), if it is in a superposition of potential measurement outcomes. As a qubit collapses into its measured state, its amplitudes lose all information. Complex language patterns and relationships in biological data can be represented by qubits, which are capable of existing in superposition states. Simultaneously including numerous linguistic aspects or representations, QNLP models provide a more comprehensive analysis of biological texts, analogous to how a qubit can exist in a superposition of states.</p>
</sec>
<sec id="sec12"><label>3.1.2</label>
<title>Quantum entanglement</title>
<p>In addition, entanglement is a quantum phenomenon that qubits are capable of manifesting, in which the states of two qubits become coupled irrespective of their separation. It is easier to imagine two qubits as two magic dice. In classical the flipping of two dice results is independent of each other. As shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>, in quantum they are &#x201C;entangled,&#x201D; then flipping one die immediately reveals the outcome of the other no matter where the two are located across the room, across the country, across the universe! Their results are perfectly correlated, even though the outcomes are random and unpredictable. This magical connection does not work the way we observe other connections that are usual to us but is a natural component of quantum mechanics.</p>
<fig position="float" id="fig4"><label>Figure 4</label>
<caption>
<p>Entangled dices.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g004.tif"/>
</fig>
<p>The experimental data show that any quantum calculation that does not require entanglement can be carried out at a slightly slower pace on a classical computer. When computing is associated with systems, which involve many qubits that are susceptible to quantum entanglement, one fully understands the meaning of computing. Entanglement is defined as any process that takes place on a single qubit influences the total state of the whole set of qubits.</p>
<p><xref ref-type="fig" rid="fig5">Figure 5</xref> represents system consists of two qubits, with each qubit capable of existing in a superposition of the states |0&#x27E9;, |1&#x27E9;, the combined system can also exist in any superposition of the states |00&#x27E9;, |01&#x27E9;, |10&#x27E9;, |11&#x27E9;, and so forth (or any of the 2^N binary strings from |0&#x2026;0.0&#x27E9; to |1&#x2026;0.1&#x27E9; in the case of an N-qubit system). The so-called Bell states, which are significant in the context of quantum entanglement (<xref ref-type="bibr" rid="ref168">Wong, 2019</xref>), are among these superpositions. This is illustrated by <xref ref-type="disp-formula" rid="EQ2">Equation 2</xref>.</p>
<disp-formula id="EQ3"><label>(3)</label><mml:math id="M3"><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03A8;</mml:mi><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msqrt><mml:mn>2</mml:mn></mml:msqrt></mml:mfrac><mml:mfenced open="(" close=")"><mml:mfenced open="|" close="&#x232A;"><mml:mrow><mml:mn>10</mml:mn><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy="true">|</mml:mo><mml:mn>01</mml:mn></mml:mrow></mml:mfenced></mml:mfenced></mml:math></disp-formula>
<fig position="float" id="fig5"><label>Figure 5</label>
<caption>
<p>Quantum entanglement.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g005.tif"/>
</fig>
<p>The underlying assumption is based on the potential of the quantum computer to work at data-intensive large volumes. In order to understand this, let us consider a quantum system of N qubits at our disposal. If the state of the system is not entangled, the number of amplitudes in a state of this system is equal to 2^N, where amplitudes of states of each qubit in the system are summed. When the system becomes entangled, however, these amplitudes all become independent and the qubit register as a whole transform into a 2&#x202F;N-dimensional vector (<xref ref-type="bibr" rid="ref153">Tao, 2024</xref>). By modeling and analyzing interrelated links between biological things or concepts represented in textual data, the concept of quantum entanglement is utilized. Similar to how quantum entanglement enables the correlation of qubits, QNLP represents and comprehends the intricate interrelationships among proteins, illnesses, genes, and other biological components by employing this idea.</p>
</sec>
<sec id="sec13"><label>3.1.3</label>
<title>Quantum interference</title>
<p>Quantum interference is employed in the computation of quantum computers with the help of <xref ref-type="disp-formula" rid="EQ3">Equation 3</xref>, which is helpful. However, acknowledging the fact that quantum computers are inherently noisy and do not always provide accurate results and decisions, they always utilize probability to provide the best guess or most likely occurrence anticipated. Besides locations, quantum computers use the energy level of qubits or spin to do computations (<xref ref-type="bibr" rid="ref144">Simmons, 2024</xref>). This can be expressed using the Born rule, which states that the probability of measuring a particular outcome x given a quantum state represented by a density matrix <italic>&#x03C1;</italic> is given by:</p>
<disp-formula id="EQ4"><label>(4)</label><mml:math id="M4"><mml:mo stretchy="true">|</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mi mathvariant="normal">total</mml:mi></mml:msub><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="normal">c</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="true">|</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="normal">c</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="true">|</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="true">&#x232A;</mml:mo></mml:math></disp-formula>
<p>The weight of each state in the superposition is determined by the complex probability amplitudes, denoted as c<sub>1</sub> and c<sub>2</sub>, which are represented by <xref ref-type="disp-formula" rid="EQ4">Equation 4</xref>. The interference of various states may result in interference effects in the final state &#x2223;&#x03C8;<sub>total</sub>&#x27E9;, which can manifest as observable phenomena like interference patterns in experiments involving interference, such as the double-slit experiment.</p>
<p>The interference element (c1c2&#x002A;) in the superposition formula has the potential to induce either constructive or destructive interference, contingent upon the relative phases of &#x1D450;1 and &#x1D450;2. The interference behavior described here is an essential component of quantum physics and has far-reaching implications for quantum communication, computation, and other technologies.</p>
<p>The processing and analysis of textual data may be improved with the application of quantum interference (<xref ref-type="bibr" rid="ref156">Torlai and Melko, 2020</xref>). Utilizing interference effects, QNLP models are capable of conducting more complex and context-aware analyses by modeling language elements and relationships as quantum states (<xref ref-type="bibr" rid="ref123">Pseiner et al., 2024</xref>). Language modeling, sentiment analysis, and information extraction from biological texts are a few examples of the tasks in which this may result in enhanced precision.</p>
</sec>
<sec id="sec14"><label>3.1.4</label>
<title>Quantum gates</title>
<p>Quantum information can be manipulated by performing quantum gates wherein physical operations are utilized by using laser pulse for the ion qubits and optical elements for the photonic qubits. Unlike their more often than not conceptual definitions, quantum gates have to be described as unitary matrices by strict quantum mechanical demands. When a quantum gate is performed on at least two entangled qubits, then a 2&#x202F;N&#x202F;&#x00D7;&#x202F;2&#x202F;N matrix is multiplied by a 2&#x202F;N entity. The fact that quantum computers can register and manipulate roughly 2&#x202F;N quantities of information using a number of operations equal to N forms the basis of a possible exponential quantum edge over classical computers.</p>
<p>For quantum gates to be used in the normalizing of quantum states, they have to be unit and linear, or act on superposition (<xref ref-type="bibr" rid="ref72">Klimov et al., 2024</xref>). But, unlike classical computing that involves only one nontrivial gate, namely the NOT gate per bit, quantum computing can perform an infinite number of one-qubit quantum gates. It has been established that any quantum gate can be approximated from a basis set of gates which only includes the single qubit gate and the two qubit controlled NOT gate. The exponential number of gates may hinder the application of good approximations should the need arise in the future. Language properties and relationships can be transformed by quantum gates and therefore, more complex tasks can be performed (<xref ref-type="bibr" rid="ref158">Van Vu et al., 2024</xref>).</p>
<p>The development of quantum algorithms that are well suited to AI tasks such as data analysis, optimization, and machine learning has elicited a lot of attention from academic and industrial pioneers (<xref ref-type="bibr" rid="ref121">Preskill, 2018</xref>). These algorithms exploit the specific features of quantum computers and, thus, perform calculations, which makes artificial intelligence operations more complex and faster compared to their counterparts based on classical computers (<xref ref-type="bibr" rid="ref112">Patel et al., 2023</xref>). The properties of classical and quantum computing that distinguish their respective methods of operation are compared in <xref ref-type="table" rid="tab3">Table 1</xref>.</p>
<table-wrap position="float" id="tab3"><label>Table 1</label>
<caption>
<p>Comparison of classical and quantum computing properties.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Property</th>
<th align="left" valign="top">Classical Computing</th>
<th align="left" valign="top">Quantum Computing</th>
<th align="left" valign="top">Ref</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle">Information Unit</td>
<td align="left" valign="middle">Bit (0 or 1)</td>
<td align="left" valign="middle">Qubit (0, 1, or superposition of 0 and 1)</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref12">Black et al. (2002)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Parallelism</td>
<td align="left" valign="middle">Limited parallel processing</td>
<td align="left" valign="middle">Quantum parallelism</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref121">Preskill (2018)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Information Processing</td>
<td align="left" valign="middle">Deterministic</td>
<td align="left" valign="middle">Probabilistic</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref38">Farahmand et al. (2014)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Complexity Theory</td>
<td align="left" valign="middle">Bounded by polynomial time</td>
<td align="left" valign="middle">Can solve certain problems in polynomial time</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref142">Shor (1999)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Computing Model</td>
<td align="left" valign="middle">Turing Machine</td>
<td align="left" valign="middle">Quantum Circuit Model</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref121">Preskill (2018)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Energy Efficiency</td>
<td align="left" valign="middle">High energy consumption</td>
<td align="left" valign="middle">Potentially energy-efficient</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref50">Gyongyosi and Imre (2019)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Error Correction</td>
<td align="left" valign="middle">Classical error-correcting codes</td>
<td align="left" valign="middle">Quantum error-correction codes</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref127">Ramette et al. (2024)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Computational Speedup</td>
<td align="left" valign="middle">Limited speedup for certain problems</td>
<td align="left" valign="middle">Exponential speedup for certain problems</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref142">Shor (1999)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Memory Storage</td>
<td align="left" valign="middle">Classical memory (RAM, hard drives)</td>
<td align="left" valign="middle">Quantum memory (quantum registers)</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref56">Heshami et al. (2016)</xref>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Having discussed the fundamental principles of quantum computing, the next section focuses on how these principles are adapted and implemented in QNLP methodologies, particularly in bioinformatics applications.</p>
</sec>
</sec>
<sec id="sec15"><label>3.2</label>
<title>Quantum natural language processing techniques</title>
<p>Quantum natural language processing (QNLP) improves natural language processing tasks through the utilization of quantum computing and parameterized quantum circuits to compute word embeddings. Drawing inspiration from categorical quantum mechanics, the DisCoCat framework, this approach transitions from grammatical structure to quantum processes via string diagrams. By employing the DisCoCat framework and Grover&#x2019;s algorithm, the initial QNLP algorithm showcased a quadratic quantum acceleration in the domain of text categorization and the quantum language models which generates the text using the quantum algorithms by improving the model efficiency.</p>
<sec id="sec16"><label>3.2.1</label>
<title>Quantum embedding</title>
<p>While we have the classical embeddings like Word2Vec or Glove, which map words in the high-dimensional vector space where quantum embedding maps words or phrases as quantum states as observed in <xref ref-type="fig" rid="fig6">Figure 6</xref>. This could lead to improved levels of comparison between text analysis and semantic similarity assessments of texts. In few of the research, the advantages of quantum embedding in NLP tasks were highlighted. One of the works suggested a quantum embedding model based on quantum circuits. By mapping words or phrases into quantum states through quantum gates, our paradigm allows more accurate and effective control and description of linguistic features compared to traditional methods (<xref ref-type="bibr" rid="ref98">Nam and Nguyen., 2024</xref>). A unique approach inspired by quantum mechanics is presented in this study, which utilizes embeddings to facilitate biomedical text-mining tasks including entity detection and relation extraction. By exploiting quantum computing principles, this approach transforms high-dimensional quantum states into biological concepts and relationships (<xref ref-type="bibr" rid="ref134">Samanta et al., 2016</xref>; <xref ref-type="bibr" rid="ref8">Baiardi et al., 2023</xref>).</p>
<fig position="float" id="fig6"><label>Figure 6</label>
<caption>
<p>Quantum embedding.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g006.tif"/>
</fig>
<p>One approach is to use amplitude encoding, where each word is encoded as a quantum state is represented in <xref ref-type="disp-formula" rid="EQ5">Equation 5</xref>:</p>
<disp-formula id="EQ5"><label>(5)</label><mml:math id="M5"><mml:mo stretchy="true">|</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mo stretchy="true">&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:mstyle><mml:mo stretchy="true">|</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">&#x232A;</mml:mo></mml:math></disp-formula>
<p>where, |i&#x27E9; represents the basis states, and &#x03B1;_i are the complex amplitudes corresponding to the word w. An innovative methodology utilizes the principles of quantum computing to encode relationships and concepts in biomedicine into high-dimensional quantum states.</p>
</sec>
<sec id="sec17"><label>3.2.2</label>
<title>Discocat framework</title>
<p>Quantum Natural Language Processing (QNLP) is a recent and fascinating application of quantum computing that seeks to represent the meaning of sentences as vectors encoded into quantum computers (<xref ref-type="bibr" rid="ref2">Abbaszade et al., 2021</xref>). It achieves this by extending the distributional meaning of words to encompass the compositional meaning of sentences, a concept known as the DisCoCat model (<xref ref-type="bibr" rid="ref92">Martinez and Leroy-Meline, 2022</xref>). This model employs an algorithm based on tensor products to compose the vectors representing the meanings of words through the syntactic structure of the sentence. One striking aspect of this approach is that while the algorithm is inefficient on classical computers, it exhibits promising scalability when executed using quantum circuits.</p>
<p>One of the fundamental ideas underlying the convergence of quantum theory and natural language processing is the establishment of a direct link between linguistic features, such as syntactic structures and semantic meanings, and quantum states (<xref ref-type="bibr" rid="ref152">Surov et al., 2021</xref>). As illustrated in <xref ref-type="fig" rid="fig5">Figure 5</xref> (<xref ref-type="bibr" rid="ref174">Yeung and Kartsaklis, 2021</xref>), the DisCoCat framework serves as a network-like language for accomplishing this relationship through the use of string diagrams as given in <xref ref-type="fig" rid="fig7">Figure 7</xref>. This approach is an integral part of the longstanding tradition of computational linguistics, which has sought efficient methods for describing language structures and meanings in machine-accessible formats (<xref ref-type="bibr" rid="ref157">Tsujii, 2021</xref>). The distributional approach relies on statistical analysis of word contexts based on the distributional hypothesis. In contrast, the symbolic approach focuses on individual word meanings and the compositionality of sentences. The symbolic approach, rooted in theoretical linguistics, posits that the meaning of a sentence depends on the meanings of its constituent words and the grammar used to arrange them (<xref ref-type="bibr" rid="ref40">Ganguly et al., 2022</xref>). One of paper shows how DisCoCat allows QNLP to classify biomedical abstracts by building sentence embeddings that retain structural and content-based characteristics. By mapping the syntactic dependencies of sentences to quantum states, the framework improves the identification of functional/contextual similarities in biology articles (<xref ref-type="bibr" rid="ref148">Steedman and Baldridge, 2011</xref>). However, this approach has seen limited success in natural language processing applications, where the distributional paradigm, based on statistical analysis, currently dominates (<xref ref-type="bibr" rid="ref83">Liu et al., 2024</xref>).</p>
<fig position="float" id="fig7"><label>Figure 7</label>
<caption>
<p>DiscoCat model.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g007.tif"/>
</fig>
</sec>
<sec id="sec18"><label>3.2.3</label>
<title>Quantum language models</title>
<p>Quantum language models (QLM) is a kind of quantum-inspired neural network model that defines language units, such as words and phrases, as quantum states in Hilbert space and create text using quantum algorithms, which may result in exponential speedups compared to classical models. Complex patterns in language data can be efficiently learned by the Quantum Boltzmann Machine (QBM), allowing for more precise language production and modeling (<xref ref-type="bibr" rid="ref167">Wiebe et al., 2019</xref>). The present study introduces a novel quantum circuit-based QLM architecture and showcases its efficacy in various domains, including text classification, sentiment analysis, and language modeling (<xref ref-type="bibr" rid="ref143">Shuyue et al., 2023</xref>). The existing body of research primarily represents word sequences as a classical mixture of word states, which fails to adequately utilize the capabilities of a probabilistic quantum description (<xref ref-type="bibr" rid="ref15">Campbell et al., 2024</xref>). As of yet, a comprehensive quantum model that explicitly captures the non-classical correlations inside word sequences has not been created (<xref ref-type="bibr" rid="ref175">Yu et al., 2020</xref>). A neural network architecture has been suggested, using an innovative Entanglement Embedding (EE) component, to convert word sequences into entangled pure states of many-body quantum systems. The word sequences exhibit robust quantum entanglement, a fundamental principle of quantum information and a sign of parallelized correlations among the words (<xref ref-type="bibr" rid="ref20">Chen et al., 2023</xref>; <xref ref-type="fig" rid="fig8">Figure 8</xref>).</p>
<fig position="float" id="fig8"><label>Figure 8</label>
<caption>
<p>QLM model.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g008.tif"/>
</fig>
<p><xref ref-type="disp-formula" rid="EQ6">Equation 6</xref> represents the quantum circuit to estimate the probability distribution over words, given a context as follows:</p>
<disp-formula id="EQ6"><label>(6)</label><mml:math id="M6"><mml:mi mathvariant="normal">P(w|c)</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="&#x2329;" close="&#x232A;"><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mfenced open="(" close=")"><mml:mi mathvariant="normal">c</mml:mi></mml:mfenced><mml:mo stretchy="true">|</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>U</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mi>w</mml:mi></mml:msub><mml:mspace width="0.25em"/><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mfenced open="(" close=")"><mml:mi>c</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:math></disp-formula>
<p>Where, |&#x03C8;(c)&#x27E9; is the quantum state representing the context, U_w is a unitary operator corresponding to the word w, and &#x27E8;&#x03C8;(c)|U_w|&#x03C8;(c)&#x27E9; is the probability amplitude of observing w given c.</p>
<p>In the field of bioinformatics, QLMs predict the probability of a word in a context so that functions such as sequence alignment have been accomplished (<xref ref-type="bibr" rid="ref81">Liang et al., 2023</xref>). Linguistic features are processed in quantum circuits which enhances the accuracy of sentiment to be derived from research abstracts or clinical data (<xref ref-type="bibr" rid="ref26">D'Aloisio et al., 2024</xref>). Potential advantages of this quantum approach to estimating the probability distribution across words over classical methods include a more effective capacity to capture complex dependencies and context information (<xref ref-type="bibr" rid="ref62">Jayanth et al., 2023</xref>).</p>
<p>These techniques not only capture complex linguistic relationships but also lay the foundation for addressing bioinformatics where semantic precision is critical. In the following section, we explore how Quantum techniques are used in the QNLP tasks.</p>
</sec>
</sec>
<sec id="sec19"><label>3.3</label>
<title>Quantum techniques for QNLP</title>
<p>Quantum natural language processing extends the recent advances of classical machine learning and quantum machine learning to process language. Traditional deep learning methods like embeddings, neural networks, and transformers have paved the way for NLP progress by allowing functions such as text categorization, sentiment analysis, and translation. The above approaches are expanded on by QNLP but with the use of QML for scalability and efficiency. Two methods, Quantum Circuit Learning (QCL) and Quantum Kernel Learning (QKL), introduced in the paper, are designed to contribute to QNLP tasks as QNLP tasks involve encoding linguistic data into quantum states and pattern matching. Hybrid quantum-classical methods even extend the capacity of QNLP due to integration of quantum advantage with classical flexibility. For the first time, QNLP applies quantum optimization and quantum embeddings, thus connecting traditional NLP with quantum calculations and offering effective approaches to context-sensitive language processing, entity identification, and semantic search. It is in this regard that this relationship demonstrates how QNLP applies ML and QML frameworks to reinvent NLP in bioinformatics and more broadly.</p>
<sec id="sec20"><label>3.3.1</label>
<title>Quantum machine learning in bioinformatics</title>
<p>Machine learning (ML) is a branch of Artificial intelligence that enables systems to learn patterns from data and make predictions. NLP focuses on equipping computers to comprehend, interpret, and generate human language and ML uses that data to generate predictions, decisions, and classifications. This ML integration in NLP is observed in <xref ref-type="fig" rid="fig9">Figure 9</xref>.</p>
<fig position="float" id="fig9"><label>Figure 9</label>
<caption>
<p>Machine learning.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g009.tif"/>
</fig>
<p>Quantum Machine Learning (QML) combines quantum computing with machine learning to enhance data processing by leveraging quantum properties like superposition and entanglement, offering exponential speedups and richer data representations (<xref ref-type="bibr" rid="ref27">Das Sarma et al., 2019</xref>). Within QML, Quantum Natural Language Processing (QNLP) specializes in applying quantum principles to linguistic tasks, encoding text as quantum states and enabling efficient processing of language structures. Like sentiment analysis, semantic parsing, and relation extraction to scale efficiently while uncovering deeper patterns in language using quantum-enhanced embeddings and kernels. As Bioinformatics involves analyzing and interpreting large volumes of biological data, such as genomic sequences, protein structures, and gene expression data. QNLP benefits from QML&#x2019;s advanced computation, many problems in this field can be formulated as machine learning tasks, such as classification, clustering, and pattern recognition (<xref ref-type="bibr" rid="ref129">Repetto et al., 2024</xref>; <xref ref-type="bibr" rid="ref41">Ghoabdi and Afsaneh, 2023</xref>).</p>
<p>Quantum machine learning (QML) has emerged as a promising approach to tackle these challenges, leveraging the principles of quantum mechanics to potentially enhance the computational capabilities of classical machine learning algorithms. The following concepts are provided for further enhancement of QML techniques.</p>
<sec id="sec21"><label>3.3.1.1</label>
<title>Quantum circuit learning for bioinformatics</title>
<p>QML in bioinformatics is quantum circuit learning, which is the process of training parameterized quantum circuits to perform certain kinds of machine learning. These circuits can be represented as unitary operators U(<italic>&#x03B8;</italic>), where &#x03B8; is the set of trainable parameters. It is to find the best parameter &#x03B8;&#x002A; that may minimize a cost function C(&#x03B8;) suitable for the bioinformatics problem in question. Mathematically, the optimization problem can be formulated as <xref ref-type="disp-formula" rid="EQ7">Equation 7</xref>:</p>
<disp-formula id="EQ7"><label>(7)</label><mml:math id="M7"><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mi mathvariant="normal">argmin</mml:mi><mml:mspace width="thickmathspace"/><mml:mi mathvariant="normal">C</mml:mi><mml:mfenced open="(" close=")"><mml:mi>&#x03B8;</mml:mi></mml:mfenced></mml:math></disp-formula>
<p>The cost function C(&#x03B8;) is then calculated through using the quantum circuit U(&#x03B8;) on the input states that are equivalent to the biological data and measuring the output states. The derivatives of the cost function with respect to the parameters can be estimated by methods such as the parameter shift rules or analytical derivatives, and thus optimisation can be performed by gradient-based methods. Some of the works in the field of quantum circuit learning include protein structure prediction (<xref ref-type="bibr" rid="ref88">Madsen et al., 2023</xref>), gene expression analysis (<xref ref-type="bibr" rid="ref101">Navneet and Pokhrel, 2024</xref>), and genomic sequence classification (<xref ref-type="bibr" rid="ref176">Zarei and Elaheh, 2024</xref>). <xref ref-type="bibr" rid="ref131">Robert et al. (2021)</xref> developed a new method for the prediction of the secondary structure of proteins by using Quantum Circuit Learning (QCL). Their model employs a parameterized quantum circuit that takes an amino acid sequence of a protein as the input where QNLP could extract the secondary structure information from text-based annotations where further when coupled with quantum circuit learning to predict components like alpha helices or beta sheets, gives better precision and lesser time than other traditional methods. By adjusting the parameters of the quantum circuit with gradient information of the cost function, the model reduces the error between the predicted and actual secondary structures.</p>
</sec>
<sec id="sec22"><label>3.3.1.2</label>
<title>Quantum kernel methods for bioinformatics</title>
<p>Another subfield of QML in bioinformatics is the so-called quantum kernel methods, which apply quantum features to improve the efficiency of kernel-based machine learning techniques, including SVMs and Kernel methods. Quantum kernel methods are a very suitable addition to QNLP techniques since they provide a method of computing quantum similarity between quantum-encoded linguistic features. This approach may be applied to bioinformatics tasks for semantic classification, such as analyzing connections between drugs and diseases in biological texts.</p>
<p>In quantum kernel methods, the traditional kernel is substituted by a quantum kernel which is determined by the inner product of the quantum states corresponding to biological data. Mathematically, the quantum kernel between two data points x and y can be expressed as:</p>
<disp-formula id="EQ8"><label>(8)</label><mml:math id="M8"><mml:mi mathvariant="normal">K(x,y)=|</mml:mi><mml:mfenced open="&#x2329;" close="&#x232A;"><mml:mrow><mml:mi>&#x03A8;</mml:mi><mml:mfenced open="(" close=")"><mml:mi mathvariant="normal">x</mml:mi></mml:mfenced><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03A8;</mml:mi><mml:mfenced open="(" close=")"><mml:mi mathvariant="normal">y</mml:mi></mml:mfenced></mml:mrow></mml:mfenced><mml:msup><mml:mo stretchy="true">|</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:math></disp-formula>
<p>Where, in <xref ref-type="disp-formula" rid="EQ8">Equation 8</xref> |<italic>&#x03C8;</italic>(x)&#x27E9; and |&#x03C8;(y)&#x27E9; are the quantum states of the data points x and y, respectively. Indeed, quantum kernel methods have been applied in other bioinformatics applications, including quantum machine learning for genomics data (<xref ref-type="bibr" rid="ref1">Abbas, 2024</xref>), quantum kernel clustering for protein sequences (<xref ref-type="bibr" rid="ref135">Sarkar, 2018</xref>), and quantum support vector machines for gene expression analysis (<xref ref-type="bibr" rid="ref42">Ghosh et al., 2024</xref>). <xref ref-type="bibr" rid="ref104">Ng et al. (2023)</xref> considered Quantum Kernel Support Vector Machines (QK-SVM) for classifying gene expression data derived from microarray experiments. Instead of using classical kernels such as linear or radial basis function (RBF), they suggested a quantum kernel that measures the similarity between the gene expression patterns with the help of their quantum state representations using QNLP. The developed QK-SVM algorithm uses this quantum kernel to classify gene expression datasets (<xref ref-type="bibr" rid="ref65">Kang et al., 2019</xref>). The results of this study indicated that the proposed QK-SVM had a better performance of the classification than the classical SVM with traditional kernels on gene expression data sets.</p>
</sec>
<sec id="sec23"><label>3.3.1.3</label>
<title>Hybrid quantum-classical approaches</title>
<p>In addition to purely quantum approaches, hybrid quantum-classical algorithms have also been explored in bioinformatics. By utilizing classical models for extensive biomedical text analysis, hybrid approaches allow quantum circuits to encode context-sensitive language properties. <xref ref-type="fig" rid="fig10">Figure 10</xref> shows both classical and quantum computing resources to solve complex problems more efficiently.</p>
<fig position="float" id="fig10"><label>Figure 10</label>
<caption>
<p>Hybrid quantum-classical approach.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g010.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig11">Figure 11</xref> shows the high-level structure of the Hybrid quantum classical approach, there is a quantum circuit with quantum gates &#x03B8;1, &#x03B8;2, &#x03B8;3, and &#x03B8;4 acting on the input gates. The quantum circuit yields an output which becomes the input for the classical circuit. This approach combines both quantum and classical computing to determine parameters that minimize the loss function which can be any cost function or objective function depending on the use.</p>
<fig position="float" id="fig11"><label>Figure 11</label>
<caption>
<p>Quantum gate representation.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g011.tif"/>
</fig>
<p>Multiple sequence Alignment (MSA) is a basic problem in computational biology that involves comparing biological sequences such as DNA, RNA, or protein sequences; <xref ref-type="bibr" rid="ref88">Madsen et al. (2023)</xref> proposed a new hybrid quantum-classical algorithm for solving this problem. This algorithm utilizes quantum and classical hardware to solve the MSA problem more effectively. The quantum part uses quantum parallelism and superposition to investigate the massive solution space of potential alignments. The application of QML may be vital for solving challenging bioinformatics issues and improving the study of biological processes. Other research works by <xref ref-type="bibr" rid="ref23">Cincio et al. (2020)</xref> and <xref ref-type="bibr" rid="ref53">Hatakeyama-Sato et al. (2022)</xref> have investigated ways of reducing noise and errors in quantum machine learning to guide more efficient and useful applications in bioinformatics.</p>
</sec>
</sec>
<sec id="sec24"><label>3.3.2</label>
<title>Quantum simulation</title>
<p>Quantum simulation involves using quantum computers to solve and model quantum systems which cannot even be approximated by classical computers due to the exponential resource requirement. It opens the chance to model complicated dependencies in the structures of language which is in concordance with the outlook of QNLP. Conducting new studies in this field has been made to explore many approaches to quantum simulation that can offer explanations of numerous quantum phenomena in various fields. A quantum circuit model which encodes the quantum system into a sequence of quantum gates acting on an initial state. As proposed in a recent study (<xref ref-type="bibr" rid="ref36">Dur&#x00E1;n et al., 2023</xref>), the dynamics of a quantum system can be simulated using <xref ref-type="disp-formula" rid="EQ9">Equation 9</xref>:</p>
<disp-formula id="EQ9"><label>(9)</label><mml:math id="M9"><mml:mi>&#x03A8;</mml:mi><mml:mfenced open="(" close=")"><mml:mi>t</mml:mi></mml:mfenced><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi>U</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mfenced open="(" close=")"><mml:mi>t</mml:mi></mml:mfenced><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03A8;</mml:mi><mml:mfenced open="(" close=")"><mml:mn>0</mml:mn></mml:mfenced><mml:mo stretchy="true">&#x232A;</mml:mo></mml:math></disp-formula>
<p>Where |&#x03A8;(0)&#x27E9; is the initial state, U(t) is the time-evolution operator implemented as a quantum circuit, and |&#x03A8;(t)&#x27E9; is the final simulated state after time t. The study demonstrated an efficient simulation of quantum problems using this approach. Another study (<xref ref-type="bibr" rid="ref94">Miranda et al., 2022</xref>) explored quantum annealing for simulating quantum systems, encoding the system into an energy landscape described by a quantum Hamiltonian. The quantum annealing process finds the ground state of the Hamiltonian, corresponding to the simulated system state.</p>
<p>Optimising new quantum algorithms and approximations of quantum circuits for large scale problems. In a recent work by <xref ref-type="bibr" rid="ref37">Edward et al. (2024)</xref>, the authors presented a quantum simulation strategy to simulate biomolecular events including protein folding changes using near-term quantum computers. They explained the basic ideas of the simulation of protein model and showed that quantum computers could be used for investigations of biomolecular systems. For this, they created a quantum algorithm that would be able to efficiently simulate quantum dynamics of the biomolecular system, using quantum characteristics such as superposition and entanglement. <xref ref-type="bibr" rid="ref89">Magann et al. (2021)</xref> studied the application of quantum simulation in protein&#x2013;ligand interactions because these interactions play a vital role in the discovery of drugs and engineering of proteins. They proposed a quantum algorithm for the quantum dynamics of a protein-ligand system and pondered over the benefits of applying quantum computing over the classical approach to this sphere. <xref ref-type="bibr" rid="ref16">Cao et al. (2018)</xref> discussed the use of quantum simulation to study the Protein-DNA binding, which is critical in gene control and drug development. They designed a quantum algorithm for seeking an optimal binding of a protein to a DNA sequence. They debated the significance of such findings for future studies of gene regulation and the development of treatments that modify protein-DNA interactions.</p>
</sec>
<sec id="sec25"><label>3.3.3</label>
<title>Quantum optimization</title>
<p>The major issues in bioinformatics can be addressed using mathematical programming, which involves identifying the solution that provides the minimum or maximum value to a specified objective function. Such problems occur when the search space is large; therefore, it is computationally expensive when solved using conventional algorithms (<xref ref-type="bibr" rid="ref128">Reali et al., 2017</xref>). The objective function is in turn mapped to a Quantum Hamiltonian which describes a wave operator for a quantum system. The goal is to find an optimal solution of the optimization problem which is the ground state energy value of the Hamiltonian.</p>
<p>Let us consider a general optimization problem:</p>
<p>Minimize f(x) Subject to x &#x2208; S where f(x) is the objective function, and S is the set of feasible solutions. In quantum optimization, this problem can be mapped to a quantum Hamiltonian, H, such that the ground state of H corresponds to the optimal solution(s) of the problem. <xref ref-type="disp-formula" rid="EQ10">Equation 10</xref> expresses the quantum Hamiltonian mathematically by:</p>
<disp-formula id="EQ10"><label>(10)</label><mml:math id="M10"><mml:mover accent="true"><mml:mi>H</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mover accent="true"><mml:msub><mml:mi>H</mml:mi><mml:mi>O</mml:mi></mml:msub><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mspace width="thickmathspace"/><mml:mover accent="true"><mml:msub><mml:mi>H</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover></mml:math></disp-formula>
<p>Where: &#x1D43B;o represents the initial Hamiltonian, &#x1D43B;&#x1D45D; is the problem Hamiltonian encoding the objective function and constraints, and &#x1D6FE; is a parameter controlling the weight of &#x1D43B;&#x1D45D; in the overall Hamiltonian.</p>
<p>The goal is to find the ground state of the Hamiltonian H, which can be achieved using quantum algorithms such as quantum annealing or the quantum approximate optimization algorithm (QAOA; <xref ref-type="bibr" rid="ref115">Perdomo-Ortiz et al., 2012</xref>). Quantum annealing is a process where the quantum system is initialized in the ground state of H_0 and then slowly evolves towards the ground state of H by gradually increasing the value of &#x03B3;. This process exploits quantum phenomena like superposition and tunneling to explore the vast solution space more efficiently than classical algorithms.</p>
<p>The QAOA is an iterative algorithm that alternates between applying a mixer operator and a phase operator to an initial quantum state. The mixer operator introduces quantum entanglement, while the phase operator encodes the objective function and constraints. The parameters of these operators are optimized to find an approximate solution to the optimization problem.</p>
<p>Mathematically, <xref ref-type="disp-formula" rid="EQ11">Equation 11</xref> represents the QAOA as follows:</p>
<disp-formula id="EQ11"><label>(11)</label><mml:math id="M11"><mml:mo stretchy="true">|</mml:mo><mml:mi>&#x03A8;</mml:mi><mml:mfenced open="(" close=")" separators=","><mml:mi>&#x03B2;</mml:mi><mml:mi>&#x03B3;</mml:mi></mml:mfenced><mml:mo stretchy="true">&#x232A;</mml:mo><mml:mo>=</mml:mo><mml:mspace width="0.75em"/><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>H</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:msup><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>H</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>..</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:msup><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi><mml:msub><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mi>p</mml:mi></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>H</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mspace width="thickmathspace"/><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi><mml:msub><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mi>p</mml:mi></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>H</mml:mi><mml:mo stretchy="true">&#x0302;</mml:mo></mml:mover><mml:mi>C</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mspace width="thickmathspace"/><mml:mo stretchy="true">|</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></disp-formula>
<p>Where &#x2223;&#x03C8;(&#x03B3;,&#x03B2;) is the quantum state prepared by the circuit, parameterized by vectors &#x1D6FE; and &#x1D6FD;,&#x1D43B;&#x1D435; and HC are the mixing and cost Hamiltonians respectively, representing the classical and quantum parts of the optimization problem,&#x1D6FD;&#x1D45D;,&#x1D6FE;&#x1D45D; are the parameters controlling the evolution of the quantum state,&#x2223;&#x1D713;0&#x27E9; is an initial state, The circuit prepares a state that is expected to encode the optimal solution to the optimization problem and the parameters &#x1D6FE; and &#x1D6FD; are chosen to optimize the objective function.</p>
<p>These techniques optimize parameters in quantum linguistic embeddings, enabling tasks like accurate biomedical question-answering and semantic search. Quantum optimization has shown promise in multiple sequence alignment (MSA), which is a fundamental problem in bioinformatics. The objective of MSA is to discern areas of similarity across numerous biological sequences, hence offering valuable insights into functional conservation and evolutionary connections. Utilizing the quantum features of superposition and tunneling, a recent work (<xref ref-type="bibr" rid="ref9">Benedetti et al., 2017</xref>) developed a quantum annealing methodology for MSA that more effectively explores the huge solution space than classical methods. Protein structure prediction is yet another bioinformatics use of quantum optimization. The optimization issue of deducing the three-dimensional structure of a protein from its amino acid sequence is extremely difficult and involves a large number of local minima. Scholars have investigated the application of quantum annealing and other techniques for quantum optimization to resolve this issue (<xref ref-type="bibr" rid="ref113">Patti et al., 2022</xref>). Additionally, quantum optimization has been implemented to address the issue of inferring gene regulatory networks. The aforementioned networks symbolize the intricate interplay between genes and their regulatory factors. Deducing these networks from experimental data necessitates the resolution of extensive optimization challenges. A recent study (<xref ref-type="bibr" rid="ref96">Mokhtari et al., 2024</xref>) introduced a method for deducing gene regulatory networks using quantum annealing, capitalizing on the quantum computer&#x2019;s enhanced efficiency in traversing the extensive solution space. In addition, additional bioinformatics issues, including drug discovery (<xref ref-type="bibr" rid="ref109">Onodera et al., 2023</xref>), phylogenetic tree reconstruction (<xref ref-type="bibr" rid="ref7">Bach et al., 2024</xref>), and genomic sequence assembly (<xref ref-type="bibr" rid="ref13">Boev et al., 2021</xref>), have demonstrated the potential of quantum optimization.</p>
<p>While these theoretical advances demonstrate the potential of QNLP, their true impact becomes evident in addressing practical challenges in bioinformatics. The following sections explore how these QNLP techniques are applied to bioinformatics problems, such as drug discovery, protein structure prediction, and genomic sequence analysis.</p>
</sec>
</sec>
</sec>
<sec id="sec26"><label>4</label>
<title>QNLP and its applications in bioinformatics</title>
<p>Exploring the application of quantum mechanics principles to the analysis of biological systems, quantum bioinformatics is an emerging field. The nature of computing operations, the platform type, and the type of biological data are the three key determinants upon which a comprehensive categorization system for quantum bioinformatics can be constructed, according to <xref ref-type="bibr" rid="ref91">Marchetti et al. (2022)</xref>. Calculations and tools for data mining activities, and the design, modeling, or creation of computational tools or optimization, are the two primary categories into which computational operations can be classified, according to this study. Furthermore, it is possible to categorize the platform under consideration as either classical or quantum computers and to differentiate between quantum biological data and classical biological data within the realm of biological information. The transformative potential of quantum computing algorithms in the field of computational biology has been recognized by numerous studies. These algorithms possess the capacity to solve, expedite, or improve the examination of a wide range of computational obstacles. The capacity to efficiently map multi-scale biological systems and genetic analysis onto quantum architectures is one example of the potential advantages that quantum computing algorithms may provide over their traditional counterparts, according to a paper by Sathan et al. (<xref ref-type="bibr" rid="ref137">Sathan and Baichoo, 2024</xref>).</p>
<sec id="sec27"><label>4.1</label>
<title>Applications of QNLP in bioinformatics</title>
<p>QNLP works with biological information of sequences such as DNA using quantum computing methods. Quantum scientists have developed large-scale QNLP models that can classify sequences: DNA included. By employing tensor networks, these models are &#x2018;syntax aware&#x2019;&#x2014;they are concerned with structure and syntax from the outset. Thus, the models are more comprehensible and it takes fewer gate operations to work with them in order to gain an understanding of them. Incorporation of tensor networks and quantum theory in QNLP models allows the scientists to study the synergy of AI and quantum informatics in the sphere of bioinformatics. Due to such optimal functionalities like mid-circuit measurement and qubit reuse, quantum processors allow for the execution of circuits larger than what can be done on the quantum hardware (<xref ref-type="bibr" rid="ref97">Na&#x0142;&#x0119;cz-Charkiewicz et al., 2024</xref>). This feature makes available QNLP models for the down and dirty bioinformatics applications featured in the subsequent sections.</p>
</sec>
<sec id="sec28"><label>4.2</label>
<title>Literature mining and knowledge extraction</title>
<p>The most common application of the Quantum Natural Language Processing methodologies in the pharmaceutical study is the knowledge mining and extraction from the biomedical literature. This is due to the exponential increase of data in the biomedical field and unstructured scientific literature that remains a challenge in the application of typical NLP methods as depicted in <xref ref-type="fig" rid="fig12">Figure 12</xref>.</p>
<fig position="float" id="fig12"><label>Figure 12</label>
<caption>
<p>QNLP literature mining and knowledge extraction.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g012.tif"/>
</fig>
<p>In this regard, scholars have analyzed the potential of QML models and algorithms to search for information in biological text data as fast and accurately as possible. Other applications of QNLP include integration of QNLP with other quantum computing paradigms including quantum simulation and quantum machine learning techniques for Biomedical literature mining. They gathered knowledge graphs from biomedical literature using QNLP and used quantum graph neural networks to identify patterns, associations, and related entities in those knowledge graphs. The approach revealed relatively good effectiveness in the search for complex relations, such as higher-order patterns and nested relationships, which are critical for understanding the pathogenesis of diseases and identifying potential drug targets.</p>
</sec>
<sec id="sec29"><label>4.3</label>
<title>Drug discovery and design</title>
<p>Analyzing huge quantities of biomedical literature and data is crucial to the drug discovery and design process to identify prospective therapeutic targets, develop lead compounds, and comprehend drug-target interactions. <xref ref-type="fig" rid="fig13">Figure 13</xref> shows the procedure how Quantum Natural Language Processing (QNLP) methods, enable the extraction of knowledge from unstructured text input in a more precise and efficient manner.</p>
<fig position="float" id="fig13"><label>Figure 13</label>
<caption>
<p>QNLP drug discovery and design.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g013.tif"/>
</fig>
<sec id="sec30"><label>4.3.1</label>
<title>Virtual screening and Lead compound identification</title>
<p>The process of drug discovery means virtual screening and identification of lead compounds as the major stages. These procedures estimate the affinities and selectivity of potential drugs to the target biomolecules. In this context, studies have been conducted to enhance the accuracy and efficiency of the procedures of QNLP, alongside machine learning and quantum computing models. In this approach, QNLP tools are used to search biomedical literature for information about potential drug candidates and their structures and targets (<xref ref-type="bibr" rid="ref45">Gorgulla et al., 2022</xref>). This information is then employed and incorporated to commence quantum simulations of these drug candidates and the target biomolecules at the quantum level. QNLP can extract and incorporate useful knowledge from large volumes of text data more effectively than conventional approaches; quantum simulations allow for realistic modelling of the interaction of molecules and their properties.</p>
</sec>
<sec id="sec31"><label>4.3.2</label>
<title>Drug-target interaction prediction and analysis</title>
<p>Previous studies have revealed that QNLP methods are very useful in predicting and analyzing the drug-target interactions that are so important in the drug discovery phase. Some studies have investigated how quantum-based machine learning algorithms, using big databases of known drug&#x2013;target associations and molecular conformations, can be used to predict new interactions and the underlying processes (<xref ref-type="bibr" rid="ref43">Ginex et al., 2024</xref>). This approach shows the possibility of using QNLP in conjunction with other quantum computing methods for a comprehensive analysis of the interactions between drugs and targets for their use in drug discovery and development.</p>
<p>These techniques as a group demonstrate the usefulness of QNLP in understanding the drug discovery process. As we shall see, by utilizing properties of quantum computing that are intrinsically superior to classical computing, such as quantum parallelism and entanglement, one can hope for QNLP techniques to surpass classical models in terms of their ability to identify novel interactions and intricate patterns and structures within the data.</p>
</sec>
</sec>
<sec id="sec32"><label>4.4</label>
<title>Protein structure prediction</title>
<p>Protein Structure Prediction (PSP) is an essential sub-discipline of computational biology, which involves predicting a protein&#x2019;s tertiary structure and its secondary structures, such as helices and sheets from its amino acid sequence. Primary structure prediction mainly concerns with the local structures while the secondary structure predicts the local conformation and the tertiary structure concerns with over all three dimensional conformations. New opportunities for further PSP have opened due to the advances in quantum computing and quantum natural language processing, a process of identifying the three-dimensional conformation of the protein based on the amino acid sequence.</p>
<p>Accurate identification of PSP is essential in elucidating protein function and the mode of interaction in structural bioinformatics and for designing therapeutic strategies. Although, recent progress in computational techniques such as Alphafold and the availability of experimental structures, the protein folding problem remains challenging. This is a problem that has recently attracted the interest of the scientific community to be solved using a novel approach called Quantum Natural Language Processing (QNLP) that incorporates quantum computing. It uses quantum mechanism principles that facilitate better feature extraction and optimization of feature search space concerning sequence structure relationship.</p>
<p><xref ref-type="fig" rid="fig14">Figure 14</xref> shows the workflow for the prediction of protein structure using QNLP techniques. The process includes data pre-processing where protein sequences are retrieved from databases such as PDB and converted into quantum states and includes QNLP techniques such as quantum language models for sequence analysis, quantum kernel methods for structural similarities, model training using experimental datasets such as cryo-EM and X-ray crystallography results in predicted protein structure as the output. Despite the current limited development of QNLP for protein structure prediction, some investigations have been made to examine its advantages. These quantum models showed that by leveraging quantum phenomena such as superposition and entanglement, signal features could be represented with higher complexity and long range dependency could also be captured much better than with classical models. AlphaFold 2, a groundbreaking tool, combines evolutionary coupling with deep learning techniques to predict secondary structures alongside tertiary configurations. Predicting the tertiary structure of a protein, where the protein&#x2019;s entire three-dimensional conformation is predicted, is still a computationally expensive task (<xref ref-type="bibr" rid="ref33">Doga et al., 2024</xref>). QNLP compared to classical methods quantum embeddings can capture intricate sequence dependencies, knowledge integration where the unified representation of sequences, structure and experimental data. QNLP presents a promising avenue for enhancing protein structure prediction by enabling more efficient feature engineering, knowledge integration, and the development of quantum algorithms and simulations tailored for this challenging problem. The potential of QNLP to push the boundaries of computational protein structure prediction is evident in the growing body of literature in this field.</p>
<fig position="float" id="fig14"><label>Figure 14</label>
<caption>
<p>QNLP for protein structure prediction.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g014.tif"/>
</fig>
</sec>
<sec id="sec33"><label>4.5</label>
<title>Genomic sequence analysis</title>
<p>Sequence comparison is one of the most basic tasks in bioinformatics and comprises sequence alignment, search for conserved motifs and patterns. They are important in characterizing biological systems, diagnosing diseases, and promoting development of individualized medication. These tasks have been traditionally solved by using well-known computational tools, namely the Smith-Waterman and Needleman-Wunsch ones. However, they are usually constrained in terms of the computational costs and time required when analyzing large scale genomic data. The development of quantum computing over the past few years including Quantum Natural Language Processing (QNLP) has brought new solutions to these problems.</p>
<p><xref ref-type="fig" rid="fig15">Figure 15</xref> shows the hybrid approach combines classical NLP methods with quantum computing capabilities to potentially improve natural language processing tasks by leveraging quantum parallelism, quantum embedding spaces, or quantum algorithms for sequence alignment, a critical task in bioinformatics. It involves finding the optimal alignment between two or more biological sequences, such as DNA, RNA, or protein sequences. Homology search methods, such as Smith-Waterman and Needleman-Wunsch are based on dynamic programming of classical sequence alignment. Although they are quite efficient, their application degrades as the size of the data or the high dimensionality of the genomic data increases. Current complexity theory type item difficulties are addressable by quantum algorithms which depend on quantum superposition and entanglement.</p>
<fig position="float" id="fig15"><label>Figure 15</label>
<caption>
<p>QNLP for genomic sequence analysis.</p>
</caption>
<graphic xlink:href="fcomp-07-1464122-g015.tif"/>
</fig>
<p>Motif identification, the process of identifying recurring patterns or sequence motifs in genomic data, is another area where quantum algorithms have shown promise. Pattern recognition in genomic data is critical for identifying biological relationships and predicting disease markers. Classical methods rely heavily on statistical modeling and machine learning, but QNLP offers a transformative approach. By encoding genomic sequences into quantum states, QNLP leverages quantum embeddings and tensor-based models to capture complex relationships between data points.</p>
<p>Some of these works have been done in other genomic sequence analysis tasks that include gene prediction (<xref ref-type="bibr" rid="ref151">Sun et al., 2012</xref>), phylogenetic tree reconstruction (<xref ref-type="bibr" rid="ref3">Abdellah et al., 2023</xref>) and genome assembly (<xref ref-type="bibr" rid="ref73">K&#x00F6;soglu-Kind et al., 2023</xref>). Quantum simulation techniques are also being used for the study of gene interactions and for determining the impact of mutations at scales that have not been previously possible. These innovations illustrate how QNLP can be used to confront issues in genomic analysis, including multi-dimensional integration and noise immunity. The potential of QNLP in genomic sequence analysis is in the inherent optimization of the tools with high-throughput sequencing and other applications. More development in the QNLP field and in the next-generation quantum hardware, as well as in quantum algorithms, is essential to achieve the full potential of QNLP for genomics.</p>
<p>The discussed applications of QNLP in bioinformatics strengthen the efficiency in handling complex biological data using quantum approaches. The next section provides the case studies and how QNLP methodologies have been applied to solve complex challenges in bioinformatics, such as drug discovery, protein structure prediction, and genomic sequence analysis.</p>
</sec>
</sec>
<sec id="sec34"><label>5</label>
<title>Case studies and real-world applications</title>
<sec id="sec35"><label>5.1</label>
<title>Biomedical literature mining</title>
<p>The biomedical field produces a large amount of articles every year, and therefore, it is difficult to find necessary information quickly. Prior NLP techniques are unable to process the biomedical text well because it is unstructured and the relationships between the terms are complex. This case study is concerned with the application of Quantum Natural Language Processing (QNLP) in biomedical text mining especially for named entity recognition (NER) and relation extraction. Another remarkable work has been done by <xref ref-type="bibr" rid="ref78">Leurs (2022)</xref>, which described how QLM can be used for mining biomedical literature. By employing quantum parallelism and entanglement, the authors employed a big number of biomedical articles to train a quantum language model. This model was then used to perform complex text processing tasks such as event extraction, named entity recognition and relation extraction. In the speed and accuracy of their approach to identify relevant information concerning new targets for therapy, existing drugs, and their interactions, the authors noted that the performance of their method outcompeted traditional approaches to NLP. <xref ref-type="bibr" rid="ref145">Soame (2023)</xref> proposed an extension of the aforementioned works, which is a hybrid quantum-classical model for Knowledge Extraction and Biomedical literature mining. Thus, they were able to incorporate informative been using a combination of classical machine learning models and QNLP techniques from domain knowledge bases, experimental data, and scholarly literature. The following table summarizes the performance and applications of quantum approaches in these domains, showcasing the enhancements over classical methods.</p>
<p>In <xref ref-type="table" rid="tab4">Table 2</xref>, quantum approaches show a general improvement in performance over literature mining and knowledge extraction problems in comparison to classical approaches. Quantum Language Models (QLMs) and embeddings improve the performance of sentiment analysis and the identification of semantic relations and Quantum Graph Neural Networks (QGNNs) help identify high-order patterns for knowledge graphs. The hybrid quantum-classical framework continues the integration process by adopting quantum optimization for knowledge extraction tasks. These results further emphasize that quantum computing offers an increasing role in revamping the traditional NLP process.</p>
<table-wrap position="float" id="tab4"><label>Table 2</label>
<caption>
<p>QNLP in biomedical literature mining.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Domain</th>
<th align="left" valign="top">Quantum Approach</th>
<th align="left" valign="top">Dataset</th>
<th align="left" valign="top">Metrics</th>
<th align="center" valign="top">Performance</th>
<th align="left" valign="top">QNLP Task</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">Literature Mining (<xref ref-type="bibr" rid="ref78">Leurs, 2022</xref>)</td>
<td align="left" valign="top">Quantum Language Model (QLM)</td>
<td align="left" valign="top">Stanford Sentiment Treebank</td>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">0.82</td>
<td align="left" valign="top">Sentiment Analysis</td>
</tr>
<tr>
<td align="left" valign="top">Literature Mining (<xref ref-type="bibr" rid="ref145">Soame, 2023</xref>)</td>
<td align="left" valign="top">Quantum Embedding</td>
<td align="left" valign="top">Integration Dataset</td>
<td align="left" valign="top">Semantic Similarity</td>
<td align="center" valign="top">0.74</td>
<td align="left" valign="top">Capture Multidimensional Relationship</td>
</tr>
<tr>
<td align="left" valign="top">Literature Mining (<xref ref-type="bibr" rid="ref39">Ganguly et al., 2024</xref>)</td>
<td align="left" valign="top">Quantum Embeddings + QLM</td>
<td align="left" valign="top">Swiss-Prot</td>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">0.72</td>
<td align="left" valign="top">Relationship Extraction</td>
</tr>
<tr>
<td align="left" valign="top">Knowledge Extraction (<xref ref-type="bibr" rid="ref159">Varmantchaonala et al., 2024</xref>)</td>
<td align="left" valign="top">Quantum Graph Neural Networks</td>
<td align="left" valign="top">PubMed</td>
<td align="left" valign="top">Recall, F1 Score</td>
<td align="center" valign="top">0.75 / 0.68</td>
<td align="left" valign="top">High-Order Pattern Detection</td>
</tr>
<tr>
<td align="left" valign="top">Knowledge Extraction (<xref ref-type="bibr" rid="ref29">De Angelis et al., 2023</xref>)</td>
<td align="left" valign="top">Hybrid Quantum Classical Framework</td>
<td align="left" valign="top">Clinical Trials</td>
<td align="left" valign="top">Accuracy, F1 Score</td>
<td align="center" valign="top">0.79</td>
<td align="left" valign="top">Knowledge Extraction from Text Corpus</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="sec36"><label>5.2</label>
<title>Quantum drug discovery</title>
<p>Drug development is one of the most significant real-world uses of QNLP in bioinformatics. Biogen and IonQ, a leading provider of quantum computing, partnered in 2021 to find prospective therapeutic targets and analyze biological data (<xref ref-type="bibr" rid="ref61">IonQ, 2021</xref>). The alliance endeavors to speed the drug development process by utilizing the computing prowess of quantum computers, however, the precise particulars of their strategy remain undisclosed. Additionally, the biotechnology business Resilience has been actively investigating drug development solutions based on quantum computing. In a recent case study, they illustrated the utilization of quantum techniques, such as Grover&#x2019;s algorithm and quantum annealing, for virtual screening and lead optimization (<xref ref-type="bibr" rid="ref9001">Salloum et al., 2024</xref>).</p>
<sec id="sec37"><label>5.2.1</label>
<title>Quantum virtual screening and lead compound identification</title>
<p>Quantum machine learning models and quantum simulations have been shown in several recent works to be capable of predicting binding affinities and interactions between potential drugs and a target biomolecule, often a protein or nucleic acid. Mensa et al. presented a quantum machine learning model for virtual screening that utilized quantum features of the problem to incorporate quantum-mechanical effects inherent in molecular interactions (<xref ref-type="bibr" rid="ref93">Mensa et al., 2022</xref>). Their approach demonstrated enhanced precision in the prediction of binding affinities from the traditional computational techniques. Arguing the same idea, <xref ref-type="bibr" rid="ref95">Mohammed et al. (2017)</xref> have established a hybrid quantum mechanical/molecular mechanics model of virtual screening and identification of lead compounds. To this end, their model used both quantum simulations and machine learning algorithms to predict the binding affinities and interactions of the potential drugs with the target biomolecules. The authors showed that due to the application of quantum effects, the precision of predictions made with the help of the proposed model exceeded classical approaches, which indicates the applicability of quantum computing in this field. Thus, it has been suggested that for virtual screening and identification of lead compounds, it is possible to use hybrid quantum&#x2013;classical methods based on the advantages of QNLP and quantum simulations. <xref ref-type="bibr" rid="ref155">Ting and Caflisch (2010)</xref> described a pipeline that combines QNLP for mining chemical/biological information from text sources with quantum calculations for estimating the interactions of potential drugs with target biomolecules.</p>
</sec>
<sec id="sec38"><label>5.2.2</label>
<title>Drug-target interaction prediction and analysis</title>
<p>In a study by <xref ref-type="bibr" rid="ref137">Sathan and Baichoo (2024)</xref> the authors proposed a quantum machine learning model for drug-target interaction prediction, demonstrating its potential to outperform classical models. Their approach involved training a quantum neural network on a large dataset of known drug-target interactions and molecular structures, leveraging the unique capabilities of quantum computing to capture the complex patterns and relationships within the data. Similarly, <xref ref-type="bibr" rid="ref160">Veleiro et al. (2023)</xref> Combined Transformer and Graph Neural Networks, these architectures, models capture both global and local structural information of drugs and sequence features of targets, improving precision and recall in DTI predictions (<xref ref-type="bibr" rid="ref69">Khurana et al., 2023</xref>).</p>
<p>A notable study by <xref ref-type="bibr" rid="ref95">Mohammed et al. (2017)</xref> further highlighted the potential of quantum machine learning models in this domain. The authors trained a hybrid quantum-classical neural network on a large dataset of drug-target interactions and molecular structures, demonstrating its ability to outperform state-of-the-art classical models in predicting novel interactions. Their work also explored the interpretability of the quantum model, providing insights into the underlying mechanisms of drug-target interactions. <xref ref-type="bibr" rid="ref171">Xiong et al. (2023)</xref> proposed a framework called &#x201C;Q-Drug&#x201D; that aims to bring drug design into the quantum space using deep learning techniques. This framework incorporates QNLP for literature mining, quantum simulations for modeling molecular interactions, and quantum graph neural networks for predicting drug-target interactions. The integration of these components aims to provide a comprehensive and efficient computational framework for drug discovery and design. Similarly, a recent study by <xref ref-type="bibr" rid="ref137">Sathan and Baichoo (2024)</xref> proposed a quantum graph neural network for drug-target interaction prediction, which utilizes QNLP for extracting relevant information from biomedical literature and integrates it with protein structure data and quantum simulations of molecular interactions. The <xref ref-type="table" rid="tab5">Table 3</xref> below provides details of quantum approaches applied to various drug discovery tasks, highlighting their datasets, performance metrics, and specific QNLP tasks.</p>
<table-wrap position="float" id="tab5"><label>Table 3</label>
<caption>
<p>QNLP in drug discovery.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Domain</th>
<th align="left" valign="top">Quantum Approach</th>
<th align="left" valign="top">Dataset</th>
<th align="center" valign="top">Performance</th>
<th align="left" valign="top">Metrics Used</th>
<th align="left" valign="top">QNLP task</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">Virtual Screening and Lead Compound Identification (<xref ref-type="bibr" rid="ref93">Mensa et al., 2022</xref>)</td>
<td align="left" valign="top">Quantum Machine Learning Model</td>
<td align="left" valign="top">ADME-Tox</td>
<td align="center" valign="top">0.84</td>
<td align="left" valign="top">Accuracy,</td>
<td align="left" valign="top">Predictive Screening</td>
</tr>
<tr>
<td align="left" valign="top">Drug-Target Interaction Prediction (<xref ref-type="bibr" rid="ref95">Mohammed et al., 2017</xref>)</td>
<td align="left" valign="top">Hybrid Quantum-Classical Neural Network</td>
<td align="left" valign="top">ChEMBL</td>
<td align="center" valign="top">0.81</td>
<td align="left" valign="top">Precision, Recall</td>
<td align="left" valign="top">Map drug target relation</td>
</tr>
<tr>
<td align="left" valign="top">Drug Discovery Framework (<xref ref-type="bibr" rid="ref17">Cao et al., 2019</xref>)</td>
<td align="left" valign="top">Integrated Quantum Computing Approach</td>
<td align="left" valign="top">-</td>
<td align="center" valign="top">3.2</td>
<td align="left" valign="top">Computational Efficiency</td>
<td align="left" valign="top">Comprehensive Modeling</td>
</tr>
<tr>
<td align="left" valign="top">Drug-Target Interaction Prediction (<xref ref-type="bibr" rid="ref80">Li et al., 2022</xref>)</td>
<td align="left" valign="top">Quantum Transformer Model</td>
<td align="left" valign="top">BindingDB</td>
<td align="center" valign="top">0.88</td>
<td align="left" valign="top">Accuracy</td>
<td align="left" valign="top">Extract drug binding relationship</td>
</tr>
<tr>
<td align="left" valign="top">Literature-Based Drug Repurposing (<xref ref-type="bibr" rid="ref143">Shuyue et al., 2023</xref>)</td>
<td align="left" valign="top">Quantum Language Model</td>
<td align="left" valign="top">PubMed</td>
<td align="center" valign="top">0.62</td>
<td align="left" valign="top">Semantic Similarity</td>
<td align="left" valign="top">Semantic Analysis</td>
</tr>
<tr>
<td align="left" valign="top">Virtual Screening and Lead Optimization (<xref ref-type="bibr" rid="ref97">Na&#x0142;&#x0119;cz-Charkiewicz et al., 2024</xref>)</td>
<td align="left" valign="top">Quantum Generative Adversarial Network</td>
<td align="left" valign="top">ZINC Database</td>
<td align="center" valign="top">0.67</td>
<td align="left" valign="top">MSE</td>
<td align="left" valign="top">Identify new lead compounds</td>
</tr>
<tr>
<td align="left" valign="top">Drug-Target Binding Site Prediction (<xref ref-type="bibr" rid="ref88">Madsen et al., 2023</xref>)</td>
<td align="left" valign="top">Quantum Approximate Optimization Algorithm</td>
<td align="left" valign="top">PDB</td>
<td align="center" valign="top">0.81</td>
<td align="left" valign="top">Accuracy</td>
<td align="left" valign="top">Structural Analysis</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The <xref ref-type="table" rid="tab5">Table 3</xref> presents different QNLP approaches, including quantum language models, quantum machine learning models (e.g., quantum neural networks, quantum transformers, quantum graph neural networks), quantum kernel methods, quantum generative adversarial networks, and quantum attention models. Various computational models in these tasks showcase their comparative analysis over classical NLP and QNLP methods. The research emphasized the capability of QNLP methods to efficiently investigate the extensive chemical space and detect prospective medication candidates. Nevertheless, these practical implementations also unveiled many obstacles. Prominent challenges that need to be addressed include the encoding and representation of data, the optimization of algorithms, and the restricted scalability of existing quantum technology (<xref ref-type="bibr" rid="ref138">Selig et al., 2021</xref>). Furthermore, the implementation of QNLP methodologies in conjunction with pre-existing drug discovery pipelines and the analysis of quantum-derived outcomes presented pragmatic obstacles.</p>
</sec>
</sec>
<sec id="sec39"><label>5.3</label>
<title>Protein structure prediction (PSP)</title>
<p>More recently, a work from researchers (<xref ref-type="bibr" rid="ref21">Cherrat et al., 2024</xref>) proposed the Harvey et al., present complex-valued tensor network models where PT employs parameterised quantum circuits, thereby employing Hilbert space as the feature space for the sequence processing task. The models are connected to archive data in a tree like structure maximizing data correlation and compositional structure enhancing interpretability and the permanence of resource compression. The experimental results have established the use of the models in binary classification tasks using realistic datasets, proving the long-range correlation the models can tackle. This work can be considered as a major advancement in utilizing quantum machine learning for protein structure predictions that could further improve human health and welfare.</p>
<p>In a recent study, <xref ref-type="bibr" rid="ref34">Drori et al. (2019)</xref> have investigated the possibility of using QNLP for secondary structure predictability classical methods like PSIPRED and SPIDER3, make use of the machine learning algorithms, such as the quantum embeddings and the quantum neural networks to model the sequence-structure map for proteins. Compared with the classical models, these quantum models showed that the utilization of quantum phenomena superposition and entanglement yielded better feature representation and long-range dependency capture (<xref ref-type="bibr" rid="ref14">Boulebnane et al., 2022</xref>). In quantum computing, there are promising models known as Quantum Circuit Learning (QCL). <xref ref-type="bibr" rid="ref53">Hatakeyama-Sato et al. (2022)</xref> has put forward a QCL model for protein sequences in which quantum embedding is used to improve the accuracy of the model by including secondary structure information in the quantum representation. Likewise, the quantum kernel methods like Quantum Kernel Support Vector Machines (QK-SVM) have shown better classification efficiency in identifying the secondary structures elements. Quantum computing takes it a step further Quantum computing takes it a step further. In this area, AlphaFold 2 has come a long way and gets to the experimental accuracy of many proteins using spatial graph networks. For example, in the work by <xref ref-type="bibr" rid="ref164">Webber et al. (2022)</xref>, the authors wanted to know if the quantum annealing technique can allow for the effective sampling of the conformational space of protein folding, which is a problem for standard molecular dynamics simulations. <xref ref-type="bibr" rid="ref37">Edward et al. (2024)</xref> used quantum circuits to simulate the Protein folding dynamics to show the ability of quantum computers in processing larger and complex protein structures with better precision. Later suggested that QNLP should be combined with quantum annealing to probe the conformational landscape of the protein folding phenomenon. Through their work, they were able to show that folding dynamics could be approximated with better energy efficiency than those of classical molecular dynamics simulation. A recently published paper by <xref ref-type="bibr" rid="ref52">Harvey et al. (2023)</xref> pointed out that the existing quantum hardware have several problems, such as noise, qubit error, and scalability, which would affect the application of quantum algorithms and simulations to large-scale protein structure prediction.</p>
<p><xref ref-type="table" rid="tab6">Table 4</xref> specifically focuses on protein-related tasks, that detail advancements in protein structure prediction, folding, or interaction analysis and also requiring further innovations and hybrid approaches. This integrated representation can potentially capture complex patterns and relationships that are difficult to extract using classical methods, leading to improved structure prediction accuracy.</p>
<table-wrap position="float" id="tab6"><label>Table 4</label>
<caption>
<p>QNLP in protein analysis.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Domain</th>
<th align="left" valign="top">Quantum Approach</th>
<th align="left" valign="top">Dataset</th>
<th align="left" valign="top">Metrics</th>
<th align="center" valign="top">Performance</th>
<th align="left" valign="top">QNP Task</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">PSP (<xref ref-type="bibr" rid="ref34">Drori et al., 2019</xref>)</td>
<td align="left" valign="top">Quantum Embeddings and Quantum Neural Networks</td>
<td align="left" valign="top">PDB</td>
<td align="left" valign="top">RMSD</td>
<td align="center" valign="top">4.2&#x202F;&#x00C5;, 0.65</td>
<td align="left" valign="top">Quantum Embedding</td>
</tr>
<tr>
<td align="left" valign="top">Protein-Ligand Binding (<xref ref-type="bibr" rid="ref18">Chandarana et al., 2023</xref>)</td>
<td align="left" valign="top">Quantum Chemistry Simulations</td>
<td align="left" valign="top">BindingDB</td>
<td align="left" valign="top">Binding Affinity</td>
<td align="center" valign="top">&#x2212;7.2&#x202F;kcal/mol</td>
<td align="left" valign="top">Probabilistic Modeling</td>
</tr>
<tr>
<td align="left" valign="top">Protein Sequence-Structure Relationships (<xref ref-type="bibr" rid="ref10">Bhuvaneswari et al., 2023</xref>)</td>
<td align="left" valign="top">Quantum Associative Memory</td>
<td align="left" valign="top">UniProt</td>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">0.82, 0.75</td>
<td align="left" valign="top">Sequence-Structure Mapping</td>
</tr>
<tr>
<td align="left" valign="top">Protein Contact Map Prediction (<xref ref-type="bibr" rid="ref19">Chapman et al., 2017</xref>)</td>
<td align="left" valign="top">Quantum Circuit Born Machine</td>
<td align="left" valign="top">SCOP</td>
<td align="left" valign="top">Precision, Recall, F1</td>
<td align="center" valign="top">0.61, 0.58, 0.59</td>
<td align="left" valign="top">Probabilistic Modeling</td>
</tr>
<tr>
<td align="left" valign="top">Protein Secondary Structure Prediction (<xref ref-type="bibr" rid="ref58">Hong et al., 2021</xref>)</td>
<td align="left" valign="top">Quantum Convolutional Neural Networks</td>
<td align="left" valign="top">DSSP</td>
<td align="left" valign="top">Q3 Accuracy</td>
<td align="center" valign="top">0.78</td>
<td align="left" valign="top">Pattern Analysis</td>
</tr>
<tr>
<td align="left" valign="top">Protein Folding Energy Landscapes (<xref ref-type="bibr" rid="ref115">Perdomo-Ortiz et al., 2012</xref>)</td>
<td align="left" valign="top">Quantum Annealing</td>
<td align="left" valign="top">Rosetta Database</td>
<td align="left" valign="top">Energy Minimization</td>
<td align="center" valign="top">&#x2212;20.1&#x202F;kcal/mol</td>
<td align="left" valign="top">Energy Landscape Exploration</td>
</tr>
<tr>
<td align="left" valign="top">Protein Interaction Networks (<xref ref-type="bibr" rid="ref169">Wong and Chang, 2021</xref>)</td>
<td align="left" valign="top">Quantum Graph Neural Networks</td>
<td align="left" valign="top">STRING Database</td>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">0.84</td>
<td align="left" valign="top">Network Mapping</td>
</tr>
<tr>
<td align="left" valign="top">Protein Structure Scoring (<xref ref-type="bibr" rid="ref114">Pecina et al., 2020</xref>)</td>
<td align="left" valign="top">Quantum Kernel Methods</td>
<td align="left" valign="top">AlphaFold Database</td>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">0.89</td>
<td align="left" valign="top">Structural Scoring Techniques</td>
</tr>
<tr>
<td align="left" valign="top">Protein Structure Alignment (<xref ref-type="bibr" rid="ref146">Soni and Rasool, 2021</xref>)</td>
<td align="left" valign="top">Quantum Pattern Matching Algorithms</td>
<td align="left" valign="top">RCSB PDB</td>
<td align="left" valign="top">Accuracy</td>
<td align="center" valign="top">0.82</td>
<td align="left" valign="top">Pattern Matching</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="sec40"><label>5.4</label>
<title>Genomic data analysis)</title>
<p>This research has shown that QNLP has a lot of promise for the analysis of genetic information. A few researchers from the University of Chicago have recently studied the possibility of using QAM to search and process genetic sequences (<xref ref-type="bibr" rid="ref162">Wang et al., 2024</xref>). In their case study, the researchers came up with a QRAM framework that proved most effective in storing and accessing genetic data. In large scale genomic databases, the QRAM enabled fast search and pattern matching through conversion of genomic sequences into quantum states, thus outperforming other methods. While the QRAM was found to show promising results in controlled trials, the creators of the method encountered difficulties in trying to extend the method to handle the massive amounts of real genetic data that the world produces. In order to make the solutions practically usable, certain critical challenges need to be addressed including data encoding, the number of qubits needed and error mitigation (<xref ref-type="bibr" rid="ref49">Guarasci et al., 2022</xref>).</p>
<p>One of the study, <xref ref-type="bibr" rid="ref28">Daskin et al. (2014)</xref> applied Grover&#x2019;s algorithm to sequence alignment, where quadratic time savings compared with the classical procedures are needed. Similarly, <xref ref-type="bibr" rid="ref68">Khan et al. (2023)</xref> proposed a quantum algorithm for the pairwise sequence alignment of biological macromolecules and showed that the performance of the quantum algorithm is much higher than that of Smith-Waterman algorithm.</p>
<p>There are other domains as well, where quantum algorithms are useful are Motif identification is the process of finding sequence motifs that appear in genomic data. <xref ref-type="bibr" rid="ref44">Go, First, Plans (2023)</xref> envisaged a quantum algorithm for motif identification that is superior to classical algorithms for certain circumstances. <xref ref-type="bibr" rid="ref136">Sarkar et al. (2019)</xref> followed this up by providing a quantum algorithm for approximate motif discovery in DNA sequences, which can explore a solution space exponentially larger in polynomial time thanks to quantum parallelism. All of these show significant possibilities for thinking about regulatory components in DNA and RNA sequences. The <xref ref-type="table" rid="tab7">Table 5</xref> below provide key details, highlighting datasets, performance metrics,and specific QNLP tasks.</p>
<table-wrap position="float" id="tab7"><label>Table 5</label>
<caption>
<p>QNLP in genome analysis.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Doamin</th>
<th align="left" valign="top">Quantum algorithm</th>
<th align="left" valign="top">Dataset</th>
<th align="left" valign="top">Metrics</th>
<th align="center" valign="top">Performance</th>
<th align="left" valign="top">QNLP</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle">Motif Identification (<xref ref-type="bibr" rid="ref136">Sarkar et al., 2019</xref>)</td>
<td align="left" valign="middle">Quantum Associative Memory</td>
<td align="left" valign="middle">NCBI GenBank</td>
<td align="left" valign="top">Accuracy, F1 score</td>
<td align="center" valign="middle">0.78, 0.82</td>
<td align="left" valign="middle">Pattern Matching</td>
</tr>
<tr>
<td align="left" valign="middle">Pattern Recognition<break/>(<xref ref-type="bibr" rid="ref122">Prousalis and Konofaos, 2019</xref>)</td>
<td align="left" valign="middle">Quantum Convolutional Neural Network</td>
<td align="left" valign="middle">Multi-omics DataGEO (Gene Expression Omnibus)</td>
<td align="left" valign="top">Accuracy, AUC</td>
<td align="center" valign="middle">0.85, 0.81</td>
<td align="left" valign="middle">Feature Extraction</td>
</tr>
<tr>
<td align="left" valign="middle">Pairwise Sequence Alignment (<xref ref-type="bibr" rid="ref68">Khan et al., 2023</xref>)</td>
<td align="left" valign="middle">Quantum Approximate Optimization Algorithm</td>
<td align="left" valign="middle">UniProt</td>
<td align="left" valign="top">Alignment score</td>
<td align="center" valign="middle">0.72</td>
<td align="left" valign="middle">Kernel Optimization</td>
</tr>
<tr>
<td align="left" valign="middle">Approximate Motif Finding (<xref ref-type="bibr" rid="ref135">Sarkar, 2018</xref>)</td>
<td align="left" valign="middle">Quantum Counting Algorithm</td>
<td align="left" valign="middle">Ensembl Biomart</td>
<td align="left" valign="top">Hamming distance</td>
<td align="center" valign="middle">0.65</td>
<td align="left" valign="middle">Probabilistic Search</td>
</tr>
<tr>
<td align="left" valign="middle">Gene Prediction (<xref ref-type="bibr" rid="ref122">Prousalis and Konofaos, 2019</xref>)</td>
<td align="left" valign="middle">Quantum Support Vector Machine</td>
<td align="left" valign="middle">Genomic Annotations</td>
<td align="left" valign="top">Accuracy, F1 score</td>
<td align="center" valign="middle">0.79, 0.81</td>
<td align="left" valign="middle">Classification</td>
</tr>
<tr>
<td align="left" valign="middle">Genome Assembly (<xref ref-type="bibr" rid="ref151">Sun et al., 2012</xref>)</td>
<td align="left" valign="middle">Quantum Annealing</td>
<td align="left" valign="middle">NCBI Sequence Read Archive (SRA)</td>
<td align="left" valign="top">Accuracy, F1 score</td>
<td align="center" valign="middle">0.68</td>
<td align="left" valign="middle">Combinatorial Optimization</td>
</tr>
<tr>
<td align="left" valign="middle">Sequence Clustering (<xref ref-type="bibr" rid="ref73">K&#x00F6;soglu-Kind et al., 2023</xref>)</td>
<td align="left" valign="middle">Quantum K-means</td>
<td align="left" valign="middle">FASTA</td>
<td align="left" valign="top">Silhouette Score</td>
<td align="center" valign="middle">0.76</td>
<td align="left" valign="middle">Classification</td>
</tr>
<tr>
<td align="left" valign="middle">Protein Structure Prediction (<xref ref-type="bibr" rid="ref164">Webber et al., 2022</xref>)</td>
<td align="left" valign="middle">Quantum Boltzmann Machine</td>
<td align="left" valign="middle">PDB</td>
<td align="left" valign="top">RMSD, TM-score</td>
<td align="center" valign="middle">0.71, 0.62</td>
<td align="left" valign="middle">Energy Minimization</td>
</tr>
<tr>
<td align="left" valign="middle">Promoter Identification (<xref ref-type="bibr" rid="ref30">de Paula Neto et al., 2019</xref>)</td>
<td align="left" valign="middle">Quantum Associative Memory</td>
<td align="left" valign="middle">JASPER</td>
<td align="left" valign="top">Accuracy, F1 score</td>
<td align="center" valign="middle">0.79, 0.81</td>
<td align="left" valign="middle">Pattern Recognition</td>
</tr>
<tr>
<td align="left" valign="middle">Splice Site Detection (<xref ref-type="bibr" rid="ref161">Vincentius et al., 2019</xref>)</td>
<td align="left" valign="middle">Quantum Support Vector Machine</td>
<td align="left" valign="middle">SpliceAid</td>
<td align="left" valign="top">Accuracy, F1 score</td>
<td align="center" valign="middle">0.82, 0.84</td>
<td align="left" valign="middle">Classification</td>
</tr>
<tr>
<td align="left" valign="middle">Transcription Factor Binding Site Prediction(<xref ref-type="bibr" rid="ref79">Li et al., 2018</xref>)</td>
<td align="left" valign="middle">Quantum Associative Memory</td>
<td align="left" valign="middle">JASPAR</td>
<td align="left" valign="top">Accuracy, F1 score</td>
<td align="center" valign="middle">0.77, 0.79</td>
<td align="left" valign="middle">Probabilistic Mapping</td>
</tr>
<tr>
<td align="left" valign="middle">Genome-Wide Association Studies (<xref ref-type="bibr" rid="ref67">Karetla et al., 2023</xref>)</td>
<td align="left" valign="middle">Quantum Annealing</td>
<td align="left" valign="middle">Genome Aggregation Database</td>
<td align="left" valign="top">AUC</td>
<td align="center" valign="middle">0.81</td>
<td align="left" valign="middle">Sequence mapping</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Data pattern recognition is especially essential in determining the existing or expected biological association and disease predictors in genomic data. While classical methods are statistical modeling and machine learning, QNLP brings a revolutionizing perspective. QNLP uses quantum embeddings and tensor based models to represent genomic sequences in terms of quantum states and to analyze relationships between the data points. <xref ref-type="bibr" rid="ref135">Sarkar (2018)</xref> used quantum machine learning models for pattern recognition, and showed that these models perform better in terms of scalability and computational complexity. More development in the QNLP field and in the next-generation quantum hardware, as well as in quantum algorithms, is essential to achieve the full potential of QNLP for genomics. In light of the classical computational methods for genomic sequence analysis, the application of QNLP techniques presents an opportunity to tackle the limitations of these classical approaches, particularly in terms of computational complexity and scalability. <xref ref-type="supplementary-material" rid="SM1">Supplementary Figure 1</xref> presents a comparison between classical NLP and QNLP for various applications where the X-axis represents the different NLP tasks and the y-axis represents performance metric scores ranging from 0 to 1.</p>
<p>For each task, it has two bars blue represents the performance score of classical NLP and orange represents the performance score of QNLP methods. As quantum models have given improvement in several bioinformatics domains such as drug discovery, protein folding, and genomic sequence analysis.</p>
<p>The following <xref ref-type="table" rid="tab8">Table 6</xref> synthesizes the main strengths and weaknesses of the main quantum approaches, as well as their applicability to certain tasks.</p>
<table-wrap position="float" id="tab8"><label>Table 6</label>
<caption>
<p>Comparative analysis of quantum approaches.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Quantum Model</th>
<th align="left" valign="top">Application</th>
<th align="left" valign="top">Merit</th>
<th align="left" valign="top">Demerit</th>
<th align="left" valign="top">References</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle" rowspan="3">Quantum Language Models (QLMs)</td>
<td align="left" valign="middle">Drug Discovery</td>
<td align="left" valign="middle">Handle corpus data like PubMed.</td>
<td align="left" valign="middle">Noisy quantum gates</td>
<td align="left" valign="middle"><xref ref-type="bibr" rid="ref45">Gorgulla et al. (2022)</xref>; <xref ref-type="bibr" rid="ref43">Ginex et al. (2024)</xref>; <xref ref-type="bibr" rid="ref93">Mensa et al. (2022)</xref></td>
</tr>
<tr>
<td align="left" valign="middle">Literature Mining</td>
<td align="left" valign="middle">Relation Extraction, Knowledge graph</td>
<td align="left" valign="middle">Scalability for large data</td>
<td align="left" valign="middle"><xref ref-type="bibr" rid="ref97">Na&#x0142;&#x0119;cz-Charkiewicz et al. (2024)</xref>; <xref ref-type="bibr" rid="ref78">Leurs (2022)</xref>; <xref ref-type="bibr" rid="ref172">Yan et al. (2021)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Gene Regulatory Networks</td>
<td align="left" valign="top">Accurate Gene interactions as language-like structures.</td>
<td align="left" valign="top">Interpretation</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref3">Abdellah et al. (2023)</xref>; <xref ref-type="bibr" rid="ref160">Veleiro et al. (2023)</xref></td>
</tr>
<tr>
<td align="left" valign="top" rowspan="3">Quantum Embedding Models (QEMs)</td>
<td align="left" valign="top">Drug Discovery</td>
<td align="left" valign="top">Maps molecules into quantum spaces.</td>
<td align="left" valign="top">Encoding into quantum states</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref104">Ng et al. (2023)</xref>; <xref ref-type="bibr" rid="ref88">Madsen et al. (2023)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Protein Folding</td>
<td align="left" valign="top">Encodes protein structures in quantum states.</td>
<td align="left" valign="top">Scalability</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref23">Cincio et al. (2020)</xref>; <xref ref-type="bibr" rid="ref37">Edward et al. (2024)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Genomic Sequence Analysis</td>
<td align="left" valign="top">Represents high-dimensional genomic features compactly.</td>
<td align="left" valign="top">Qubit limitation</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref135">Sarkar (2018)</xref>; <xref ref-type="bibr" rid="ref3">Abdellah et al. (2023)</xref></td>
</tr>
<tr>
<td align="left" valign="top" rowspan="4">Quantum Kernel Methods (QKMs)</td>
<td align="left" valign="top">Drug Discovery</td>
<td align="left" valign="top">Enhanced feature space</td>
<td align="left" valign="top">Scalability</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref104">Ng et al. (2023)</xref>; <xref ref-type="bibr" rid="ref95">Mohammed et al. (2017)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Protein Folding</td>
<td align="left" valign="top">Improved Prediction</td>
<td align="left" valign="top">Noise in qubits</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref94">Miranda et al. (2022)</xref>; <xref ref-type="bibr" rid="ref17">Cao et al. (2019)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Genomic Sequence Analysis</td>
<td align="left" valign="top">Accelerates alignment of genomic sequences.</td>
<td align="left" valign="top">Encoding large data</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref42">Ghosh et al. (2024)</xref>; <xref ref-type="bibr" rid="ref151">Sun et al. (2012)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Literature Mining</td>
<td align="left" valign="top">Improves clustering and semantic similarity in biomedical texts.</td>
<td align="left" valign="top">High computational cost.</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref78">Leurs (2022)</xref>; <xref ref-type="bibr" rid="ref145">Soame (2023)</xref>; <xref ref-type="bibr" rid="ref17">Cao et al. (2019)</xref></td>
</tr>
<tr>
<td align="left" valign="top" rowspan="3">Quantum Hybrid Models</td>
<td align="left" valign="top">Drug Discovery</td>
<td align="left" valign="top">Improved acceleration</td>
<td align="left" valign="top">Optimization techniques needed.</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref93">Mensa et al. (2022)</xref>; <xref ref-type="bibr" rid="ref95">Mohammed et al. (2017)</xref>; <xref ref-type="bibr" rid="ref160">Veleiro et al. (2023)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Protein Folding</td>
<td align="left" valign="top">Feature extraction.</td>
<td align="left" valign="top">Hardware compatibility</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref88">Madsen et al. (2023)</xref>; <xref ref-type="bibr" rid="ref37">Edward et al. (2024)</xref></td>
</tr>
<tr>
<td align="left" valign="top">Gene Regulatory Networks</td>
<td align="left" valign="top">Optimizes regulatory network inference using quantum methods.</td>
<td align="left" valign="top">Limited hybrid models</td>
<td align="left" valign="top"><xref ref-type="bibr" rid="ref3">Abdellah et al. (2023)</xref>; <xref ref-type="bibr" rid="ref98">Nam and Nguyen. (2024)</xref></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Despite the fact that QNLP has been identified as a relatively young subfield of bioinformatics, several research institutes and companies have started exploring its potential applications and realistic use cases. Such activities provide a vast amount of understanding about the potential and the limitations of the QNLP approaches as well as the challenges that surround their implementation and deployment.</p>
<p>The use of QNLP in bioinformatics and its application in <xref ref-type="table" rid="tab8">Table 6</xref> provide an understanding of the prospects and challenges in the field. Among the most important lessons acquired are:</p>
<list list-type="alpha-lower">
<list-item><p>The two constraints of encoding and representation of data are critical in determining the potential of quantum computing in handling of large data particularly in biological systems.</p></list-item>
<list-item><p>Algorithm optimization and efficient mapping on quantum processors both constitute core aspects of realizing quantifiable improvements compared to classical approaches.</p></list-item>
<list-item><p>Shortly, it might be crucial to utilize hybrid quantum-classical approaches to overcome the limitations of current quantum hardware and exploit the unique benefits of quantum computing and classical computing, respectively.</p></list-item>
<list-item><p>The collaboration of hardware engineers, domain specialists, and quantum algorithm researchers is of the utmost importance in the development of effective and functional QNLP solutions for the field of bioinformatics.</p></list-item>
<list-item><p>Interpretability and integration with current bioinformatics workflows are crucial considerations when putting QNLP techniques into practice.</p></list-item>
</list>
<p>With the continuous advancement of quantum computing technology and the accessibility of more potent quantum hardware, it is anticipated that the potential of QNLP in the field of bioinformatics will expand. To unlock the full potential of this growing industry, however, it will be crucial to address the obstacles mentioned in these studies.</p>
<p>The Case studies and applications of QNLP in bioinformatics highlight its transformative potential, but they also reveal key challenges, particularly with quantum hardware and algorithm scalability, which are explored in the following section on hardware limitations and future directions.</p>
</sec>
</sec>
<sec id="sec41"><label>6</label>
<title>Challenges and limitations</title>
<sec id="sec42"><label>6.1</label>
<title>Quantum hardware constraints</title>
<p><italic>Noise and Qubit Decoherence:</italic> The practical implementation of QNLP algorithms in bioinformatics is currently constrained by the limitations of existing quantum hardware. One of the major challenges is the presence of noise and qubit errors, which can significantly impact the reliability and accuracy of quantum computations (<xref ref-type="bibr" rid="ref121">Preskill, 2018</xref>; <xref ref-type="bibr" rid="ref25">Daimon and Matsushita, 2024</xref>). Quantum systems are highly susceptible to environmental disturbances, such as electromagnetic fields, temperature fluctuations, and cosmic radiation, which can cause decoherence and errors in the qubit states. This shortens the time available for computations, particularly in tasks like large-scale genomic sequence analysis or protein folding prediction.</p>
<p><italic>Quantum Error Correction:</italic> Robust quantum error correction is still under development. Mitigating these errors is crucial for the successful execution of quantum algorithms. Several error correction techniques have been proposed, including quantum error-correcting codes (<xref ref-type="bibr" rid="ref46">Gowda et al., 2024</xref>) and fault-tolerant quantum computing (<xref ref-type="bibr" rid="ref163">Wang and Liu, 2024</xref>). Error-prone calculations limit the scalability of QNLP for bioinformatics tasks where precision is critical, such as drug discovery or structural bioinformatics.</p>
<p><italic>Limited Qubit Connectivity</italic>: Scalability is another significant challenge for quantum hardware. Current quantum computers have a limited number of qubits, typically in the range of tens or hundreds, which restricts the size and complexity of problems that can be addressed (<xref ref-type="bibr" rid="ref48">Grover, 1996</xref>). Many bioinformatics applications, such as genome assembly, protein structure prediction, and large-scale sequence analysis, require processing vast amounts of data, necessitating quantum computers with thousands or millions of qubits that exceed the current hardware capabilities. Low gate fidelities and restricted qubit connectivity in current quantum systems affect the accuracy and efficiency of QNLP models.</p>
<p>Researchers are actively exploring various approaches to address these hardware constraints. One promising solution is the development of topological quantum computers, which leverage the principles of topological quantum field theory to achieve fault tolerance and scalability (<xref ref-type="bibr" rid="ref4">A&#x00EF;meur et al., 2007</xref>). Additionally, quantum error mitigation techniques, such as zero-noise extrapolation (<xref ref-type="bibr" rid="ref24">Cross et al., 2019</xref>) and probabilistic error cancellation (<xref ref-type="bibr" rid="ref178">Zhou et al., 2020</xref>), aim to reduce the impact of hardware errors without the need for full-scale quantum error correction.</p>
</sec>
<sec id="sec43"><label>6.2</label>
<title>Data representation and encoding</title>
<p>Efficient data representation and encoding are critical for leveraging the potential of QNLP in bioinformatics applications. Biological data, such as genomic sequences, protein structures, and molecular interactions, often exhibit complex patterns and high-dimensional structures, which can be challenging to represent and process on quantum computers. One common approach for encoding biological data on quantum systems is the use of qubit representations, where each qubit or a set of qubits encodes specific aspects of the data (<xref ref-type="bibr" rid="ref126">Quetschlich et al., 2022</xref>). In the case of DNA sequences, each nucleotide (A, T, C, G) can be mapped to a specific qubit state or a combination of qubit states. However, as the size of the biological data increases, the number of qubits required for encoding grows exponentially, leading to scalability issues. To address this challenge, researchers have explored various quantum data embedding techniques, such as amplitude encoding (<xref ref-type="bibr" rid="ref60">Ibtehaz and Kihara, 2023</xref>) and quantum feature mapping (<xref ref-type="bibr" rid="ref70">Kim et al., 2021</xref>). These methods aim to represent high-dimensional data in lower-dimensional quantum states, potentially reducing the number of qubits required and improving the efficiency of QNLP algorithms.</p>
<p>Another approach is the use of quantum machine learning models, which can learn efficient representations of biological data directly from quantum states (<xref ref-type="bibr" rid="ref100">Nathans and Sterling, 2016</xref>). These models can leverage the principles of quantum mechanics, such as superposition and entanglement, to capture complex patterns and relationships in the data.</p>
</sec>
<sec id="sec44"><label>6.3</label>
<title>Algorithm development and optimization</title>
<p>In the following section we outline the challenges that have to be met for the development and optimization of quantum algorithms for QNLP particularly in bioinformatics. One of the significant issues is the lack of numerous realistic quantum algorithms for bioinformatics applications that provide effective solutions to particular real-world problems. As for quantum algorithms, there are some theoretical ones, like Grover&#x2019;s algorithm (<xref ref-type="bibr" rid="ref47">Grealey et al., 2022</xref>) and Shor&#x2019;s algorithm (<xref ref-type="bibr" rid="ref142">Shor, 1999</xref>), that provide more efficient solutions for some problems than classical ones, however, there can be found rather fewer works on how to use them for bioinformatics tasks with practical quantum computers.</p>
<p>As a result of this challenge, researchers have sought to employ integrated quantum-classical algorithms and data pre-processing, with quantum kernels. This approach will seek to take advantage of the two types of computing with a view of avoiding the current drawbacks of quantum computing. For data preparation and cleaning in genomic sequence analysis, classical methods can be applied, and for some particular computation, that requires heavy calculation, quantum method can be used, for example, pattern matching or sequence alignment. Another challenge experienced in algorithm development and optimization is the lack of benchmark and performance metrics. This is particularly important as the development of quantum algorithms and their use in bioinformatics continues particularly as it applies to the assessment of the efficiency of quantum computers as well as the comparison of quantum algorithms to their classical counterparts. This involves assessing aspects like runtime, precision, extensibility, and hardware consumption like the number of qubits, circuit depth.</p>
<p>Additionally, quantum algorithms themselves are not comprehensively optimized because their creation is based on the compromise between several parameters, including computation time, memory, and error. Thus, in the case of genomic sequence analysis, faster performing algorithms may have lower accuracy or may need more qubits which in turn causes more hardware limitations. The trade-offs between precision and speed are especially important to Algorithm designers and developers in the context of bioinformatics applications and they have to choose between these two factors based on their particular case.</p>
<p>Thirdly, the improvement of quantum algorithms is also important for practical applications at the same time. This may include circuit optimization (<xref ref-type="bibr" rid="ref178">Zhou et al., 2020</xref>), quantum compiler optimization (<xref ref-type="bibr" rid="ref126">Quetschlich et al., 2022</xref>), and quantum error mitigation techniques (<xref ref-type="bibr" rid="ref70">Kim et al., 2021</xref>; <xref ref-type="bibr" rid="ref100">Nathans and Sterling, 2016</xref>). These optimizations may enhance the general performance, decrease the demands on resources, and enhance the precision and stability of quantum computation for bioinformatics purposes.</p>
</sec>
<sec id="sec45"><label>6.4</label>
<title>Environmental sustainability and carbon footprint</title>
<p>Bioinformatics studies are more and more based on high-performance computing and big data processing, which generate high amounts of energy consumption and CO2 emissions. Solving this problem is necessary to achieve global sustainability objectives and decrease the impact of scientific computing on the environment. Some papers have compared the costs of different bioinformatics approaches to the environment and have given suggestions on how to reduce these costs.</p>
<p>A recent study by <xref ref-type="bibr" rid="ref100">Nathans and Sterling (2016)</xref> compared the carbon footprint of typical bioinformatics tools and analyses based on RNA sequencing, GWAS, genome assembly, phylogenetic trees, metagenome, and molecular dynamics. The researchers used the Green Algorithms calculator to come up with the carbon emissions in kilograms of CO2 equivalent units (kgCO2e). They also identified the carbon cost of GWAS at the scale of a biobank, pointing out that the application of efficient codes and the use of low-carbon data centers are critical to the reduction of carbon footprint. In addition, (<xref ref-type="bibr" rid="ref47">Grealey et al., 2022</xref>) also explored the effects of parallelization, the use of Central Processing Units and Graphics Processing Units, cloud and local computational resources, and geographical location on carbon footprint. The outcomes showed that applying more efficient parallelization strategies along with simple software updates could cut the carbon footprint of bioinformatics computations by half.</p>
<p>To address these challenges, a new field called environmentally sustainable computational science (ESCS) has developed and offers significant potential for enhancement. To support continued and sustainable growth in computational science, a more planned approach to awareness raising, the improvement of transparency, the better estimation of environmental costs, and the broader reporting of these costs are required (<xref ref-type="bibr" rid="ref149">Stodden and Miguez, 2014</xref>). In support of this effort, the &#x201C;GREENER&#x201D; set of principles and best practices guidance has been developed to guide sustainable software development and deployment (<xref ref-type="bibr" rid="ref77">Lannelongue et al., 2023</xref>). These environmental sustainability issues in bioinformatics are not only important for the sustainability context to meet the global sustainability objectives but also for the bioinformatics sustainability to be feasible (<xref ref-type="bibr" rid="ref139">Selladurai et al., 2024</xref>) and sustainable in the future and large-scale uses. Efficiency improvement of the resource usage, energy-saving computing solutions, and cooperation between domain specialists, developers, and sustainability scholars are the key actions on the way to decreasing the carbon impact of the bioinformatics analyses. Furthermore, there has been suggestions that utilization of quantum computing in bioinformatics could help solve the problems by decreasing the carbon footprint of computationally rigorous tasks (<xref ref-type="bibr" rid="ref140">Shaun et al., 2021</xref>). Specifically, quantum algorithms and simulations can lead to more efficient analysis in protein folding, genomic sequence alignments, molecular modeling, and others, thus decreasing resource usage and emissions (<xref ref-type="bibr" rid="ref170">Wong and Chang, 2022</xref>).</p>
<p><xref ref-type="supplementary-material" rid="SM2">Supplementary Figure 2</xref> shows various challenges and limitations faced in the field of Quantum Computing and QNLP, ranging from hardware constraints to data representation, algorithm development, and environmental sustainability concerns.</p>
<p><xref ref-type="table" rid="tab9">Table 7</xref> provides differences between computational characteristics, software ecosystems, and real-world applications. of Classical NLP and QNLP.</p>
<table-wrap position="float" id="tab9"><label>Table 7</label>
<caption>
<p>Comparative analysis with classical NLP and quantum NLP components.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Component</th>
<th align="left" valign="top">Classical NLP</th>
<th align="left" valign="top">QNLP</th>
<th align="left" valign="top">Ref.</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle">Computational Complexity</td>
<td align="left" valign="middle">Polynomial time complexity for most algorithms</td>
<td align="left" valign="middle">Potential for exponential speedups due to quantum parallelism and entanglement</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref11">Biamonte et al. (2017)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Data Encoding</td>
<td align="left" valign="middle">Well-established techniques for encoding text data</td>
<td align="left" valign="middle">Challenges in efficiently encoding biological data into quantum states</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref110">Outeiral et al. (2021)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Algorithm Maturity</td>
<td align="left" valign="middle">Decades of research and development, well-established algorithms</td>
<td align="left" valign="middle">An emerging field, a limited number of practical algorithms developed.</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref35">Dunjko and Briegel (2018)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Hardware Scalability</td>
<td align="left" valign="middle">Scalable on classical hardware, limited by memory and processing power</td>
<td align="left" valign="middle">Currently limited by the number of available qubits and noise in quantum hardware</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref133">Salem et al. (2023)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Training Data Availability</td>
<td align="left" valign="middle">Large datasets and pre-trained models available for many tasks</td>
<td align="left" valign="middle">Limited availability of large-scale quantum datasets for training</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref76">Kundu et al. (2024)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Interpretability</td>
<td align="left" valign="middle">Interpretability challenges with deep learning models</td>
<td align="left" valign="middle">Potential for improved interpretability due to the mathematical nature of quantum algorithms</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref116">Perrier et al. (2022)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Error Handling</td>
<td align="left" valign="middle">Robust error-handling techniques developed for classical models</td>
<td align="left" valign="middle">Error correction and mitigation techniques are still in development for quantum computing</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref154">Temme et al. (2017)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Software Ecosystem</td>
<td align="left" valign="middle">Mature software libraries and frameworks</td>
<td align="left" valign="middle">Limited software tools and frameworks for QNLP, mainly research-oriented</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref16">Cao et al. (2018)</xref>
</td>
</tr>
<tr>
<td align="left" valign="bottom">Trade-offs</td>
<td align="left" valign="bottom">Performance vs. interpretability</td>
<td align="left" valign="bottom">Speed vs. reliability</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref90">Maheshwari et al. (2022)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Real-world Applications</td>
<td align="left" valign="middle">Widely deployed in various bioinformatics applications</td>
<td align="left" valign="middle">Limited practical applications, mostly proof-of-concept studies</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref124">Pudenz and Lidar (2013)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Hybrid Approaches</td>
<td align="left" valign="middle">Classical methods can benefit from quantum computing accelerators</td>
<td align="left" valign="middle">Hybrid quantum-classical approaches leverage the strengths of both paradigms</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref55">Herrmann et al. (2023)</xref>
</td>
</tr>
<tr>
<td align="left" valign="middle">Tools</td>
<td align="left" valign="middle">NLTK, spaCy, Gensim, Stanford CoreNLP</td>
<td align="left" valign="middle">Qiskit, Cirq, PennyLane, Q#</td>
<td align="left" valign="top">
<xref ref-type="bibr" rid="ref22">Chow (2024)</xref>
</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="sec46"><label>7</label>
<title>Performance evaluation and component analysis</title>
<sec id="sec47"><label>7.1</label>
<title>Evaluation metrics</title>
<p>When it comes to the appropriate performance evaluation of QNLP algorithms in bioinformatics, a proper metric needs to be set up. This not only allows for making accurate and strict comparisons with classical NLP methods but also defines the direction of constructing and fine-tuning QNLP algorithms for particular tasks. The selection of performance indicators varies depending on the bioinformatics application area and its goals. When assessing the quality of protein modeling for example in protein structure prediction, the predicted models can be rated for accuracy by the root-mean-square deviation (RMSD) from the native structure or the Global Distance Test (GDT) scores (<xref ref-type="bibr" rid="ref74">Kryshtafovych and Fidelis, 2009</xref>). Depending on task, in genomic sequence analysis one can use measures such as sensitivity, specificity, F1-score for the pattern recognition or alignment quality measures like Q-score (<xref ref-type="bibr" rid="ref173">Yang et al., 2013</xref>). Besides, problem-specific objective functions, which are calculated based on the results of the algorithm, there are more universal criteria based on the evaluation of the number of computational operations, necessary memory space, and quantum resource usage, such as numbers of qubits, and the depth of the circuits.</p>
<sec id="sec48"><label>7.1.1</label>
<title>Root-mean-square deviation</title>
<p>It is a fundamental metric in structural bioinformatics and computational chemistry for evaluating the accuracy of predicted protein structures. RMSD measures the average distance between the atoms of a predicted protein structure and the corresponding atoms in the experimentally determined native structure, providing a quantitative assessment of the structural similarity between the two structures (<xref ref-type="bibr" rid="ref108">Olechnovi&#x010D; et al., 2019</xref>). The formula for calculating RMSD between two sets of coordinates, each containing n atoms, is given in <xref ref-type="disp-formula" rid="EQ12">Equation 12</xref>:</p>
<disp-formula id="EQ12"><label>(12)</label><mml:math id="M12"><mml:mi mathvariant="italic">RMSD</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mstyle displaystyle="true"><mml:mo stretchy="true">&#x2211;</mml:mo></mml:mstyle><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mfenced open="(" close=")"><mml:mrow><mml:mo stretchy="true">&#x2016;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mspace width="thickmathspace"/><mml:msup><mml:mo stretchy="true">&#x2016;</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:msqrt></mml:math></disp-formula>
<p>Here,<inline-formula><mml:math id="M13"><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>and <inline-formula><mml:math id="M14"><mml:msub><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>represent the coordinates of the &#x1D456;<sup>th</sup> atom in the predicted and native structures, respectively. The term <inline-formula><mml:math id="M15"><mml:mo stretchy="true">&#x2016;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="true">&#x2016;</mml:mo></mml:math></inline-formula> denotes the Euclidean distance between the corresponding atoms in the two structures. In structural bioinformatics, RMSD is a key metric for assessing the quality of protein structure prediction algorithms and molecular docking simulations (<xref ref-type="bibr" rid="ref103">Neveu et al., 2018</xref>). Low RMSD values indicate a high degree of similarity between the predicted and native structures, suggesting that the model accurately captures the protein&#x2019;s folding pattern (<xref ref-type="bibr" rid="ref64">Jumper et al., 2021</xref>). Researchers often use RMSD in conjunction with other metrics, such as Ramachandran plots and GDT (Global Distance Test), to provide a comprehensive evaluation of protein structure predictions and refine computational models for drug discovery and molecular biology applications.</p>
</sec>
<sec id="sec49"><label>7.1.2</label>
<title>Global distance test</title>
<p>It is another important metric used in structural bioinformatics to assess the quality of predicted protein structures. GDT measures the similarity between a predicted protein structure and the experimentally determined native structure by considering the distance between equivalent residues in the two structures (<xref ref-type="bibr" rid="ref118">Poleksic, 2015</xref>). The GDT score is calculated as the percentage of residues in the predicted structure that are within a specified distance threshold of the corresponding residues in the native structure. The GDT score is typically calculated at different distance thresholds like 1&#x202F;&#x00C5;, 2&#x202F;&#x00C5;, 4&#x202F;&#x00C5;, and 8&#x202F;&#x00C5; to provide a comprehensive assessment of the structural similarity.</p>
<p>Mathematically, in <xref ref-type="disp-formula" rid="EQ13">Equation 13</xref> the GDT score at a given distance threshold is calculated as follows:</p>
<disp-formula id="EQ13"><label>(13)</label><mml:math id="M16"><mml:mi mathvariant="normal">G</mml:mi><mml:mi mathvariant="normal">D</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="italic">score</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>D</mml:mi></mml:mfrac><mml:munderover><mml:mstyle displaystyle="true"><mml:mo stretchy="true">&#x2211;</mml:mo></mml:mstyle><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>D</mml:mi></mml:munderover><mml:mi>G</mml:mi><mml:mi>D</mml:mi><mml:mi>T</mml:mi><mml:mi mathvariant="normal">i</mml:mi></mml:math></disp-formula>
<p>D is the total number of residues (atoms) in the protein. GDTi is the fraction of residues for atom &#x1D456; that fall within the distance thresholds.</p>
<p>The GDT score is expressed as a percentage, with higher scores indicating a greater degree of structural similarity between the predicted and native structures. A GDT score of 100% indicates perfect structural similarity, meaning that all residues in the predicted structure are within the specified distance threshold of the corresponding residues in the native structure. GDT provides a quantitative measure of the structural similarity between predicted and native structures. It complements other metrics such as RMSD and Ramachandran plots, offering researchers a comprehensive assessment of the accuracy of computational models in protein structure prediction.</p>
</sec>
<sec id="sec50"><label>7.1.3</label>
<title>F1-score</title>
<p><xref ref-type="disp-formula" rid="EQ14 EQ15 EQ14">Equations 14&#x2013;16</xref> is important to assess the overall performance of a binary classification model. It is particularly useful when the class distribution is imbalanced (<xref ref-type="bibr" rid="ref105">Nunn et al., 2021</xref>).</p>
<p>For calculating F1-score:</p>
<disp-formula id="EQ14"><label>(14)</label><mml:math id="M17"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mspace width="thickmathspace"/><mml:mi>X</mml:mi><mml:mspace width="thickmathspace"/><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">Precision</mml:mi><mml:mspace width="thickmathspace"/><mml:mi>X</mml:mi><mml:mspace width="thickmathspace"/><mml:mi mathvariant="italic">Recall</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">Precision</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">Recall</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>
<p>Where:</p>
<disp-formula id="EQ15"><label>(15)</label><mml:math id="M18"><mml:mi mathvariant="italic">Precision</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">True Positives</mml:mi><mml:mspace width="thickmathspace"/></mml:mrow><mml:mrow><mml:mi mathvariant="normal">True Positives</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="normal">False Positives</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="EQ16"><label>(16)</label><mml:math id="M19"><mml:mi mathvariant="italic">Recall</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">True Positives</mml:mi><mml:mspace width="thickmathspace"/></mml:mrow><mml:mrow><mml:mi mathvariant="normal">True Positives</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="normal">False Negatives</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>
<p>The F1 score ranges from 0 to 1, where a higher score indicates better model performance. It provides a balance between precision and recall, making it a useful metric for evaluating models, especially when there is an imbalance between the two classes. It is important to assess the overall performance of a binary classification model.</p>
</sec>
<sec id="sec51"><label>7.1.4</label>
<title>Quantum resource utilization</title>
<p>It is a metric that evaluates how efficiently a quantum algorithm utilizes quantum resources such as qubits, gates, and circuit depth. It is often used to compare the efficiency of different quantum algorithms in terms of resource consumption. The exact formula for calculating quantum resource utilization can vary depending on the specific context and the factors considered (<xref ref-type="bibr" rid="ref51">Hansen et al., 2023</xref>). However, a general formula could be constructed as follows:</p>
<disp-formula id="EQ17"><label>(17)</label><mml:math id="M20"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">Quantum Resource Utilization</mml:mi><mml:mspace width="thickmathspace"/><mml:mfenced open="(" close=")"><mml:mrow><mml:mi mathvariant="normal">Q</mml:mi><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">U</mml:mi></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">Number of Qubits</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi mathvariant="normal">Circuit Depth</mml:mi></mml:mrow><mml:mi mathvariant="normal">Number of Logical Qubits</mml:mi></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Where, the total number of physical qubits required for quantum computation, the depth of the quantum circuit represents the number of sequential gates that need to be applied, and the number of logical qubits required to represent the problem being implemented. <xref ref-type="disp-formula" rid="EQ17">Equation 17</xref> provides a measure of how efficiently quantum resources (such as qubits and gates) are being utilized to solve a particular problem or implement an algorithm. A lower QRU indicates more efficient resource utilization, while a higher QRU indicates that more resources are required for the computation (<xref ref-type="bibr" rid="ref87">Lubinski et al., 2023</xref>). <xref ref-type="table" rid="tab10">Table 8</xref> provide the overview of evaluation metrics and its significance.</p>
<table-wrap position="float" id="tab10"><label>Table 8</label>
<caption>
<p>Evaluation metrics for QNLP.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Metric</th>
<th align="left" valign="top">Definition</th>
<th align="left" valign="top">Applications</th>
<th align="left" valign="top">Prominence</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="middle">Accuracy</td>
<td align="left" valign="middle">Proportion of correct predictions</td>
<td align="left" valign="middle">Drug-target interaction Sequence alignment</td>
<td align="left" valign="middle">Measures overall model performance</td>
</tr>
<tr>
<td align="left" valign="middle">Precision</td>
<td align="left" valign="middle">True positives over predicted positives</td>
<td align="left" valign="middle">Literature mining Drug discovery</td>
<td align="left" valign="middle">Evaluates relevance of predictions</td>
</tr>
<tr>
<td align="left" valign="middle">Recall (Sensitivity)</td>
<td align="left" valign="middle">True positives over actual positives</td>
<td align="left" valign="middle">Motif detection Protein folding</td>
<td align="left" valign="middle">Assesses ability to identify true cases</td>
</tr>
<tr>
<td align="left" valign="middle">F1 Score</td>
<td align="left" valign="middle">Harmonic mean of precision and recall</td>
<td align="left" valign="middle">Protein structure prediction, RNA analysis</td>
<td align="left" valign="middle">Balances precision and recall in imbalanced datasets</td>
</tr>
<tr>
<td align="left" valign="middle">RMSD</td>
<td align="left" valign="middle">Average deviation in predicted vs. true structure</td>
<td align="left" valign="middle">Protein folding prediction</td>
<td align="left" valign="middle">Measures structural prediction</td>
</tr>
<tr>
<td align="left" valign="middle">Global Distance Test (GDT)</td>
<td align="left" valign="middle">Structural similarity between predicted and true models</td>
<td align="left" valign="middle">Protein structure comparison</td>
<td align="left" valign="middle">Assesses structural bioinformatics results</td>
</tr>
<tr>
<td align="left" valign="middle">Quantum Resource Utilization (QRU)</td>
<td align="left" valign="middle">Qubit and gate usage efficiency</td>
<td align="left" valign="middle">All QNLP tasks</td>
<td align="left" valign="middle">Measures efficiency of quantum algorithm</td>
</tr>
<tr>
<td align="left" valign="middle">Execution Time</td>
<td align="left" valign="middle">Time taken for computation</td>
<td align="left" valign="middle">Sequence alignment Virtual screening</td>
<td align="left" valign="middle">Critical for assessing scalability</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>QNLP is a captivating domain within the field of bioinformatics, presenting prospective benefits in terms of computational economy, precision, and performance when compared to traditional approaches. Although benchmarking studies have shown competitive outcomes for tasks such as genomic sequence analysis (<xref ref-type="bibr" rid="ref141">Shiny Duela et al., 2023</xref>) and protein structure prediction (<xref ref-type="bibr" rid="ref22">Chow, 2024</xref>), the current limitations in error correction overhead and quantum hardware scalability prevent the practical implementation of the theoretical speedups offered by QNLP (<xref ref-type="bibr" rid="ref132">Saggi et al., 2024</xref>). To address these obstacles, hybrid quantum-classical methodologies have surfaced, which involve the strategic delegation of computationally demanding duties to quantum processors while making use of classical resources to preprocess and post-process data (<xref ref-type="bibr" rid="ref177">Zhou et al., 2024</xref>).</p>
<p>Nevertheless, QNLP techniques encounter intrinsic drawbacks, such as the complexity of encoding data, challenges in optimizing algorithms, and the relative youth of quantum hardware in comparison to the firmly established classical NLP environment. Adoption of QNLP in bioinformatics will ultimately depend on continuing algorithm development, progress in quantum computing, and a prudent comparison of the capabilities of classical and hybrid techniques to application-specific performance, accuracy, and scalability needs. However, addressing these obstacles through collaborative research and technological advancements will not only overcome existing limitations but also set the stage for groundbreaking developments in bioinformatics. As we transition into discussing future directions, we focus on the transformative possibilities that lie ahead for QNLPFuture Research Directions and Roadmap.</p>
</sec>
</sec>
<sec id="sec52"><label>7.2</label>
<title>Potential avenues and future prospects</title>
<p>With the ongoing progress in quantum computer technology, the domain of Quantum Natural Language Processing (QNLP) possesses tremendous potential to revolutionize bioinformatics and expand the frontiers of biological investigation and revelation. A multitude of burgeoning trends and prospects are positioned to influence the forthcoming implementations of QNLP within this field (<xref ref-type="supplementary-material" rid="SM3">Supplementary Figure 3</xref>).</p>
<sec id="sec53"><label>7.2.1</label>
<title>Personalized medicine and precision therapeutics</title>
<p>A highly auspicious domain for QNLP to be implemented is customized medicine and precision treatments. QNLP techniques could facilitate a more precise and effective examination of individual genomic data by harnessing the computational capabilities of quantum computing. This, in turn, could pave the way for the creation of customized treatments and personalized pharmacological regimens (<xref ref-type="bibr" rid="ref22">Chow, 2024</xref>). Equipped with extensive multi-omics and clinical data, quantum machine learning models can discern intricate patterns and correlations, hence enabling the identification of previously undiscovered biomarkers and therapeutic targets.</p>
</sec>
<sec id="sec54"><label>7.2.2</label>
<title><italic>De novo</italic> protein design</title>
<p>De novo protein design and protein engineering are indispensable for the creation of novel biomaterials, enzymes, and medicines. When combined with quantum simulations and molecular modeling, QNLP methods have the potential to greatly revolutionize this field by enabling more accurate predictions of protein folding kinetics, structures, and functions (<xref ref-type="bibr" rid="ref141">Shiny Duela et al., 2023</xref>). The application of quantum algorithms for the fast conformational sampling of proteins might help to develop new enzymes, designer proteins, and engineered biomaterials by defining sequences and structures that provide specific functions.</p>
</sec>
<sec id="sec55"><label>7.2.3</label>
<title>Multi-omics data integration</title>
<p>Using multiple omics data, including genomes, transcriptome, proteome, and metabolome, is crucial to develop systems-level models that capture complex cellular functions. Technique of QNLP can have a tremendous effect on this field as they can support the integration of data, patterns&#x2019; recognition, and knowledge search across different and diverse data (<xref ref-type="bibr" rid="ref132">Saggi et al., 2024</xref>). It could be hypothesized that the existing relationships and interactions between multi-omics data sets could be learned by quantum machine learning and algorithms, providing new and previously unknown information about gene regulation networks, metabolic pathways, and disease etiology.</p>
</sec>
<sec id="sec56"><label>7.2.4</label>
<title>Quantum molecular simulations and drug design</title>
<p>The combination of QNLP methods with molecular quantum simulations and quantum chemistry calculations may open a new era in drug discovery. Thanks to quantum computer computing capacities, the scientists were able to create detailed models of what happens with proteins and ligands, biochemical reactions, and other complex biomolecular interactions with superior accuracy and efficiency (<xref ref-type="bibr" rid="ref177">Zhou et al., 2024</xref>). The use of these simulations may result in profound understanding of the molecular interactions of drugs, which in turn may help in the rational design of novel therapeutic agents and optimizing their selectivity, pharmacokinetic profile and affinity.</p>
</sec>
<sec id="sec57"><label>7.2.5</label>
<title>Sustainable Bio-economies</title>
<p>QNLP methods can be beneficial for the development of new sustainable bioeconomies and the conservation of biological diversity. By applying QNLP, it is possible to analyze large biological data sets, which include ecological data, environmental monitoring data, and genomics data to improve the efficiency of sustainable practices in agriculture, forestry and ecosystem management (<xref ref-type="bibr" rid="ref111">Pal et al., 2024</xref>). If, for instance, unstructured data from environmental reports and scientific research was subjected to QNLP methods, then there would be knowledge and information that is relevant to the development of sustainable bioeconomies and conservation of biotic diversity. QNLP is expected to have further potential in bioinformatics and related fields and the development of quantum computing technology will extend basic biological research and development. To achieve these prospective uses, however, will require collective endeavours to overcome the challenges that arise from the scale of quantum technology, the algorithms, the data encoding and the application.</p>
</sec>
<sec id="sec58"><label>7.2.6</label>
<title>Biodiversity conservation</title>
<p>There is a potential for QNLP techniques to contribute to sustainable bioeconomies and support of initiatives related to the conservation of biological diversity. QNLP could help promote the development of sustainable practices in different industries including agriculture and forestry (<xref ref-type="bibr" rid="ref71">Kirubakaran and Midhunchakkaravarthy, 2024</xref>) because QNLP can process big biological data which include genomic data, ecological data and environmental data. From genomic data of crop species QNLP algorithms can identify the right crop cultivars for resistance and climatic adaptability by feature extraction (<xref ref-type="bibr" rid="ref120">Prasad et al., 2024</xref>). For the enhancement of the conservation approaches and ecosystem management, it could also allow the integration of the data on biological diversity from different sources such as field surveys, eDNA, and remote sensing (<xref ref-type="bibr" rid="ref32">Di Sipio et al., 2021</xref>). In addition, the knowledge acquisition and insight generation techniques applicable to sustainable economies and biodiverse conservation (<xref ref-type="bibr" rid="ref147">Sood and Chauhan, 2024</xref>) could be used with QNLP techniques to extract information from such unstructured text data as environmental reports and research articles. It is also possible that some of the sustainable practices in industries such as agriculture, forestry, fishery, and biotechnology might be supported by QNLP through the improvement of efficient knowledge search and decision-making. The opportunity to change the approach to the management of natural systems, as well as the development of bio-economies, and the protection of the biological wealth of the planet for future generations, is in the use of QNLP for environmental sustainability and the conservation of biological diversity.</p>
<p>The potential applications of QNLP provides its capacity to improve in various domains, from personalized medicine to sustainable bio-economies and biodiversity conservation. These advancements underscore the transformative potential of QNLP in addressing some of the most challenges in bioinformatics and beyond. However, it helps in realizing these opportunities will require progress in quantum hardware, algorithm development, and data integration techniques. The following section delves into the roadmap for overcoming these challenges, outlining actionable strategies and collaborative efforts needed to fully harness the power of QNLP in future research and applications.</p>
</sec>
</sec>
<sec id="sec59"><label>7.3</label>
<title>Roadmap and recommendations</title>
<p>To fully harness the capabilities of QNLP in the field of bioinformatics and effectively tackle the obstacles associated with environmental sustainability, it is imperative to establish a thorough roadmap and a set of suggestions is mentioned in <xref ref-type="supplementary-material" rid="SM4">Supplementary Figure 4</xref>. Collaboration among diverse stakeholders including university researchers, makers of hardware and software for quantum computing, experts in bioinformatics and sustainability, and industry partners is important for the formulation of this plan.</p>
<sec id="sec60"><label>7.3.1</label>
<title>Quantum hardware development</title>
<p>The direction for the development of energy-saving quantum hardware technologies must be granted high importance. These include the analysis of new forms of qubit, such as quantum dots. Semiconductor nanostructures used in these qubits may allow them to operate at higher temperatures, thus rendering large-scale cooling unnecessary (<xref ref-type="bibr" rid="ref102">Nayak et al., 2008</xref>). However, topological qubits, due to their grounding in the principles of topological matter, these qubits have an intrinsic immunity to external noise and dephasing. As a consequence, they might require less amount of energy to correct the errors and other expenses associated with the process. To achieve efficient quantum hardware, material scientists, specialists in energy efficiency, and engineers in quantum hardware will need to work together. To obtain reliable QNLP applications, it will be necessary to design quantum systems that are immune to errors. It is strongly believed that the performance of QNLP algorithms can be enhanced by the advancements in fault-tolerant architectures and quantum error-correcting codes. Further study of the more extensive quantum processors with more qubit numbers and longer coherence times is necessary. This would make it possible to apply more complicated QNLP models for tasks such as genome-wide association analysis and protein-ligand interaction analysis. Introducing louder architectures for quantum devices might reduce the impact of environmental decoherence and expand the usability of QNLP in actual problems of bioinformatics.</p>
</sec>
<sec id="sec61"><label>7.3.2</label>
<title>Algorithm research</title>
<p>In tandem with developments in hardware, the development and optimization of quantum algorithms for sustainable bioinformatics applications should be another top priority. This implies the examination of quantum algorithms that have been developed to tackle specific problems, and these are some of the problems that may be solved by quantum computing; sustainable agriculture, protection of biodiversity, and development of environmentally friendly drugs (<xref ref-type="bibr" rid="ref5">Andersson et al., 2022</xref>). It is anticipated that QNLP together with future generations of quantum computers will revolutionize predictive bioinformatics. They may make the realistic quantum computer modelling of different biomolecular processes, for instance protein folding and gene regulation, feasible on FTQC. With better qubit coherence and coherence times and with the deployment of scalable architectures in the future quantum systems, the solution to the computational challenges of the emulation of sophisticated biological structures will be realized and quantum advancements in biological fields will be made. For example, the incorporation of hybrid quantum-classical systems to preprocess the data classically before going to quantum circuits for sequence alignment task could optimise it. Subsequent studies should focus on improving data encoding, quantum embeddings, and quantum-classical combinations in order to minimize the computational load and energy costs associated with them. (<xref ref-type="bibr" rid="ref99">Nammouchi et al., 2023</xref>).</p>
</sec>
<sec id="sec62"><label>7.3.3</label>
<title>Sustainable software engineering</title>
<p>Prescribing and following the best practicable procedures for eco-friendly computational research and sustainable software engineering is vital to reducing the carbon impact of QNLP in bioinformatics. Applying ideas like the &#x201C;GREENER&#x201D; approach which aims at developing principles and recommendations for the sustainable software development, maximization of resource utilization efficiency such as memory, storage space, data transfer, as well as the incorporation of energy-efficient computing solutions are parts of this process (<xref ref-type="bibr" rid="ref77">Lannelongue et al., 2023</xref>).</p>
</sec>
<sec id="sec63"><label>7.3.4</label>
<title>Environmental impact assessment</title>
<p>To provide impartial and consistent assessments of the ecological consequences of QNLP algorithms and approaches, it is imperative to establish standardized benchmarking frameworks and processes for environmental impact evaluation (<xref ref-type="bibr" rid="ref150">Strubell et al., 2020</xref>). Measuring the energy usage of quantum and classical computational resources Assessing the carbon footprint associated with the deployment and operation of QNLP solutions Evaluating the efficient use of hardware resources, such as qubits, memory, and storage should be incorporated into these frameworks to enable comparisons with traditional methodologies and to direct the optimization of sustainable QNLP solutions (<xref ref-type="bibr" rid="ref85">Liu et al., 2021</xref>).</p>
</sec>
<sec id="sec64"><label>7.3.5</label>
<title>Interdisciplinary collaboration</title>
<p>Establishing strong partnerships among quantum computing researchers, bioinformaticians, sustainability scientists, and industry stakeholders is imperative to effectively apply QNLP findings practically and sustainably. The establishment of interdisciplinary research institutes, collaborative initiatives, and platforms for knowledge exchange can expedite the development of sustainable QNLP solutions for bioinformatics and encourage the cross-pollination of ideas (<xref ref-type="bibr" rid="ref6">Awschalom et al., 2021</xref>).</p>
<p>By executing this strategic blueprint and attending to these critical domains, the bioinformatics community can effectively utilize the paradigm-shifting capabilities of QNLP in a manner that is consistent with worldwide sustainability objectives and reduces the ecological repercussions of computational procedures. Creating libraries and tools for QNLP applications tailored to bioinformatics needs could accelerate the development and testing of novel algorithms on emerging quantum devices. Nevertheless, it is imperative to recognize that the achievement of sustainable QNLP in bioinformatics necessitates significant financial expenditures, enduring dedication, and interdisciplinary cooperation among many stakeholders (<xref ref-type="bibr" rid="ref125">Quantum Technology and Application Consortium &#x2013; QUTAC et al., 2021</xref>).</p>
<p>While the limitations of current quantum hardware present significant challenges, the future directions outlined suggest a promising trajectory for QNLP in bioinformatics. The discussion and conclusion section synthesizes the insights and their broader implications for the field.</p>
</sec>
</sec>
</sec>
<sec sec-type="discussion" id="sec65"><label>8</label>
<title>Discussion</title>
<p>Research questions of this study were answered with theoretical and practical applications of quantum natural language processing in advancing bioinformatics. In the analysis of Research Question 1, we showed how QNLP applies basic tenets of quantum computing such as superposition, entanglement, and parallelism to analyze linguistic data. Such methods as quantum embeddings and the DisCoCat framework extend the capabilities of text analysis and allow for representation and recognizing patterns beyond the scope of classical NLP. To answer Research Question 2, we found out that QNLP algorithms outperform traditional methods of NLP especially when it comes to data scale. Grover&#x2019;s algorithm speeds up the search by keywords, while quantum embeddings improve the language modeling tasks. Of these, the areas that best illustrate the growth of these principles are Bioinformatics, where scaling factors and precision are paramount. To answer Research Question 3, we presented the primary areas of application of QNLP in bioinformatics, such as drug discovery, protein folding, and genomic sequence analysis. In drug discovery, QNLP enhances the rate of literature review and virtual screening, as well as enhancing the identification of the interaction between drugs and targets. Likewise, in protein structure prediction, QNLP helps in understanding of large data sets and with that gives a ground for quantum computational simulations. These cases illustrate how QNLP is likely to bring about workflow optimization in bioinformatics and enhance the feasibility of several important processes. Last for Research Question 4, we looked at the current challenge and future prospect of QNLP in bioinformatics. The main issues are the limitations of quantum hardware like noise, qubit coherence, quantum hardware scaling and the problem of mapping biological data into quantum. Future opportunities lies in hybrid quantum-classical frameworks, noise-resilient algorithms, and advancements in quantum processors. As these limitations are addressed, QNLP is poised to become a powerful tool in personalized medicine, multi-omics integration, and environmental bioinformatics. This discussion ties the findings to the research questions, showing how QNLP can address pressing challenges in bioinformatics while outlining pathways for future exploration. By focusing on interdisciplinary collaboration and technological innovation, QNLP offers a promising avenue for advancing bioinformatics and related fields.</p>
</sec>
<sec sec-type="conclusions" id="sec66"><label>9</label>
<title>Conclusion</title>
<p>Quantum natural language processing (QNLP) is a new concept that represents a radical departure from the standard approach to bioinformatics through the application of quantum computing to transform the way biological information is analyzed and understood. The current comprehensive review has also discussed the theory and application, challenges and opportunities of QNLP in various areas such as genomics sequence analysis, protein structures prediction, and drug discovery. From the existing body of work and current industrial applications, it is obvious that QNLP has the potential to be more computationally efficient, accurate, and scalable than conventional NLP techniques despite being a relatively young field of study. By incorporating quantum characteristics such as entanglement, superposition, and parallelism, QNLP algorithms have shown promising results in several applications including sequence alignment, literature analysis, virtual library search, and protein folding. However, there are still some challenges that slow down the implementation of QNLP in the bioinformatics domain. These include limitations on the quantum hardware, and the challenge posed by data encoding, and the need for algorithm design and validation. To tackle these obstacles, it will be necessary for bioinformaticians, industry stakeholders, and quantum computing researchers to collaborate. Additionally, substantial investments will be needed in the development of sustainable software engineering practices, interdisciplinary education, and workforce development. QNLP can revolutionize fields like medicine and genomics. It could speed up the discovery of life-saving drugs, help doctors create personalized treatments based on a patient&#x2019;s genetic code, and provide insights into diseases at a molecular level.</p>
<p>With great promise for revolutionary applications in personalized medicine, de novo protein design, multi-omics data integration, sustainable bioeconomics, and environmental sustainability, QNLP in bioinformatics has a bright future. Through the utilization of quantum computer computational capabilities and the integration of QNLP methodologies with molecular modeling and quantum simulations, scholars have the potential to unveil hitherto unexplored understandings of biological mechanisms, expedite the process of discovering new drugs, and establish environmentally sound approaches to ecosystem management and biodiversity preservation. With the ongoing advancements in quantum computing technology, the feasibility of incorporating QNLP into bioinformatics will grow substantially. This will facilitate the exploration of novel insights, the efficient analysis of data, and the creation of inventive resolutions for worldwide issues on healthcare, biotechnology, and environmental sustainability. By wholeheartedly adopting this burgeoning domain and following the strategic path delineated in this evaluation, the bioinformatics community can effectively utilize QNLP to its complete capacity, thereby propelling scientific advancement and making a positive and sustainable contribution to the future.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="sec67">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/<xref rid="SM1" ref-type="supplementary-material">Supplementary material</xref>, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="author-contributions" id="sec68">
<title>Author contributions</title>
<p>GP: Writing &#x2013; original draft. RK: Writing &#x2013; review &#x0026; editing.</p>
</sec>
<sec sec-type="funding-information" id="sec69">
<title>Funding</title>
<p>The author(s) declare that no financial support was received for the research, authorship, and/or publication of this article.</p>
</sec>
<sec sec-type="COI-statement" id="sec70">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="sec71">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<sec sec-type="supplementary-material" id="sec72">
<title>Supplementary material</title>
<p>The Supplementary material for this article can be found online at: <ext-link xlink:href="https://www.frontiersin.org/articles/10.3389/fcomp.2025.1464122/full#supplementary-material" ext-link-type="uri">https://www.frontiersin.org/articles/10.3389/fcomp.2025.1464122/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="Supplementary_file_1.png" mimetype="image/png" xmlns:xlink="http://www.w3.org/1999/xlink" id="SM1"><label>SUPPLEMENTARY FIGURE 1</label><caption><p>Comparative performance.</p></caption></supplementary-material>
<supplementary-material xlink:href="Supplementary_file_2.png" mimetype="image/png" xmlns:xlink="http://www.w3.org/1999/xlink" id="SM2"><label>SUPPLEMENTARY FIGURE 2</label><caption><p>Potential applications and future prospects.</p></caption></supplementary-material>
<supplementary-material xlink:href="Supplementary_file_3.jpg" mimetype="image/jpeg" xmlns:xlink="http://www.w3.org/1999/xlink" id="SM3"><label>SUPPLEMENTARY FIGURE 3</label><caption><p>Challenges and limitations.</p></caption></supplementary-material>
<supplementary-material xlink:href="Supplementary_file_4.jpg" mimetype="image/jpeg" xmlns:xlink="http://www.w3.org/1999/xlink" id="SM4"><label>SUPPLEMENTARY FIGURE 4</label><caption><p>Roadmap and recommendations.</p></caption></supplementary-material>
</sec>
<ref-list>
<title>References</title>
<ref id="ref1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abbas</surname> <given-names>H.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum machine learning-models and algorithms: studying quantum machine learning models and algorithms for leveraging quantum computing advantages in data analysis, pattern recognition, and optimization</article-title>. <source>Aust. J. Mach. Learn. Res. Appl.</source> <volume>4</volume>, <fpage>221</fpage>&#x2013;<lpage>232</lpage>.</citation></ref>
<ref id="ref2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abbaszade</surname> <given-names>M.</given-names></name> <name><surname>Salari</surname> <given-names>V.</given-names></name> <name><surname>Mousavi</surname> <given-names>S. S.</given-names></name> <name><surname>Zomorodi</surname> <given-names>M.</given-names></name> <name><surname>Zhou</surname> <given-names>X.</given-names></name></person-group> (<year>2021</year>). <article-title>Application of quantum natural language processing for language translation</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>130434</fpage>&#x2013;<lpage>130448</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3108768</pub-id>, PMID: <pub-id pub-id-type="pmid">39573497</pub-id></citation></ref>
<ref id="ref3"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Abdellah</surname> <given-names>T.</given-names></name> <name><surname>Merazka</surname> <given-names>F.</given-names></name> <name><surname>Zahra</surname> <given-names>H. F.</given-names></name></person-group> (<year>2023</year>). &#x201C;Quantum computing for DNA analysis and AI in genomics.&#x201D; In 2023 20th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA). pp. 1&#x2013;6. IEEE.</citation></ref>
<ref id="ref4"><citation citation-type="other"><person-group person-group-type="author"><name><surname>A&#x00EF;meur</surname> <given-names>E.</given-names></name> <name><surname>Brassard</surname> <given-names>G.</given-names></name> <name><surname>Gambs</surname> <given-names>S.</given-names></name></person-group> (<year>2007</year>). &#x201C;Quantum clustering algorithms.&#x201D; In Proceedings of the 24th International Conference on Machine Learning. pp. 1&#x2013;8. Association for Computing Machinery.</citation></ref>
<ref id="ref5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Andersson</surname> <given-names>M. P.</given-names></name> <name><surname>Jones</surname> <given-names>M. N.</given-names></name> <name><surname>Mikkelsen</surname> <given-names>K. V.</given-names></name> <name><surname>You</surname> <given-names>F.</given-names></name> <name><surname>Mansouri</surname> <given-names>S. S.</given-names></name></person-group> (<year>2022</year>). <article-title>Quantum computing for chemical and biomolecular product design</article-title>. <source>Curr. Opin. Chem. Eng.</source> <volume>36</volume>:<fpage>100754</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.coche.2021.100754</pub-id></citation></ref>
<ref id="ref6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Awschalom</surname> <given-names>D.</given-names></name> <name><surname>Berggren</surname> <given-names>K. K.</given-names></name> <name><surname>Bernien</surname> <given-names>H.</given-names></name> <name><surname>Bhave</surname> <given-names>S.</given-names></name> <name><surname>Carr</surname> <given-names>L. D.</given-names></name> <name><surname>Davids</surname> <given-names>P.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Development of quantum interconnects (QuICs) for next-generation information technologies</article-title>. <source>PRX Quantum</source> <volume>2</volume>:<fpage>017002</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PRXQuantum.2.017002</pub-id></citation></ref>
<ref id="ref7"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Bach</surname> <given-names>H. H.</given-names></name> <name><surname>Nguyen</surname> <given-names>D. K.</given-names></name> <name><surname>Dung</surname> <given-names>N. N. V.</given-names></name></person-group> (<year>2024</year>). &#x201C;<article-title>Quantum approach for constructing phylogenetic maximum parsimony tree</article-title>&#x201D; in <source>Future data and security engineering. Big data, security and privacy, Smart City and industry 4.0 applications: 11th international conference on future data and security engineering, FDSE 2024, Binh Duong, Vietnam, November 27&#x2013;29, 2024, proceedings, part II</source> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer Nature Singapore</publisher-name>), <fpage>158</fpage>&#x2013;<lpage>170</lpage>.</citation></ref>
<ref id="ref8"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baiardi</surname> <given-names>A.</given-names></name> <name><surname>Christandl</surname> <given-names>M.</given-names></name> <name><surname>Reiher</surname> <given-names>M.</given-names></name></person-group> (<year>2023</year>). <article-title>Quantum computing for molecular biology</article-title>. <source>Chembiochem</source> <volume>24</volume>:<fpage>e202300120</fpage>. doi: <pub-id pub-id-type="doi">10.1002/cbic.202300120</pub-id>, PMID: <pub-id pub-id-type="pmid">37151197</pub-id></citation></ref>
<ref id="ref9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Benedetti</surname> <given-names>M.</given-names></name> <name><surname>Realpe-G&#x00F3;mez</surname> <given-names>J.</given-names></name> <name><surname>Biswas</surname> <given-names>R.</given-names></name> <name><surname>Perdomo-Ortiz</surname> <given-names>A.</given-names></name></person-group> (<year>2017</year>). <article-title>Quantum-assisted learning of hardware-embedded probabilistic graphical models</article-title>. <source>Phys. Rev. X</source> <volume>7</volume>:<fpage>041052</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevX.7.041052</pub-id></citation></ref>
<ref id="ref10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bhuvaneswari</surname> <given-names>S.</given-names></name> <name><surname>Deepakraj</surname> <given-names>R.</given-names></name> <name><surname>Urooj</surname> <given-names>S.</given-names></name> <name><surname>Sharma</surname> <given-names>N.</given-names></name> <name><surname>Pathak</surname> <given-names>N.</given-names></name></person-group> (<year>2023</year>). <article-title>Computational analysis: unveiling the quantum algorithms for protein analysis and predictions</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>94023</fpage>&#x2013;<lpage>94033</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3310812</pub-id>, PMID: <pub-id pub-id-type="pmid">39573497</pub-id></citation></ref>
<ref id="ref11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Biamonte</surname> <given-names>J.</given-names></name> <name><surname>Wittek</surname> <given-names>P.</given-names></name> <name><surname>Pancotti</surname> <given-names>N.</given-names></name> <name><surname>Rebentrost</surname> <given-names>P.</given-names></name> <name><surname>Wiebe</surname> <given-names>N.</given-names></name> <name><surname>Lloyd</surname> <given-names>S.</given-names></name></person-group> (<year>2017</year>). <article-title>Quantum machine learning</article-title>. <source>Nature</source> <volume>549</volume>, <fpage>195</fpage>&#x2013;<lpage>202</lpage>. doi: <pub-id pub-id-type="doi">10.1038/nature23474</pub-id>, PMID: <pub-id pub-id-type="pmid">28905917</pub-id></citation></ref>
<ref id="ref12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Black</surname> <given-names>P.</given-names></name> <name><surname>Kuhn</surname> <given-names>D.</given-names></name> <name><surname>Williams</surname> <given-names>C.</given-names></name></person-group> (<year>2002</year>). <article-title>Quantum computing and communication</article-title>. <source>Adv. Comput.</source> <volume>56</volume>, <fpage>189</fpage>&#x2013;<lpage>244</lpage>. doi: <pub-id pub-id-type="doi">10.1016/S0065-2458(02)80007-9</pub-id></citation></ref>
<ref id="ref13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Boev</surname> <given-names>A. S.</given-names></name> <name><surname>Rakitko</surname> <given-names>A. S.</given-names></name> <name><surname>Usmanov</surname> <given-names>S. R.</given-names></name> <name><surname>Kobzeva</surname> <given-names>A. N.</given-names></name> <name><surname>Popov</surname> <given-names>I. V.</given-names></name> <name><surname>Ilinsky</surname> <given-names>V. V.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Genome assembly using quantum and quantum-inspired annealing</article-title>. <source>Sci. Rep.</source> <volume>11</volume>:<fpage>13183</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-021-88321-5</pub-id>, PMID: <pub-id pub-id-type="pmid">34162895</pub-id></citation></ref>
<ref id="ref14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Boulebnane</surname> <given-names>S.</given-names></name> <name><surname>Lucas</surname> <given-names>X.</given-names></name> <name><surname>Meyder</surname> <given-names>A.</given-names></name> <name><surname>Adaszewski</surname> <given-names>S.</given-names></name> <name><surname>Montanaro</surname> <given-names>A.</given-names></name></person-group> (<year>2022</year>). <article-title>Peptide conformational sampling using the quantum approximate optimization algorithm</article-title>. <source>NPJ Quantum Inform.</source> <volume>9</volume>, <fpage>1</fpage>&#x2013;<lpage>12</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41534-022-00685-9</pub-id></citation></ref>
<ref id="ref15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Campbell</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2024</year>). <article-title>A series of fast-paced advances in quantum error correction</article-title>. <source>Nat. Rev. Phys.</source> <volume>6</volume>, <fpage>160</fpage>&#x2013;<lpage>161</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s42254-024-00706-3</pub-id></citation></ref>
<ref id="ref16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cao</surname> <given-names>Y.</given-names></name> <name><surname>Romero</surname> <given-names>J.</given-names></name> <name><surname>Aspuru-Guzik</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <article-title>Potential of quantum computing for drug discovery</article-title>. <source>IBM J. Res. Dev.</source> <volume>62</volume>, <fpage>6:1</fpage>&#x2013;<lpage>6:20</lpage>. doi: <pub-id pub-id-type="doi">10.1147/JRD.2018.2888987</pub-id>, PMID: <pub-id pub-id-type="pmid">33813791</pub-id></citation></ref>
<ref id="ref17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cao</surname> <given-names>Y.</given-names></name> <name><surname>Romero</surname> <given-names>J.</given-names></name> <name><surname>Olson</surname> <given-names>J. P.</given-names></name> <name><surname>Degroote</surname> <given-names>M.</given-names></name> <name><surname>Johnson</surname> <given-names>P. D.</given-names></name> <name><surname>Kieferov&#x00E1;</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Quantum chemistry in the age of quantum computing</article-title>. <source>Chem. Rev.</source> <volume>119</volume>, <fpage>10856</fpage>&#x2013;<lpage>10915</lpage>. doi: <pub-id pub-id-type="doi">10.1021/acs.chemrev.8b00803</pub-id>, PMID: <pub-id pub-id-type="pmid">31469277</pub-id></citation></ref>
<ref id="ref18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chandarana</surname> <given-names>P.</given-names></name> <name><surname>Hegade</surname> <given-names>N. N.</given-names></name> <name><surname>Montalban</surname> <given-names>I.</given-names></name> <name><surname>Solano</surname> <given-names>E.</given-names></name> <name><surname>Chen</surname> <given-names>X.</given-names></name></person-group> (<year>2023</year>). <article-title>Digitized counter diabatic quantum algorithm for protein folding</article-title>. <source>Phys. Rev. Appl.</source> <volume>20</volume>:<fpage>014024</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevApplied.20.014024</pub-id></citation></ref>
<ref id="ref19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chapman</surname> <given-names>S.</given-names></name> <name><surname>Adami</surname> <given-names>C.</given-names></name> <name><surname>Wilke</surname> <given-names>C. O.</given-names></name> <name><surname>Kc</surname> <given-names>D. B.</given-names></name></person-group> (<year>2017</year>). <article-title>The evolution of logic circuits for the purpose of protein contact map prediction</article-title>. <source>PeerJ</source> <volume>5</volume>:<fpage>e3139</fpage>. doi: <pub-id pub-id-type="doi">10.7717/PEERJ.3139</pub-id>, PMID: <pub-id pub-id-type="pmid">28439455</pub-id></citation></ref>
<ref id="ref20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Pan</surname> <given-names>Y.</given-names></name> <name><surname>Dong</surname> <given-names>D.</given-names></name></person-group> (<year>2023</year>). <article-title>Quantum language model with entanglement embedding for question answering</article-title>. <source>IEEE Trans. Cybernet.</source> <volume>53</volume>, <fpage>3467</fpage>&#x2013;<lpage>3478</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TCYB.2021.3131252</pub-id>, PMID: <pub-id pub-id-type="pmid">34910651</pub-id></citation></ref>
<ref id="ref21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cherrat</surname> <given-names>E. A.</given-names></name> <name><surname>Kerenidis</surname> <given-names>I.</given-names></name> <name><surname>Mathur</surname> <given-names>N.</given-names></name> <name><surname>Landman</surname> <given-names>J.</given-names></name> <name><surname>Strahm</surname> <given-names>M.</given-names></name> <name><surname>Li</surname> <given-names>Y. Y.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum vision transformers</article-title>. <source>Quantum</source> <volume>8</volume>:<fpage>1265</fpage>. doi: <pub-id pub-id-type="doi">10.22331/q-2024-02-22-1265</pub-id></citation></ref>
<ref id="ref22"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chow</surname> <given-names>J. C. L.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum computing in medicine</article-title>. <source>Med. Sci.</source> <volume>12</volume>:<fpage>67</fpage>. doi: <pub-id pub-id-type="doi">10.3390/medsci12040067</pub-id>, PMID: <pub-id pub-id-type="pmid">39584917</pub-id></citation></ref>
<ref id="ref23"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Cincio</surname> <given-names>L.</given-names></name> <name><surname>Rudinger</surname> <given-names>K. M.</given-names></name> <name><surname>Sarovar</surname> <given-names>M.</given-names></name> <name><surname>Coles</surname> <given-names>P. J.</given-names></name></person-group> (<year>2020</year>). <source>Machine learning of noise-resilient quantum circuits</source>. Maryland, U.S: <publisher-name>PRX Quantum</publisher-name>.</citation></ref>
<ref id="ref24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cross</surname> <given-names>A. W.</given-names></name> <name><surname>Bishop</surname> <given-names>L. S.</given-names></name> <name><surname>Sheldon</surname> <given-names>S.</given-names></name> <name><surname>Nation</surname> <given-names>P. D.</given-names></name> <name><surname>Gambetta</surname> <given-names>J. M.</given-names></name></person-group> (<year>2019</year>). <article-title>Validating quantum computers using randomized model circuits</article-title>. <source>Phys. Rev. A</source> <volume>100</volume>:<fpage>032328</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevA.100.032328</pub-id></citation></ref>
<ref id="ref25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Daimon</surname> <given-names>S.</given-names></name> <name><surname>Matsushita</surname> <given-names>Y.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum circuit generation for amplitude encoding using a transformer decoder</article-title>. <source>Phys. Rev. Appl.</source> <volume>22</volume>:<fpage>L041001</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevApplied.22.L041001</pub-id></citation></ref>
<ref id="ref26"><citation citation-type="other"><person-group person-group-type="author"><name><surname>D'Aloisio</surname> <given-names>G.</given-names></name> <name><surname>Fortz</surname> <given-names>S.</given-names></name> <name><surname>Hanna</surname> <given-names>C.</given-names></name> <name><surname>Fortunato</surname> <given-names>D.</given-names></name> <name><surname>Bensoussan</surname> <given-names>A.</given-names></name> <name><surname>Mendiluze Usandizaga</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2024</year>). &#x201C;Exploring LLM-driven explanations for quantum algorithms.&#x201D; in Proceedings of the 18th ACM/IEEE international symposium on empirical software engineering and measurement. pp. 475&#x2013;481. Association for Computing Machinery.</citation></ref>
<ref id="ref27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Das Sarma</surname> <given-names>S.</given-names></name> <name><surname>Deng</surname> <given-names>D.-L.</given-names></name> <name><surname>Duan</surname> <given-names>L.-M.</given-names></name></person-group> (<year>2019</year>). <article-title>Machine learning meets quantum physics</article-title>. <source>Phys. Today</source> <volume>72</volume>, <fpage>48</fpage>&#x2013;<lpage>54</lpage>. doi: <pub-id pub-id-type="doi">10.1063/PT.3.4164</pub-id></citation></ref>
<ref id="ref28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Daskin</surname> <given-names>A.</given-names></name> <name><surname>Grama</surname> <given-names>A.</given-names></name> <name><surname>Kais</surname> <given-names>S.</given-names></name></person-group> (<year>2014</year>). <article-title>Multiple network alignment on quantum computers</article-title>. <source>Quantum Inf. Process</source> <volume>13</volume>, <fpage>2653</fpage>&#x2013;<lpage>2666</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s11128-014-0818-7</pub-id>, PMID: <pub-id pub-id-type="pmid">39850651</pub-id></citation></ref>
<ref id="ref29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>De Angelis</surname> <given-names>L.</given-names></name> <name><surname>Baglivo</surname> <given-names>F.</given-names></name> <name><surname>Arzilli</surname> <given-names>G.</given-names></name> <name><surname>Privitera</surname> <given-names>G. P.</given-names></name> <name><surname>Ferragina</surname> <given-names>P.</given-names></name> <name><surname>Tozzi</surname> <given-names>A. E.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>ChatGPT and the rise of large language models: the new AI-driven infodemic threat in public health</article-title>. <source>Front. Public Health</source> <volume>11</volume>:<fpage>1166120</fpage>. doi: <pub-id pub-id-type="doi">10.3389/fpubh.2023.1166120</pub-id>, PMID: <pub-id pub-id-type="pmid">37181697</pub-id></citation></ref>
<ref id="ref30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>de Paula Neto</surname> <given-names>F. M.</given-names></name> <name><surname>da Silva</surname> <given-names>A. J.</given-names></name> <name><surname>de Oliveira</surname> <given-names>W. R.</given-names></name> <name><surname>Ludermir</surname> <given-names>T. B.</given-names></name></person-group> (<year>2019</year>). <article-title>Quantum probabilistic associative memory architecture</article-title>. <source>Neurocomputing</source> <volume>351</volume>, <fpage>101</fpage>&#x2013;<lpage>110</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.neucom.2019.03.078</pub-id>, PMID: <pub-id pub-id-type="pmid">39854647</pub-id></citation></ref>
<ref id="ref31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dejpasand</surname> <given-names>M. T.</given-names></name> <name><surname>Sasani Ghamsari</surname> <given-names>M.</given-names></name></person-group> (<year>2023</year>). <article-title>Research trends in quantum computers by focusing on qubits as their building blocks</article-title>. <source>Quantum Rep.</source> <volume>5</volume>, <fpage>597</fpage>&#x2013;<lpage>608</lpage>. doi: <pub-id pub-id-type="doi">10.3390/quantum5030039</pub-id></citation></ref>
<ref id="ref32"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Di Sipio</surname> <given-names>R.</given-names></name> <name><surname>Huang</surname> <given-names>J.-H.</given-names></name> <name><surname>Chen</surname> <given-names>S. Y.-C.</given-names></name> <name><surname>Mangini</surname> <given-names>S.</given-names></name> <name><surname>Worring</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). The dawn of quantum natural language processing. arXiv: Computation and language. Available at: <ext-link xlink:href="https://arxiv.org/abs/2105.04058" ext-link-type="uri">https://arxiv.org/abs/2105.04058</ext-link> (Accessed May 23, 2022).</citation></ref>
<ref id="ref33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Doga</surname> <given-names>H.</given-names></name> <name><surname>Raubenolt</surname> <given-names>B.</given-names></name> <name><surname>Cumbo</surname> <given-names>F.</given-names></name> <name><surname>Joshi</surname> <given-names>J.</given-names></name> <name><surname>DiFilippo</surname> <given-names>F. P.</given-names></name> <name><surname>Qin</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2024</year>). <article-title>A perspective on protein structure prediction using quantum computers</article-title>. <source>J. Chem. Theory Comput.</source> <volume>20</volume>, <fpage>3359</fpage>&#x2013;<lpage>3378</lpage>. doi: <pub-id pub-id-type="doi">10.1021/acs.jctc.4c00067</pub-id>, PMID: <pub-id pub-id-type="pmid">38703105</pub-id></citation></ref>
<ref id="ref34"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Drori</surname> <given-names>I.</given-names></name> <name><surname>Thaker</surname> <given-names>D.</given-names></name> <name><surname>Srivatsa</surname> <given-names>A.</given-names></name> <name><surname>Jeong</surname> <given-names>D.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Nan</surname> <given-names>L.</given-names></name> <etal/></person-group>. (<year>2019</year>). Accurate protein structure prediction by embeddings and deep learning representations. arXiv preprint arXiv:1911.05531.</citation></ref>
<ref id="ref35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dunjko</surname> <given-names>V.</given-names></name> <name><surname>Briegel</surname> <given-names>H. J.</given-names></name></person-group> (<year>2018</year>). <article-title>Machine learning &#x0026; artificial intelligence in the quantum domain: A review of recent progress</article-title>. <source>Rep. Prog. Phys.</source> <volume>81</volume>:<fpage>074001</fpage>. doi: <pub-id pub-id-type="doi">10.1088/1361-6633/aab406</pub-id>, PMID: <pub-id pub-id-type="pmid">29504942</pub-id></citation></ref>
<ref id="ref36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dur&#x00E1;n</surname> <given-names>C.</given-names></name> <name><surname>Carrasco</surname> <given-names>R.</given-names></name> <name><surname>Soto</surname> <given-names>I.</given-names></name> <name><surname>Galeas</surname> <given-names>I.</given-names></name> <name><surname>Az&#x00F3;car</surname> <given-names>J.</given-names></name> <name><surname>Pe&#x00F1;a</surname> <given-names>V.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Quantum algorithms: applications, criteria and metrics</article-title>. <source>Complex Intell. Syst.</source> <volume>9</volume>, <fpage>6373</fpage>&#x2013;<lpage>6392</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s40747-023-01073-9</pub-id></citation></ref>
<ref id="ref37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Edward</surname> <given-names>O.</given-names></name> <name><surname>Pyzer-Knapp</surname> <given-names>A.</given-names></name> <name><surname>Curioni</surname> <given-names>A.</given-names></name></person-group> (<year>2024</year>). <article-title>Advancing biomolecular simulation through exascale HPC, AI, and quantum computing</article-title>. <source>Curr. Opin. Struct. Biol.</source> <volume>87</volume>:<fpage>102826</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.sbi.2024.102826</pub-id>, PMID: <pub-id pub-id-type="pmid">38733863</pub-id></citation></ref>
<ref id="ref38"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Farahmand</surname> <given-names>Y.</given-names></name> <name><surname>Heidarnezhad</surname> <given-names>Z.</given-names></name> <name><surname>Heidarnezhad</surname> <given-names>F.</given-names></name> <name><surname>Muminov</surname> <given-names>K.</given-names></name> <name><surname>Heydari</surname> <given-names>F.</given-names></name></person-group> (<year>2014</year>). <article-title>A study of quantum information and quantum computers</article-title>. <source>Orient. J. Chem.</source> <volume>30</volume>, <fpage>601</fpage>&#x2013;<lpage>606</lpage>. doi: <pub-id pub-id-type="doi">10.13005/ojc/300227</pub-id></citation></ref>
<ref id="ref39"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Ganguly</surname> <given-names>S.</given-names></name> <name><surname>Chandilkar</surname> <given-names>V.</given-names></name> <name><surname>Jain</surname> <given-names>P.</given-names></name> <name><surname>Bertel</surname> <given-names>L. G. A.</given-names></name></person-group> (<year>2024</year>). &#x201C;<article-title>Quantum graph neural networks based protein-ligand classification</article-title>&#x201D; in <source>Artificial intelligence and knowledge processing</source>. eds. <person-group person-group-type="editor"><name><surname>Rodriguez</surname> <given-names>R. V.</given-names></name> <name><surname>Rege</surname> <given-names>M.</given-names></name> <name><surname>Piuri</surname> <given-names>V.</given-names></name> <name><surname>Xu</surname> <given-names>G.</given-names></name> <name><surname>Ong</surname> <given-names>K. L.</given-names></name></person-group>, vol. <volume>2127</volume> (<publisher-name>Springer</publisher-name>), <fpage>139</fpage>&#x2013;<lpage>149</lpage>.</citation></ref>
<ref id="ref40"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Ganguly</surname> <given-names>S.</given-names></name> <name><surname>Morapakula</surname> <given-names>S. N.</given-names></name> <name><surname>Coronado</surname> <given-names>L. M. P.</given-names></name></person-group> (<year>2022</year>). &#x201C;<article-title>Quantum natural language processing based sentiment analysis using Lambeq toolkit</article-title>&#x201D; in <source>Proceedings of the 2022 second international conference on power, control and computing technologies (Los Alamitos, California: ICPC2T)</source>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>. <comment>IEEE</comment></citation></ref>
<ref id="ref41"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Ghoabdi</surname> <given-names>M. Z.</given-names></name> <name><surname>Afsaneh</surname> <given-names>E.</given-names></name></person-group> (<year>2023</year>). Quantum machine learning for untangling the real-world problem of cancers classification based on gene expressions. bioRxiv, 2023&#x2013;08.</citation></ref>
<ref id="ref42"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Ghosh</surname> <given-names>A.</given-names></name> <name><surname>Fuad</surname> <given-names>M. D.</given-names></name> <name><surname>Bhattacharjee</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). Empirical quantum advantage analysis of quantum kernel in gene expression data. arXiv preprint arXiv:2411.07276.</citation></ref>
<ref id="ref43"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ginex</surname> <given-names>T.</given-names></name> <name><surname>V&#x00E1;zquez</surname> <given-names>J.</given-names></name> <name><surname>Estarellas</surname> <given-names>C.</given-names></name> <name><surname>Luque</surname> <given-names>F. J.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum mechanical-based strategies in drug discovery: finding the pace to new challenges in drug design</article-title>. <source>Curr. Opin. Struct. Biol.</source> <volume>87</volume>:<fpage>102870</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.sbi.2024.102870</pub-id>, PMID: <pub-id pub-id-type="pmid">38914031</pub-id></citation></ref>
<ref id="ref44"><citation citation-type="other"><person-group person-group-type="author"><collab id="coll1">Go, First, Plans</collab></person-group>. (<year>2023</year>). Quantum algorithm for position weight matrix matching.</citation></ref>
<ref id="ref45"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gorgulla</surname> <given-names>C.</given-names></name> <name><surname>Jayaraj</surname> <given-names>A.</given-names></name> <name><surname>Fackeldey</surname> <given-names>K.</given-names></name> <name><surname>Arthanari</surname> <given-names>H.</given-names></name></person-group> (<year>2022</year>). <article-title>Emerging frontiers in virtual drug discovery: from quantum mechanical methods to deep learning approaches</article-title>. <source>Curr. Opin. Chem. Biol.</source> <volume>69</volume>:<fpage>102156</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.cbpa.2022.102156</pub-id>, PMID: <pub-id pub-id-type="pmid">35576813</pub-id></citation></ref>
<ref id="ref46"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Gowda</surname> <given-names>D.</given-names></name> <name><surname>Patil</surname> <given-names>H. Y.</given-names></name> <name><surname>Abidin</surname> <given-names>S.</given-names></name> <name><surname>Panda</surname> <given-names>R. A.</given-names></name> <name><surname>Suneetha</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). &#x201C;<article-title>Quantum machine learning for biomedical data analysis</article-title>&#x201D; in <source>Quantum innovations at the Nexus of biomedical intelligence</source> (Hershey, PA, USA: <publisher-name>IGI Global</publisher-name>), <fpage>180</fpage>&#x2013;<lpage>205</lpage>.</citation></ref>
<ref id="ref47"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Grealey</surname> <given-names>J.</given-names></name> <name><surname>Lannelongue</surname> <given-names>L.</given-names></name> <name><surname>Saw</surname> <given-names>W.-Y.</given-names></name> <name><surname>Marten</surname> <given-names>J.</given-names></name> <name><surname>M&#x00E9;ric</surname> <given-names>G.</given-names></name> <name><surname>Ruiz-Carmona</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>The carbon footprint of bioinformatics</article-title>. <source>Mol. Biol. Evol.</source> <volume>39</volume>:<fpage>msac034</fpage>. doi: <pub-id pub-id-type="doi">10.1093/molbev/msac034</pub-id>, PMID: <pub-id pub-id-type="pmid">35143670</pub-id></citation></ref>
<ref id="ref48"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Grover</surname> <given-names>L. K.</given-names></name></person-group> (<year>1996</year>). &#x201C;A fast quantum mechanical algorithm for database search.&#x201D; in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. pp. 212&#x2013;219. ACM.</citation></ref>
<ref id="ref49"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Guarasci</surname> <given-names>R.</given-names></name> <name><surname>De Pietro</surname> <given-names>G.</given-names></name> <name><surname>Esposito</surname> <given-names>M.</given-names></name></person-group> (<year>2022</year>). <article-title>Quantum natural language processing: challenges and opportunities</article-title>. <source>Appl. Sci.</source> <volume>12</volume>:<fpage>5651</fpage>. doi: <pub-id pub-id-type="doi">10.3390/app12115651</pub-id></citation></ref>
<ref id="ref50"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gyongyosi</surname> <given-names>L.</given-names></name> <name><surname>Imre</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>Quantum circuit design for objective function maximization in gate-model quantum computers</article-title>. <source>Quantum Inf. Process</source> <volume>18</volume>:<fpage>225</fpage>. doi: <pub-id pub-id-type="doi">10.1007/s11128-019-2326-2</pub-id></citation></ref>
<ref id="ref51"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Hansen</surname> <given-names>E.</given-names></name> <name><surname>Joshi</surname> <given-names>S.</given-names></name> <name><surname>Rarick</surname> <given-names>H.</given-names></name></person-group> (<year>2023</year>). &#x201C;Resource estimation of quantum multiplication algorithms.&#x201D; In 2023 IEEE international conference on quantum computing and engineering (QCE). pp. 199&#x2013;202. IEEE.</citation></ref>
<ref id="ref52"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Harvey</surname> <given-names>C.</given-names></name> <name><surname>Yeung</surname> <given-names>R.</given-names></name> <name><surname>Meichanetzidis</surname> <given-names>K.</given-names></name></person-group> (<year>2023</year>). Sequence processing with quantum tensor networks. arXiv preprint arXiv:2308.0786.</citation></ref>
<ref id="ref53"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hatakeyama-Sato</surname> <given-names>K.</given-names></name> <name><surname>Igarashi</surname> <given-names>Y.</given-names></name> <name><surname>Kashikawa</surname> <given-names>T.</given-names></name> <name><surname>Kimura</surname> <given-names>K.</given-names></name> <name><surname>Oyaizu</surname> <given-names>K.</given-names></name></person-group> (<year>2022</year>). <article-title>Quantum circuit learning as a potential algorithm to predict experimental chemical properties</article-title>. <source>Dig. Dis.</source> <volume>2</volume>, <fpage>165</fpage>&#x2013;<lpage>176</lpage>. doi: <pub-id pub-id-type="doi">10.1039/D2DD00090C</pub-id></citation></ref>
<ref id="ref54"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Havl&#x00ED;&#x010D;ek</surname> <given-names>V.</given-names></name> <name><surname>C&#x00F3;rcoles</surname> <given-names>A. D.</given-names></name> <name><surname>Temme</surname> <given-names>K.</given-names></name> <name><surname>Harrow</surname> <given-names>A. W.</given-names></name> <name><surname>Kandala</surname> <given-names>A.</given-names></name> <name><surname>Chow</surname> <given-names>J. M.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Supervised learning with quantum-enhanced feature spaces</article-title>. <source>Nature</source> <volume>567</volume>, <fpage>209</fpage>&#x2013;<lpage>212</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41586-019-0980-2</pub-id>, PMID: <pub-id pub-id-type="pmid">30867609</pub-id></citation></ref>
<ref id="ref55"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Herrmann</surname> <given-names>N.</given-names></name> <name><surname>Arya</surname> <given-names>D.</given-names></name> <name><surname>Doherty</surname> <given-names>M. W.</given-names></name> <name><surname>Mingare</surname> <given-names>A.</given-names></name> <name><surname>Pillay</surname> <given-names>J. C.</given-names></name> <name><surname>Preis</surname> <given-names>F.</given-names></name> <etal/></person-group>. (<year>2023</year>). &#x201C;Quantum utility &#x2013; definition and assessment of a practical quantum advantage.&#x201D; in 2023 IEEE international conference on quantum software (QSW). pp. 162&#x2013;174.</citation></ref>
<ref id="ref56"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Heshami</surname> <given-names>K.</given-names></name> <name><surname>England</surname> <given-names>D. G.</given-names></name> <name><surname>Humphreys</surname> <given-names>P. C.</given-names></name> <name><surname>Bustard</surname> <given-names>P. J.</given-names></name> <name><surname>Acosta</surname> <given-names>V. M.</given-names></name> <name><surname>Nunn</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Quantum memories: emerging applications and recent advances</article-title>. <source>J. Mod. Opt.</source> <volume>63</volume>, <fpage>2005</fpage>&#x2013;<lpage>2028</lpage>. doi: <pub-id pub-id-type="doi">10.1080/09500340.2016.1148212</pub-id>, PMID: <pub-id pub-id-type="pmid">27695198</pub-id></citation></ref>
<ref id="ref57"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hilton</surname> <given-names>C. B.</given-names></name> <name><surname>Milinovich</surname> <given-names>A.</given-names></name> <name><surname>Felix</surname> <given-names>C.</given-names></name></person-group> (<year>2020</year>). <article-title>Personalized predictions of patient outcomes during and after hospitalization using artificial intelligence</article-title>. <source>NPJ Digit. Med.</source> <volume>3</volume>:<fpage>51</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41746-020-0249-z</pub-id>, PMID: <pub-id pub-id-type="pmid">32285012</pub-id></citation></ref>
<ref id="ref58"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Hong</surname> <given-names>Z.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Qu</surname> <given-names>X.</given-names></name> <name><surname>Zhu</surname> <given-names>X.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Xiao</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). &#x201C;Quantum convolutional neural network on protein distance prediction.&#x201D; in 2021 International Joint Conference on Neural Networks (IJCNN). pp. 1&#x2013;8. IEEE.</citation></ref>
<ref id="ref59"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>T.</given-names></name> <name><surname>Zeng</surname> <given-names>Z.</given-names></name> <name><surname>Shi</surname> <given-names>H.</given-names></name> <name><surname>Wu</surname> <given-names>Y.</given-names></name> <name><surname>Hong</surname> <given-names>Z.</given-names></name></person-group> (<year>2015</year>). <article-title>Survey of natural language processing techniques in bioinformatics</article-title>. <source>Comput. Math. Methods Med.</source> <volume>2015</volume>:<fpage>674296</fpage>. doi: <pub-id pub-id-type="doi">10.1155/2015/674296</pub-id>, PMID: <pub-id pub-id-type="pmid">26525745</pub-id></citation></ref>
<ref id="ref60"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Ibtehaz</surname> <given-names>N.</given-names></name> <name><surname>Kihara</surname> <given-names>D.</given-names></name></person-group> (<year>2023</year>). &#x201C;Application of sequence embedding in protein sequence-based predictions.&#x201D; in Machine learning in bioinformatics of protein sequences: Algorithms, databases and resources for modern protein bioinformatics. pp. 31&#x2013;55.</citation></ref>
<ref id="ref61"><citation citation-type="other"><person-group person-group-type="author"><collab id="coll2">IonQ</collab></person-group> (<year>2021</year>). Biogen and IonQ partner to apply quantum computing to accelerate drug discovery. IonQ. Available at: <ext-link xlink:href="https://ionq.com/posts/2021-11-16-biogen-and-ionq-partner" ext-link-type="uri">https://ionq.com/posts/2021-11-16-biogen-and-ionq-partner</ext-link> (Accessed June 24, 2022).</citation></ref>
<ref id="ref62"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Jayanth</surname> <given-names>K. K.</given-names></name> <name><surname>Mohan</surname> <given-names>G. B.</given-names></name> <name><surname>Kumar</surname> <given-names>R. P.</given-names></name></person-group> (<year>2023</year>). &#x201C;Indian language analysis with XLM-RoBERTa: enhancing parts of speech tagging for effective natural language preprocessing.&#x201D; in 2023 seventh international conference on image information processing (ICIIP). pp. 850&#x2013;854. IEEE.</citation></ref>
<ref id="ref63"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Jim&#x00E9;nez L&#x00F3;pez</surname> <given-names>M. D.</given-names></name></person-group> (<year>2022</year>). &#x201C;<article-title>Processing natural language with biomolecules: Where linguistics, biology and computation meet</article-title>&#x201D; in <source>Revolutions and revelations in computability. CiE 2022. Lecture notes in computer science</source>. eds. <person-group person-group-type="editor"><name><surname>Berger</surname> <given-names>U.</given-names></name> <name><surname>Franklin</surname> <given-names>J. N. Y.</given-names></name> <name><surname>Manea</surname> <given-names>F.</given-names></name> <name><surname>Pauly</surname> <given-names>A.</given-names></name></person-group>, vol. <volume>13359</volume> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>).</citation></ref>
<ref id="ref64"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jumper</surname> <given-names>J.</given-names></name> <name><surname>Evans</surname> <given-names>R.</given-names></name> <name><surname>Pritzel</surname> <given-names>A.</given-names></name> <name><surname>Green</surname> <given-names>T.</given-names></name> <name><surname>Figurnov</surname> <given-names>M.</given-names></name> <name><surname>Ronneberger</surname> <given-names>O.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Highly accurate protein structure prediction with AlphaFold</article-title>. <source>Nature</source> <volume>596</volume>, <fpage>583</fpage>&#x2013;<lpage>589</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41586-021-03819-2</pub-id>, PMID: <pub-id pub-id-type="pmid">34265844</pub-id></citation></ref>
<ref id="ref65"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kang</surname> <given-names>C.</given-names></name> <name><surname>Huo</surname> <given-names>Y.</given-names></name> <name><surname>Xin</surname> <given-names>L.</given-names></name> <name><surname>Tian</surname> <given-names>B.</given-names></name> <name><surname>Yu</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). <article-title>Feature selection and tumor classification for microarray data using relaxed lasso and generalized multi-class support vector machine</article-title>. <source>J. Theor. Biol.</source> <volume>463</volume>, <fpage>77</fpage>&#x2013;<lpage>91</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jtbi.2018.12.010</pub-id>, PMID: <pub-id pub-id-type="pmid">30537483</pub-id></citation></ref>
<ref id="ref66"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Karamlou</surname> <given-names>A.</given-names></name> <name><surname>Pfaffhauser</surname> <given-names>M.</given-names></name> <name><surname>Wootton</surname> <given-names>J.</given-names></name></person-group> (<year>2022</year>). Quantum natural language generation on near-term devices. arXiv arXiv:2211.00727 [Preprint].</citation></ref>
<ref id="ref67"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Karetla</surname> <given-names>G. R.</given-names></name> <name><surname>Catchpoole</surname> <given-names>D.</given-names></name> <name><surname>Nguyen</surname> <given-names>Q. V.</given-names></name></person-group> (<year>2023</year>). &#x201C;<article-title>Hybrid framework for genomic data classification using deep learning: QDeep_SVM</article-title>&#x201D; in <source>Machine intelligence and data science applications: Proceedings of MIDAS 2022</source>. eds. <person-group person-group-type="editor"><name><surname>Ramdane-Cherif</surname> <given-names>A.</given-names></name> <name><surname>Singh</surname> <given-names>T. P.</given-names></name> <name><surname>Tomar</surname> <given-names>R.</given-names></name> <name><surname>Choudhury</surname> <given-names>T.</given-names></name> <name><surname>Um</surname> <given-names>J. S.</given-names></name></person-group> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>451</fpage>&#x2013;<lpage>463</lpage>.</citation></ref>
<ref id="ref68"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Khan</surname> <given-names>M. R. I.</given-names></name> <name><surname>Shahriar</surname> <given-names>S.</given-names></name> <name><surname>Rafid</surname> <given-names>S. F.</given-names></name></person-group> (<year>2023</year>). A linear time quantum algorithm for pairwise sequence alignment. arXiv. arXiv:2307.04479 [Preprint].</citation></ref>
<ref id="ref69"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khurana</surname> <given-names>D.</given-names></name> <name><surname>Koli</surname> <given-names>A.</given-names></name> <name><surname>Khatter</surname> <given-names>K.</given-names></name> <name><surname>Singh</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Natural language processing: state of the art, current trends and challenges</article-title>. <source>Multimed. Tools Appl.</source> <volume>82</volume>, <fpage>3713</fpage>&#x2013;<lpage>3744</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s11042-022-13428-4</pub-id>, PMID: <pub-id pub-id-type="pmid">35855771</pub-id></citation></ref>
<ref id="ref70"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kim</surname> <given-names>Y.</given-names></name> <name><surname>Wood</surname> <given-names>C. J.</given-names></name> <name><surname>Yoder</surname> <given-names>T. J.</given-names></name> <name><surname>Merkel</surname> <given-names>S. T.</given-names></name> <name><surname>Gambetta</surname> <given-names>J. M.</given-names></name> <name><surname>Temme</surname> <given-names>K.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Scalable error mitigation for noisy quantum circuits produces competitive expectation values</article-title>. <source>Nat. Phys.</source> <volume>19</volume>, <fpage>752</fpage>&#x2013;<lpage>759</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41567-023-02225-9</pub-id></citation></ref>
<ref id="ref71"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Kirubakaran</surname> <given-names>A. P.</given-names></name> <name><surname>Midhunchakkaravarthy</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). &#x201C;<article-title>A hybrid application of quantum computing methodologies to AI techniques for paddy crop leaf disease identification</article-title>&#x201D; in <source>Integrating blockchain and artificial intelligence for industry 4.0 innovations</source>. eds. <person-group person-group-type="editor"><name><surname>Goundar</surname> <given-names>S.</given-names></name> <name><surname>Anandan</surname> <given-names>R.</given-names></name></person-group> (New York: <publisher-name>Springer</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>12</lpage>.</citation></ref>
<ref id="ref72"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Klimov</surname> <given-names>P. V.</given-names></name> <name><surname>Bengtsson</surname> <given-names>A.</given-names></name> <name><surname>Quintana</surname> <given-names>C.</given-names></name> <name><surname>Bourassa</surname> <given-names>A.</given-names></name> <name><surname>Hong</surname> <given-names>S.</given-names></name> <name><surname>Dunsworth</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2024</year>). <article-title>Optimizing quantum gates towards the scale of logical qubits</article-title>. <source>Nat. Commun.</source> <volume>15</volume>:<fpage>2442</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41467-024-46623-y</pub-id>, PMID: <pub-id pub-id-type="pmid">38499541</pub-id></citation></ref>
<ref id="ref73"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>K&#x00F6;soglu-Kind</surname> <given-names>B.</given-names></name> <name><surname>Loredo</surname> <given-names>R.</given-names></name> <name><surname>Grossi</surname> <given-names>M.</given-names></name> <name><surname>Bernecker</surname> <given-names>C.</given-names></name> <name><surname>Burks</surname> <given-names>J. M.</given-names></name> <name><surname>Buchkremer</surname> <given-names>R.</given-names></name></person-group> (<year>2023</year>). <article-title>A biological sequence comparison algorithm using quantum computers</article-title>. <source>Sci. Rep.</source> <volume>13</volume>:<fpage>14552</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-023-41086-5</pub-id>, PMID: <pub-id pub-id-type="pmid">37666875</pub-id></citation></ref>
<ref id="ref74"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kryshtafovych</surname> <given-names>A.</given-names></name> <name><surname>Fidelis</surname> <given-names>K.</given-names></name></person-group> (<year>2009</year>). <article-title>Protein structure prediction and model quality assessment</article-title>. <source>Drug Discov. Today</source> <volume>14</volume>, <fpage>386</fpage>&#x2013;<lpage>393</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.drudis.2008.11.010</pub-id>, PMID: <pub-id pub-id-type="pmid">19100336</pub-id></citation></ref>
<ref id="ref75"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>P.</given-names></name> <name><surname>Paul</surname> <given-names>R. K.</given-names></name> <name><surname>Roy</surname> <given-names>H. S.</given-names></name> <name><surname>Yeasin</surname> <given-names>M.</given-names></name> <name><surname>Ajit</surname></name> <name><surname>Paul</surname> <given-names>A. K.</given-names></name></person-group> (<year>2024</year>). <article-title>Big data analysis in computational biology and bioinformatics</article-title>. <source>Methods Mol. Biol.</source> <volume>2719</volume>, <fpage>181</fpage>&#x2013;<lpage>197</lpage>. doi: <pub-id pub-id-type="doi">10.1007/978-1-0716-3461-5_11</pub-id>, PMID: <pub-id pub-id-type="pmid">37803119</pub-id></citation></ref>
<ref id="ref76"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kundu</surname> <given-names>D.</given-names></name> <name><surname>Ghosh</surname> <given-names>A.</given-names></name> <name><surname>Ekambaram</surname> <given-names>S.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Dokholyan</surname> <given-names>N.</given-names></name> <name><surname>Ghosh</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>Application of quantum tensor networks for protein classification</article-title>. <source>bioRxiv</source>, <fpage>2024</fpage>&#x2013;<lpage>2003</lpage>. doi: <pub-id pub-id-type="doi">10.1101/2024.03</pub-id></citation></ref>
<ref id="ref77"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lannelongue</surname> <given-names>L.</given-names></name> <name><surname>Bateman</surname> <given-names>A.</given-names></name> <name><surname>Birney</surname> <given-names>E.</given-names></name> <name><surname>Juckes</surname> <given-names>M.</given-names></name> <name><surname>McEntyre</surname> <given-names>J.</given-names></name> <name><surname>Reilly</surname> <given-names>G.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>GREENER principles for environmentally sustainable computational science</article-title>. <source>Nat. Comp. Sci.</source> <volume>3</volume>, <fpage>514</fpage>&#x2013;<lpage>521</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s43588-023-00461-y</pub-id>, PMID: <pub-id pub-id-type="pmid">38177425</pub-id></citation></ref>
<ref id="ref78"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Leurs</surname> <given-names>K.</given-names></name></person-group> (<year>2022</year>). Design and implementation of a quantum kernel for natural language processing. arXiv.</citation></ref>
<ref id="ref79"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>R. Y.</given-names></name> <name><surname>Di Felice</surname> <given-names>R.</given-names></name> <name><surname>Rohs</surname> <given-names>R.</given-names></name> <name><surname>Lidar</surname> <given-names>D. A.</given-names></name></person-group> (<year>2018</year>). <article-title>Quantum annealing versus classical machine learning applied to a simplified computational biology problem</article-title>. <source>NPJ Quantum Inform.</source> <volume>4</volume>:<fpage>14</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41534-018-0060-8</pub-id>, PMID: <pub-id pub-id-type="pmid">29652405</pub-id></citation></ref>
<ref id="ref80"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>F.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Guan</surname> <given-names>J.</given-names></name> <name><surname>Zhou</surname> <given-names>S.</given-names></name></person-group> (<year>2022</year>). <article-title>Effective drug&#x2013;target interaction prediction with mutual interaction neural network</article-title>. <source>Bioinformatics</source> <volume>38</volume>, <fpage>3582</fpage>&#x2013;<lpage>3589</lpage>. doi: <pub-id pub-id-type="doi">10.1093/bioinformatics/btac377</pub-id>, PMID: <pub-id pub-id-type="pmid">35652721</pub-id></citation></ref>
<ref id="ref81"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Liang</surname> <given-names>Z.</given-names></name> <name><surname>Cheng</surname> <given-names>J.</given-names></name> <name><surname>Yang</surname> <given-names>R.</given-names></name> <name><surname>Ren</surname> <given-names>H.</given-names></name> <name><surname>Song</surname> <given-names>Z.</given-names></name> <name><surname>Wu</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Unleashing the potential of LLMs for quantum computing: A study in quantum architecture design</article-title>. <source>arXiv</source>:<fpage>arXiv:2307.08191</fpage> [Preprint].</citation></ref>
<ref id="ref82"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>J. G.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name></person-group> (<year>2018</year>). <article-title>Differentiable learning of quantum circuit born machines</article-title>. <source>Phys. Rev. A</source> <volume>98</volume>:<fpage>062324</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevA.98.062324</pub-id></citation></ref>
<ref id="ref83"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>T.</given-names></name> <name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). &#x201C;Research on distributional compositional categorical model in both classical and quantum natural language processing.&#x201D; in Proceedings of the SNPD 2024. pp. 1&#x2013;6.</citation></ref>
<ref id="ref84"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Yang</surname> <given-names>M.</given-names></name> <name><surname>Yu</surname> <given-names>Y.</given-names></name> <name><surname>Xu</surname> <given-names>H.</given-names></name> <name><surname>Li</surname> <given-names>K.</given-names></name> <name><surname>Zhou</surname> <given-names>X.</given-names></name></person-group> (<year>2024</year>). Large language models in bioinformatics: Applications and perspectives. ArXiv.</citation></ref>
<ref id="ref85"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>W.</given-names></name> <name><surname>Zhao</surname> <given-names>J.</given-names></name> <name><surname>Du</surname> <given-names>L.</given-names></name> <name><surname>Padwal</surname> <given-names>H. H.</given-names></name> <name><surname>Vadivel</surname> <given-names>T.</given-names></name></person-group> (<year>2021</year>). <article-title>Intelligent comprehensive evaluation system using artificial intelligence for environmental evaluation</article-title>. <source>Environ. Impact Assess. Rev.</source> <volume>86</volume>:<fpage>106495</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eiar.2020.106495</pub-id></citation></ref>
<ref id="ref86"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Locke</surname> <given-names>S.</given-names></name> <name><surname>Bashall</surname> <given-names>A.</given-names></name> <name><surname>Al-Adely</surname> <given-names>S.</given-names></name> <name><surname>Moore</surname> <given-names>J.</given-names></name> <name><surname>Wilson</surname> <given-names>A.</given-names></name> <name><surname>Kitchen</surname> <given-names>G. B.</given-names></name></person-group> (<year>2021</year>). <article-title>Natural language processing in medicine: A review</article-title>. <source>Trends Anaesthesia Crit. Care</source> <volume>38</volume>, <fpage>4</fpage>&#x2013;<lpage>9</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.tacc.2021.02.007</pub-id></citation></ref>
<ref id="ref87"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lubinski</surname> <given-names>T.</given-names></name> <name><surname>Johri</surname> <given-names>S.</given-names></name> <name><surname>Varosy</surname> <given-names>P.</given-names></name> <name><surname>Coleman</surname> <given-names>J.</given-names></name> <name><surname>Zhao</surname> <given-names>L.</given-names></name> <name><surname>Necaise</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Application-oriented performance benchmarks for quantum computing</article-title>. <source>IEEE Trans. Quant. Eng.</source> <volume>4</volume>, <fpage>1</fpage>&#x2013;<lpage>32</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TQE.2023.3253761</pub-id>, PMID: <pub-id pub-id-type="pmid">39573497</pub-id></citation></ref>
<ref id="ref88"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Madsen</surname> <given-names>S.</given-names></name> <name><surname>Marqversen</surname> <given-names>F.</given-names></name> <name><surname>Rasmussen</surname> <given-names>S.</given-names></name> <name><surname>Zinner</surname> <given-names>N.</given-names></name></person-group> (<year>2023</year>). Multi-sequence alignment using the quantum approximate optimization algorithm. arXiv preprint arXiv:2308.12103.</citation></ref>
<ref id="ref89"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Magann</surname> <given-names>A. B.</given-names></name> <name><surname>Grace</surname> <given-names>M. D.</given-names></name> <name><surname>Rabitz</surname> <given-names>H. A.</given-names></name> <name><surname>Sarovar</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>Digital quantum simulation of molecular dynamics and control</article-title>. <source>Phys. Rev. Res.</source> <volume>3</volume>:<fpage>023165</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevResearch.3.023165</pub-id></citation></ref>
<ref id="ref90"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Maheshwari</surname> <given-names>D.</given-names></name> <name><surname>Garcia-Zapirain</surname> <given-names>B.</given-names></name> <name><surname>Sierra-Sosa</surname> <given-names>D.</given-names></name></person-group> (<year>2022</year>). <article-title>Quantum machine learning applications in the biomedical domain: A systematic review</article-title>. <source>IEEE Access</source> <volume>10</volume>, <fpage>80463</fpage>&#x2013;<lpage>80484</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3195044</pub-id>, PMID: <pub-id pub-id-type="pmid">39573497</pub-id></citation></ref>
<ref id="ref91"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Marchetti</surname> <given-names>L.</given-names></name> <name><surname>Nifos&#x00EC;</surname> <given-names>R.</given-names></name> <name><surname>Martelli</surname> <given-names>P. L.</given-names></name> <name><surname>Da Pozzo</surname> <given-names>E.</given-names></name> <name><surname>Cappello</surname> <given-names>V.</given-names></name> <name><surname>Banterle</surname> <given-names>F.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Quantum computing algorithms: getting closer to critical problems in computational biology</article-title>. <source>Brief. Bioinform.</source> <volume>23</volume>:<fpage>bbac437</fpage>. doi: <pub-id pub-id-type="doi">10.1093/bib/bbac437</pub-id>, PMID: <pub-id pub-id-type="pmid">36220772</pub-id></citation></ref>
<ref id="ref92"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Martinez</surname> <given-names>V.</given-names></name> <name><surname>Leroy-Meline</surname> <given-names>G.</given-names></name></person-group> (<year>2022</year>). <article-title>A multiclass Q-NLP sentiment analysis experiment using DisCoCat</article-title>. <source>arXiv</source>:<fpage>arXiv:2209.03152</fpage>. [Preprint].</citation></ref>
<ref id="ref93"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Mensa</surname> <given-names>S.</given-names></name> <name><surname>&#x015E;ahin</surname> <given-names>M. E.</given-names></name> <name><surname>Tacchino</surname> <given-names>F.</given-names></name> <name><surname>Barkoutsos</surname> <given-names>P.</given-names></name> <name><surname>Tavernelli</surname> <given-names>I.</given-names></name></person-group> (<year>2022</year>). Quantum machine learning framework for virtual screening in drug discovery: A prospective quantum advantage. arXiv.</citation></ref>
<ref id="ref94"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Miranda</surname> <given-names>E. R.</given-names></name> <name><surname>Yeung</surname> <given-names>R.</given-names></name> <name><surname>Pearson</surname> <given-names>A.</given-names></name> <name><surname>Meichanetzidis</surname> <given-names>K.</given-names></name> <name><surname>Coecke</surname> <given-names>B.</given-names></name></person-group> (<year>2022</year>). &#x201C;<article-title>A quantum natural language processing approach to musical intelligence</article-title>&#x201D; in <source>Quantum computer music: Foundations, methods and advanced concepts</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>), <fpage>313</fpage>&#x2013;<lpage>356</lpage>.</citation></ref>
<ref id="ref95"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohammed</surname> <given-names>M.</given-names></name> <name><surname>Al-Dabbagh</surname> <given-names>N.</given-names></name> <name><surname>Salim</surname> <given-names>N.</given-names></name> <name><surname>Mubarak</surname> <given-names>H.</given-names></name> <name><surname>Ali</surname> <given-names>A.</given-names></name> <name><surname>Saeed</surname> <given-names>F.</given-names></name></person-group> (<year>2017</year>). <article-title>Quantum probability ranking principle for ligand-based virtual screening</article-title>. <source>J. Comput. Aided Mol. Des.</source> <volume>31</volume>, <fpage>365</fpage>&#x2013;<lpage>378</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s10822-016-0003-4</pub-id>, PMID: <pub-id pub-id-type="pmid">28220440</pub-id></citation></ref>
<ref id="ref96"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mokhtari</surname> <given-names>M.</given-names></name> <name><surname>Khoshbakht</surname> <given-names>S.</given-names></name> <name><surname>Ziyaei</surname> <given-names>K.</given-names></name> <name><surname>Akbari</surname> <given-names>M. E.</given-names></name> <name><surname>Moravveji</surname> <given-names>S. S.</given-names></name></person-group> (<year>2024</year>). <article-title>New classifications for quantum bioinformatics: Q-bioinformatics, QCt-bioinformatics, QCg-bioinformatics, and QCr-bioinformatics</article-title>. <source>Brief. Bioinform.</source> <volume>25</volume>:<fpage>bbae074</fpage>. doi: <pub-id pub-id-type="doi">10.1093/bib/bbae074</pub-id>, PMID: <pub-id pub-id-type="pmid">38446742</pub-id></citation></ref>
<ref id="ref97"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Na&#x0142;&#x0119;cz-Charkiewicz</surname> <given-names>K.</given-names></name> <name><surname>Charkiewicz</surname> <given-names>K.</given-names></name> <name><surname>Nowak</surname> <given-names>R. M.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum computing in bioinformatics: A systematic review mapping</article-title>. <source>Brief. Bioinform.</source> <volume>25</volume>:<fpage>bbae391</fpage>. doi: <pub-id pub-id-type="doi">10.1093/bib/bbae391</pub-id>, PMID: <pub-id pub-id-type="pmid">39140856</pub-id></citation></ref>
<ref id="ref98"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nam</surname> <given-names>V.</given-names></name> <name><surname>Nguyen</surname></name></person-group>. (<year>2024</year>). <article-title>Quantum word embedding for machine learning</article-title>. <source>Phys. Scr.</source> <volume>99</volume>:<fpage>086004</fpage>. doi: <pub-id pub-id-type="doi">10.1088/1402-4896/ad6299</pub-id>, PMID: <pub-id pub-id-type="pmid">39612690</pub-id></citation></ref>
<ref id="ref99"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Nammouchi</surname> <given-names>A.</given-names></name> <name><surname>Kassler</surname> <given-names>A.</given-names></name> <name><surname>Theorachis</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). Quantum machine learning in climate change and sustainability: A review. arXiv arXiv:2310.09162 [Preprint].</citation></ref>
<ref id="ref100"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nathans</surname> <given-names>J.</given-names></name> <name><surname>Sterling</surname> <given-names>P.</given-names></name></person-group> (<year>2016</year>). <article-title>How scientists can reduce their carbon footprint</article-title>. <source>eLife</source> <volume>5</volume>:<fpage>e15928</fpage>. doi: <pub-id pub-id-type="doi">10.7554/eLife.15928</pub-id>, PMID: <pub-id pub-id-type="pmid">27029962</pub-id></citation></ref>
<ref id="ref101"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Navneet</surname> <given-names>S.</given-names></name> <name><surname>Pokhrel</surname> <given-names>S. R.</given-names></name></person-group> (<year>2024</year>). An independent implementation of quantum machine learning algorithms in Qiskit for genomic data. arXiv preprint arXiv:2405.09781.</citation></ref>
<ref id="ref102"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nayak</surname> <given-names>C.</given-names></name> <name><surname>Simon</surname> <given-names>S. H.</given-names></name> <name><surname>Stern</surname> <given-names>A.</given-names></name> <name><surname>Freedman</surname> <given-names>M.</given-names></name> <name><surname>Das Sarma</surname> <given-names>S.</given-names></name></person-group> (<year>2008</year>). <article-title>Non-abelian anyons and topological quantum computation</article-title>. <source>Rev. Mod. Phys.</source> <volume>80</volume>, <fpage>1083</fpage>&#x2013;<lpage>1159</lpage>. doi: <pub-id pub-id-type="doi">10.1103/RevModPhys.80.1083</pub-id></citation></ref>
<ref id="ref103"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Neveu</surname> <given-names>E.</given-names></name> <name><surname>Popov</surname> <given-names>P.</given-names></name> <name><surname>Hoffmann</surname> <given-names>A.</given-names></name> <name><surname>Migliosi</surname> <given-names>A.</given-names></name> <name><surname>Besseron</surname> <given-names>X.</given-names></name> <name><surname>Danoy</surname> <given-names>G.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>RapidRMSD: rapid determination of RMSDs corresponding to motions of flexible molecules</article-title>. <source>Bioinformatics</source> <volume>34</volume>, <fpage>2757</fpage>&#x2013;<lpage>2765</lpage>. doi: <pub-id pub-id-type="doi">10.1093/bioinformatics/bty160</pub-id>, PMID: <pub-id pub-id-type="pmid">29554205</pub-id></citation></ref>
<ref id="ref104"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ng</surname> <given-names>G. Y. L.</given-names></name> <name><surname>Tan</surname> <given-names>S. C.</given-names></name> <name><surname>Ong</surname> <given-names>C. S.</given-names></name></person-group> (<year>2023</year>). <article-title>On the use of QDE-SVM for gene feature selection and cell type classification from scRNA-seq data</article-title>. <source>PLoS One</source> <volume>18</volume>:<fpage>e0292961</fpage>. doi: <pub-id pub-id-type="doi">10.1371/journal.pone.0292961</pub-id>, PMID: <pub-id pub-id-type="pmid">37856458</pub-id></citation></ref>
<ref id="ref105"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nunn</surname> <given-names>A.</given-names></name> <name><surname>Otto</surname> <given-names>C.</given-names></name> <name><surname>Stadler</surname> <given-names>P.</given-names></name> <name><surname>Langenberger</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>Comprehensive benchmarking of software for mapping whole genome bisulfite data: from read alignment to DNA methylation analysis</article-title>. <source>Brief. Bioinform.</source> <volume>22</volume>:<fpage>21</fpage>. doi: <pub-id pub-id-type="doi">10.1093/bib/bbab021</pub-id>, PMID: <pub-id pub-id-type="pmid">33624017</pub-id></citation></ref>
<ref id="ref106"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ofer</surname> <given-names>D.</given-names></name> <name><surname>Brandes</surname> <given-names>N.</given-names></name> <name><surname>Linial</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>The language of proteins: NLP, machine learning &#x0026; protein sequences</article-title>. <source>Comput. Struct. Biotechnol. J.</source> <volume>19</volume>, <fpage>1750</fpage>&#x2013;<lpage>1758</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.csbj.2021.03.022</pub-id>, PMID: <pub-id pub-id-type="pmid">33897979</pub-id></citation></ref>
<ref id="ref107"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ohno-Machado</surname> <given-names>L.</given-names></name> <name><surname>Nadkarni</surname> <given-names>P.</given-names></name> <name><surname>Johnson</surname> <given-names>K.</given-names></name></person-group> (<year>2013</year>). <article-title>Natural language processing: algorithms and tools to extract computable information from EHRs and from the biomedical literature</article-title>. <source>J. Am. Med. Inform. Assoc.</source> <volume>20</volume>:<fpage>805</fpage>. doi: <pub-id pub-id-type="doi">10.1136/amiajnl-2013-002214</pub-id>, PMID: <pub-id pub-id-type="pmid">23935077</pub-id></citation></ref>
<ref id="ref108"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Olechnovi&#x010D;</surname> <given-names>K.</given-names></name> <name><surname>Monastyrskyy</surname> <given-names>B.</given-names></name> <name><surname>Kryshtafovych</surname> <given-names>A.</given-names></name> <name><surname>Venclovas</surname> <given-names>&#x010C;.</given-names></name></person-group> (<year>2019</year>). <article-title>Comparative analysis of methods for evaluation of protein models against native structures</article-title>. <source>Bioinformatics</source> <volume>35</volume>, <fpage>937</fpage>&#x2013;<lpage>944</lpage>. doi: <pub-id pub-id-type="doi">10.1093/bioinformatics/bty760</pub-id>, PMID: <pub-id pub-id-type="pmid">30169622</pub-id></citation></ref>
<ref id="ref109"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Onodera</surname> <given-names>W.</given-names></name> <name><surname>Hara</surname> <given-names>N.</given-names></name> <name><surname>Aoki</surname> <given-names>S.</given-names></name> <name><surname>Asahi</surname> <given-names>T.</given-names></name> <name><surname>Sawamura</surname> <given-names>N.</given-names></name></person-group> (<year>2023</year>). <article-title>Phylogenetic tree reconstruction via graph cut presented using a quantum-inspired computer</article-title>. <source>Mol. Phylogenet. Evol.</source> <volume>178</volume>:<fpage>107636</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.ympev.2022.107636</pub-id>, PMID: <pub-id pub-id-type="pmid">36208695</pub-id></citation></ref>
<ref id="ref110"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Outeiral</surname> <given-names>C.</given-names></name> <name><surname>Strahm</surname> <given-names>M.</given-names></name> <name><surname>Shi</surname> <given-names>J.</given-names></name> <name><surname>Morris</surname> <given-names>G. M.</given-names></name> <name><surname>Benjamin</surname> <given-names>S. C.</given-names></name> <name><surname>Deane</surname> <given-names>C. M.</given-names></name></person-group> (<year>2021</year>). <article-title>The prospects of quantum computing in computational molecular biology</article-title>. <source>Wiley Interdiscip. Rev. Comp. Molecul. Sci.</source> <volume>11</volume>:<fpage>e1481</fpage>. doi: <pub-id pub-id-type="doi">10.1002/wcms.1481</pub-id>, PMID: <pub-id pub-id-type="pmid">39854125</pub-id></citation></ref>
<ref id="ref111"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pal</surname> <given-names>S.</given-names></name> <name><surname>Bhattacharya</surname> <given-names>M.</given-names></name> <name><surname>Lee</surname> <given-names>S. S.</given-names></name> <name><surname>Chakraborty</surname> <given-names>C.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum computing in the next-generation computational biology landscape: from protein folding to molecular dynamics</article-title>. <source>Mol. Biotechnol.</source> <volume>66</volume>, <fpage>163</fpage>&#x2013;<lpage>178</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s12033-023-00765-4</pub-id>, PMID: <pub-id pub-id-type="pmid">37244882</pub-id></citation></ref>
<ref id="ref112"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Patel</surname> <given-names>H. B.</given-names></name> <name><surname>Mishra</surname> <given-names>S.</given-names></name> <name><surname>Jain</surname> <given-names>R.</given-names></name> <name><surname>Kansara</surname> <given-names>N.</given-names></name></person-group> (<year>2023</year>). <article-title>The future of quantum computing and its potential applications</article-title>. <source>J. Basic Sci.</source> <volume>23</volume>, <fpage>513</fpage>&#x2013;<lpage>519</lpage>.</citation></ref>
<ref id="ref113"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Patti</surname> <given-names>T. L.</given-names></name> <name><surname>Kossaifi</surname> <given-names>J.</given-names></name> <name><surname>Anandkumar</surname> <given-names>A.</given-names></name> <name><surname>Yelin</surname> <given-names>S. F.</given-names></name></person-group> (<year>2022</year>). <article-title>Variational quantum optimization with multibasis encodings</article-title>. <source>Phys. Rev. Res.</source> <volume>4</volume>:<fpage>033142</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevResearch.4.033142</pub-id></citation></ref>
<ref id="ref114"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pecina</surname> <given-names>A.</given-names></name> <name><surname>Eyrilmez</surname> <given-names>S. M.</given-names></name> <name><surname>K&#x00F6;pr&#x00FC;l&#x00FC;o&#x011F;lu</surname> <given-names>C.</given-names></name> <name><surname>Miriyala</surname> <given-names>V. M.</given-names></name> <name><surname>Lep&#x0161;&#x00ED;k</surname> <given-names>M.</given-names></name> <name><surname>Fanfrl&#x00ED;k</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>SQM/COSMO scoring function: reliable quantum-mechanical tool for sampling and ranking in structure-based drug design</article-title>. <source>ChemPlusChem</source> <volume>85</volume>, <fpage>2362</fpage>&#x2013;<lpage>2371</lpage>. doi: <pub-id pub-id-type="doi">10.1002/cplu.202000120</pub-id>, PMID: <pub-id pub-id-type="pmid">32609421</pub-id></citation></ref>
<ref id="ref115"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Perdomo-Ortiz</surname> <given-names>A.</given-names></name> <name><surname>Dickson</surname> <given-names>N.</given-names></name> <name><surname>Drew-Brook</surname> <given-names>M.</given-names></name> <name><surname>Rose</surname> <given-names>G.</given-names></name> <name><surname>Aspuru-Guzik</surname> <given-names>A.</given-names></name></person-group> (<year>2012</year>). <article-title>Finding low-energy conformations of lattice protein models by quantum annealing</article-title>. <source>Sci. Rep.</source> <volume>2</volume>:<fpage>571</fpage>. doi: <pub-id pub-id-type="doi">10.1038/srep00571</pub-id>, PMID: <pub-id pub-id-type="pmid">22891157</pub-id></citation></ref>
<ref id="ref116"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Perrier</surname> <given-names>E.</given-names></name> <name><surname>Youssry</surname> <given-names>A.</given-names></name> <name><surname>Ferrie</surname> <given-names>C.</given-names></name></person-group> (<year>2022</year>). <article-title>QDataSet, quantum datasets for machine learning</article-title>. <source>Sci. Data</source> <volume>9</volume>:<fpage>582</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41597-022-01639-1</pub-id></citation></ref>
<ref id="ref117"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Piattini</surname> <given-names>M.</given-names></name> <name><surname>Peterssen Nodarse</surname> <given-names>G.</given-names></name> <name><surname>P&#x00E9;rez-Castillo</surname> <given-names>R.</given-names></name></person-group> (<year>2020</year>). <article-title>Quantum computing: A new software engineering golden age</article-title>. <source>ACM SIGSOFT Softw. Eng. Notes</source> <volume>45</volume>, <fpage>12</fpage>&#x2013;<lpage>14</lpage>. doi: <pub-id pub-id-type="doi">10.1145/3402127.3402131</pub-id></citation></ref>
<ref id="ref118"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Poleksic</surname> <given-names>A.</given-names></name></person-group> (<year>2015</year>). <article-title>A polynomial time algorithm for computing the area under a GDT curve</article-title>. <source>Algor. Molecul. Biol.</source> <volume>10</volume>:<fpage>27</fpage>. doi: <pub-id pub-id-type="doi">10.1186/s13015-015-0058-0</pub-id>, PMID: <pub-id pub-id-type="pmid">26504491</pub-id></citation></ref>
<ref id="ref119"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Portugal</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). Basic quantum algorithms. arXiv arXiv:2201.10574 [Preprint].</citation></ref>
<ref id="ref120"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Prasad</surname> <given-names>S. J. S.</given-names></name> <name><surname>Suji Usharani</surname> <given-names>R.</given-names></name> <name><surname>Sheryal</surname> <given-names>Oliver A.</given-names></name> <name><surname>Sharma</surname> <given-names>D.</given-names></name> <name><surname>Sureshkumar</surname> <given-names>M.</given-names></name> <name><surname>Bansod</surname> <given-names>P.</given-names></name></person-group> (<year>2024</year>). Quantum computing-powered agricultural transformation: optimizing performance in farming.</citation></ref>
<ref id="ref121"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Preskill</surname> <given-names>J.</given-names></name></person-group> (<year>2018</year>). <article-title>Quantum computing in the NISQ era and beyond</article-title>. <source>Quantum</source> <volume>2</volume>:<fpage>79</fpage>. doi: <pub-id pub-id-type="doi">10.22331/q-2018-08-06-79</pub-id></citation></ref>
<ref id="ref122"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prousalis</surname> <given-names>K.</given-names></name> <name><surname>Konofaos</surname> <given-names>N.</given-names></name></person-group> (<year>2019</year>). <article-title>A quantum pattern recognition method for improving pairwise sequence alignment</article-title>. <source>Sci. Rep.</source> <volume>9</volume>:<fpage>7226</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-019-43697-3</pub-id>, PMID: <pub-id pub-id-type="pmid">31076611</pub-id></citation></ref>
<ref id="ref123"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pseiner</surname> <given-names>J.</given-names></name> <name><surname>Erhard</surname> <given-names>M.</given-names></name> <name><surname>Krenn</surname> <given-names>M.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum interference between distant creation processes</article-title>. <source>Phys. Rev. Res.</source> <volume>6</volume>:<fpage>013294</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevResearch.6.013294</pub-id></citation></ref>
<ref id="ref124"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pudenz</surname> <given-names>K. L.</given-names></name> <name><surname>Lidar</surname> <given-names>D. A.</given-names></name></person-group> (<year>2013</year>). <article-title>Quantum adiabatic machine learning</article-title>. <source>Quantum Inf. Process</source> <volume>12</volume>, <fpage>2027</fpage>&#x2013;<lpage>2070</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s11128-012-0506-4</pub-id>, PMID: <pub-id pub-id-type="pmid">39850651</pub-id></citation></ref>
<ref id="ref125"><citation citation-type="journal"><person-group person-group-type="author"><collab id="coll3">Quantum Technology and Application Consortium &#x2013; QUTAC</collab><name><surname>Andreas</surname> <given-names>B.</given-names></name> <name><surname>Guillaume</surname> <given-names>B.</given-names></name> <name><surname>Julia</surname> <given-names>B.</given-names></name> <name><surname>Thierry</surname> <given-names>A.</given-names></name> <name><surname>Hans</surname> <given-names>E.</given-names></name> <name><surname>Thomas</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Industry quantum computing applications</article-title>. <source>EPJ Quantum Technol.</source> <volume>8</volume>. doi: <pub-id pub-id-type="doi">10.1140/epjqt/s40507-021-00114-x</pub-id>, PMID: <pub-id pub-id-type="pmid">39790366</pub-id></citation></ref>
<ref id="ref126"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Quetschlich</surname> <given-names>N.</given-names></name> <name><surname>Burgholzer</surname> <given-names>L.</given-names></name> <name><surname>Wille</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). <article-title>Compiler optimization for quantum computing using reinforcement learning</article-title>. <source>arXiv</source>. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2212.04508</pub-id></citation></ref>
<ref id="ref127"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ramette</surname> <given-names>J.</given-names></name> <name><surname>Sinclair</surname> <given-names>J.</given-names></name> <name><surname>Breuckmann</surname> <given-names>N. P.</given-names></name> <name><surname>Vuleti&#x0107;</surname> <given-names>V.</given-names></name></person-group> (<year>2024</year>). <article-title>Fault-tolerant connection of error-corrected qubits with noisy links</article-title>. <source>NPJ Quant. Inform.</source> <volume>10</volume>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41534-024-00855-4</pub-id></citation></ref>
<ref id="ref128"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Reali</surname> <given-names>F.</given-names></name> <name><surname>Priami</surname> <given-names>C.</given-names></name> <name><surname>Marchetti</surname> <given-names>L.</given-names></name></person-group> (<year>2017</year>). <article-title>Optimization algorithms for computational systems biology</article-title>. <source>Front. Appl. Math. Stat.</source> <volume>3</volume>:<fpage>6</fpage>. doi: <pub-id pub-id-type="doi">10.3389/fams.2017.00006</pub-id></citation></ref>
<ref id="ref129"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Repetto</surname> <given-names>V.</given-names></name> <name><surname>Ceroni</surname> <given-names>E. G.</given-names></name> <name><surname>Buonaiuto</surname> <given-names>G.</given-names></name> <name><surname>D'Aurizio</surname> <given-names>R.</given-names></name></person-group> (<year>2024</year>). Quantum enhanced stratification of breast Cancer: Exploring quantum expressivity for real omics data. arXiv preprint arXiv:2409.14089.</citation></ref>
<ref id="ref131"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Robert</surname> <given-names>A.</given-names></name> <name><surname>Barkoutsos</surname> <given-names>P. K.</given-names></name> <name><surname>Woerner</surname> <given-names>S.</given-names></name> <name><surname>Tavernelli</surname> <given-names>I.</given-names></name></person-group> (<year>2021</year>). <article-title>Resource-efficient quantum algorithm for protein folding</article-title>. <source>NPJ Quantum Inf.</source> <volume>7</volume>:<fpage>38</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41534-021-00368-4</pub-id></citation></ref>
<ref id="ref132"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Saggi</surname> <given-names>M. K.</given-names></name> <name><surname>Bhatia</surname> <given-names>A. S.</given-names></name> <name><surname>Isaiah</surname> <given-names>M.</given-names></name> <name><surname>Gowher</surname> <given-names>H.</given-names></name> <name><surname>Kais</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). Multi-omic and quantum machine learning integration for lung subtypes classification. arXiv arXiv:2410.02085 [Preprint].</citation></ref>
<ref id="ref133"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Salem</surname> <given-names>M.</given-names></name> <name><surname>Merelo</surname> <given-names>J.</given-names></name> <name><surname>Siarry</surname> <given-names>P.</given-names></name> <name><surname>Bachir</surname> <given-names>R.</given-names></name> <name><surname>Debakla</surname> <given-names>M.</given-names></name> <name><surname>Debbat</surname> <given-names>F.</given-names></name></person-group> (<year>2023</year>). &#x201C;<article-title>Quantum natural language processing: A new and promising way to solve NLP problems</article-title>&#x201D; in <source>Artificial intelligence: Theories and applications: First international conference, ICAITA 2022, Mascara, Algeria, November 7&#x2013;8, 2022, revised selected papers</source>. eds. <person-group person-group-type="editor"><name><surname>Salem</surname> <given-names>M.</given-names></name> <name><surname>Merelo</surname> <given-names>J. J.</given-names></name> <name><surname>Siarry</surname> <given-names>P.</given-names></name> <name><surname>Bouiadjra</surname> <given-names>R. B.</given-names></name> <name><surname>Debakla</surname> <given-names>M.</given-names></name> <name><surname>Debbat</surname> <given-names>F.</given-names></name></person-group>, vol. <volume>1769</volume> (<publisher-loc>New York</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>215</fpage>&#x2013;<lpage>227</lpage>.</citation></ref>
<ref id="ref9001"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Salloum</surname> <given-names>H.</given-names></name> <name><surname>Lukin</surname> <given-names>R.</given-names></name> <name><surname>Mazzara</surname> <given-names>M.</given-names></name></person-group> (<year>2024</year>). <source>Quantum computing in drug discovery: A review of quantum annealing and gate-based approaches.</source> doi: <pub-id pub-id-type="doi">10.13140/RG.2.2.32727.48805</pub-id></citation></ref>
<ref id="ref134"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Samanta</surname> <given-names>S.</given-names></name> <name><surname>Choudhury</surname> <given-names>A.</given-names></name> <name><surname>Dey</surname> <given-names>N.</given-names></name> <name><surname>Ashour</surname> <given-names>A. S.</given-names></name> <name><surname>Balas</surname> <given-names>V.</given-names></name></person-group> (<year>2016</year>). <source>Quantum inspired evolutionary algorithm for scaling factors optimization during manifold medical information embedding</source>. In <source>Quantum Inspired Evol. Comp.</source> (pp. <fpage>145</fpage>&#x2013;<lpage>167</lpage>). doi: <pub-id pub-id-type="doi">10.1016/B978-0-12-804409-4.00009-7</pub-id></citation></ref>
<ref id="ref135"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Sarkar</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <source>Quantum algorithms: For pattern-matching in genomic sequences</source>.</citation></ref>
<ref id="ref136"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Sarkar</surname> <given-names>A.</given-names></name> <name><surname>Al-Ars</surname> <given-names>Z.</given-names></name> <name><surname>Almudever</surname> <given-names>C. G.</given-names></name> <name><surname>Bertels</surname> <given-names>K.</given-names></name></person-group> (<year>2019</year>). An algorithm for DNA read alignment on quantum accelerators. arXiv preprint arXiv:1909.05563.</citation></ref>
<ref id="ref137"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Sathan</surname> <given-names>D.</given-names></name> <name><surname>Baichoo</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). &#x201C;Drug target interaction prediction using variational quantum classifier.&#x201D; In Proceedings of the 2024 international conference on next generation computing applications (NextComp), Mauritius, pp. 1&#x2013;7.</citation></ref>
<ref id="ref138"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Selig</surname> <given-names>P.</given-names></name> <name><surname>Murphy</surname> <given-names>N.R A. S.</given-names></name> <name><surname>Redmond</surname> <given-names>D.</given-names></name> <name><surname>Caton</surname> <given-names>S</given-names></name></person-group>. (<year>2021</year>). &#x201C;A case for noisy shallow gate-based circuits in quantum machine learning.&#x201D; In 2021 International Conference on Rebooting Computing (ICRC). pp. 24&#x2013;34. IEEE.</citation></ref>
<ref id="ref139"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Selladurai</surname> <given-names>P.</given-names></name> <name><surname>Dahiya</surname> <given-names>R.</given-names></name> <name><surname>Kandasamy</surname> <given-names>B.</given-names></name> <name><surname>Radhakrishnan</surname> <given-names>V.</given-names></name></person-group> (<year>2024</year>). &#x201C;<article-title>Integrating quantum computing in bioinformatics and biomedical research</article-title>&#x201D; in <source>Intelligent data analytics for bioinformatics and biomedical systems (Chapter 15)</source>. eds. <person-group person-group-type="editor"><name><surname>Sharma</surname> <given-names>N.</given-names></name> <name><surname>Cengiz</surname> <given-names>K.</given-names></name> <name><surname>Chatterjee</surname> <given-names>P.</given-names></name></person-group>.</citation></ref>
<ref id="ref140"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shaun</surname> <given-names>A.</given-names></name> <name><surname>Abel</surname> <given-names>C. P.</given-names></name> <name><surname>Verena</surname> <given-names>R.</given-names></name> <name><surname>Sumir</surname> <given-names>P.</given-names></name> <name><surname>Katherine</surname> <given-names>J.</given-names></name> <name><surname>Nicola</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>The development of a sustainable bioinformatics training environment within the H3Africa bioinformatics network (H3ABioNet)</article-title>. <source>Front. Educ.</source> <volume>6</volume>:<fpage>725702</fpage>. doi: <pub-id pub-id-type="doi">10.3389/feduc.2021.725702</pub-id>, PMID: <pub-id pub-id-type="pmid">39850882</pub-id></citation></ref>
<ref id="ref141"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Shiny Duela</surname> <given-names>J.</given-names></name> <name><surname>Umamageswari</surname> <given-names>A.</given-names></name> <name><surname>Prabavathi</surname> <given-names>R.</given-names></name> <name><surname>Umapathy</surname> <given-names>P.</given-names></name> <name><surname>Raja</surname> <given-names>K.</given-names></name></person-group> (<year>2023</year>). &#x201C;<article-title>Quantum assisted genetic algorithm for sequencing compatible amino acids in drug design</article-title>&#x201D; in <source>2023 third international conference on advances in electrical, computing, communication and sustainable technologies (ICAECT)</source>, <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ICAECT57570.2023.10117673</pub-id></citation></ref>
<ref id="ref142"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shor</surname> <given-names>P. W.</given-names></name></person-group> (<year>1999</year>). <article-title>Polynomial-time algorithms for prime factorization and discrete logarithms</article-title>. <source>Quantum Inf. Process</source> <volume>2</volume>, <fpage>303</fpage>&#x2013;<lpage>332</lpage>.</citation></ref>
<ref id="ref143"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Shuyue</surname> <given-names>L.</given-names></name> <name><surname>Shu</surname> <given-names>Z.</given-names></name> <name><surname>Hongchao</surname> <given-names>S.</given-names></name> <name><surname>Ruixing</surname> <given-names>L.</given-names></name> <name><surname>Hexin</surname> <given-names>L.</given-names></name> <name><surname>Paola</surname> <given-names>G.</given-names></name></person-group> (<year>2023</year>). &#x201C;PQLM - Multilingual decentralized portable quantum language model.&#x201D; IEEE International Conference on acoustics, Speech, and Signal Processing (ICASSP).</citation></ref>
<ref id="ref144"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Simmons</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>Scalable fault-tolerant quantum technologies with silicon color centers</article-title>. <source>PRX Quantum</source> <volume>5</volume>:<fpage>010102</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PRXQuantum.5.010102</pub-id></citation></ref>
<ref id="ref145"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Soame</surname> <given-names>R.</given-names></name></person-group> (<year>2023</year>). &#x201C;Quantum natural language processing: A new and promising way to solve NLP problems.&#x201D; In Proceedings of the 2023 conference. pp. 215&#x2013;227.</citation></ref>
<ref id="ref146"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Soni</surname> <given-names>K. K.</given-names></name> <name><surname>Rasool</surname> <given-names>A.</given-names></name></person-group> (<year>2021</year>). <article-title>Quantum-based exact pattern matching algorithms for biological sequences</article-title>. <source>ETRI J.</source> <volume>43</volume>, <fpage>483</fpage>&#x2013;<lpage>510</lpage>. doi: <pub-id pub-id-type="doi">10.4218/etrij.2019-0589</pub-id></citation></ref>
<ref id="ref147"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sood</surname> <given-names>V.</given-names></name> <name><surname>Chauhan</surname> <given-names>R. P.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum computing: impact on energy efficiency and sustainability</article-title>. <source>Expert Syst. Appl.</source> <volume>255</volume>:<fpage>124401</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2024.124401</pub-id>, PMID: <pub-id pub-id-type="pmid">39854647</pub-id></citation></ref>
<ref id="ref148"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Steedman</surname> <given-names>M.</given-names></name> <name><surname>Baldridge</surname> <given-names>J.</given-names></name></person-group> (<year>2011</year>). &#x201C;<article-title>Non-transformational syntax: Formal and explicit models of grammar</article-title>&#x201D; in <source>Wiley-Blackwell companion to syntax</source>. Eds. Robert D. B., and Kersti, B., Wiley-Blackwell, <fpage>1</fpage>&#x2013;<lpage>27</lpage>.</citation></ref>
<ref id="ref149"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stodden</surname> <given-names>V.</given-names></name> <name><surname>Miguez</surname> <given-names>S.</given-names></name></person-group> (<year>2014</year>). <article-title>Best practices for computational science: software infrastructure and environments for reproducible and extensible research</article-title>. <source>J. Open Res. Softw.</source> <volume>2</volume>:<fpage>e21</fpage>. doi: <pub-id pub-id-type="doi">10.5334/jors.ay</pub-id></citation></ref>
<ref id="ref150"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Strubell</surname> <given-names>E.</given-names></name> <name><surname>Ganesh</surname> <given-names>A.</given-names></name> <name><surname>McCallum</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). &#x201C;Energy and policy considerations for modern deep learning research.&#x201D; in Proceedings of the AAAI Conference on Artificial Intelligence Vol. 34, No. 9. pp. 13693&#x2013;13696.</citation></ref>
<ref id="ref151"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>J.</given-names></name> <name><surname>Chen</surname> <given-names>W.</given-names></name> <name><surname>Fang</surname> <given-names>W.</given-names></name> <name><surname>Wun</surname> <given-names>X.</given-names></name> <name><surname>Xu</surname> <given-names>W.</given-names></name></person-group> (<year>2012</year>). <article-title>Gene expression data analysis with the clustering method based on an improved quantum-behaved particle swarm optimization</article-title>. <source>Eng. Appl. Artif. Intell.</source> <volume>25</volume>, <fpage>376</fpage>&#x2013;<lpage>391</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.engappai.2011.09.017</pub-id></citation></ref>
<ref id="ref152"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Surov</surname> <given-names>I. A.</given-names></name> <name><surname>Semenenko</surname> <given-names>E.</given-names></name> <name><surname>Platonov</surname> <given-names>A. V.</given-names></name> <name><surname>Bessmertny</surname> <given-names>I. A.</given-names></name> <name><surname>Galofaro</surname> <given-names>F.</given-names></name> <name><surname>Toffano</surname> <given-names>Z.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Quantum semantics of text perception</article-title>. <source>Sci. Rep.</source> <volume>11</volume>:<fpage>4193</fpage>. doi: <pub-id pub-id-type="doi">10.1038/s41598-021-83490-9</pub-id>, PMID: <pub-id pub-id-type="pmid">33603018</pub-id></citation></ref>
<ref id="ref153"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tao</surname> <given-names>Y.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum entanglement: principles and research progress in quantum information processing</article-title>. <source>Theoret. Nat. Sci.</source> <volume>30</volume>, <fpage>263</fpage>&#x2013;<lpage>274</lpage>. doi: <pub-id pub-id-type="doi">10.54254/2753-8818/30/20241130</pub-id></citation></ref>
<ref id="ref154"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Temme</surname> <given-names>K.</given-names></name> <name><surname>Bravyi</surname> <given-names>S.</given-names></name> <name><surname>Gambetta</surname> <given-names>J. M.</given-names></name></person-group> (<year>2017</year>). <article-title>Error mitigation for short-depth quantum circuits</article-title>. <source>Phys. Rev. Lett.</source> <volume>119</volume>:<fpage>180509</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevLett.119.180509</pub-id>, PMID: <pub-id pub-id-type="pmid">29219599</pub-id></citation></ref>
<ref id="ref155"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ting</surname> <given-names>Z.</given-names></name> <name><surname>Caflisch</surname> <given-names>A.</given-names></name></person-group> (<year>2010</year>). <article-title>High-throughput virtual screening using quantum mechanical probes: discovery of selective kinase inhibitors</article-title>. <source>ChemMedChem</source> <volume>5</volume>, <fpage>1007</fpage>&#x2013;<lpage>1014</lpage>. doi: <pub-id pub-id-type="doi">10.1002/cmdc.201000085</pub-id>, PMID: <pub-id pub-id-type="pmid">20540063</pub-id></citation></ref>
<ref id="ref156"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Torlai</surname> <given-names>G.</given-names></name> <name><surname>Melko</surname> <given-names>R. G.</given-names></name></person-group> (<year>2020</year>). <article-title>Machine-learning quantum states in the NISQ era</article-title>. <source>Ann. Rev. Cond. Matter Physics</source> <volume>11</volume>, <fpage>325</fpage>&#x2013;<lpage>344</lpage>. doi: <pub-id pub-id-type="doi">10.1146/annurev-conmatphys-031119-050651</pub-id></citation></ref>
<ref id="ref157"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tsujii</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). <article-title>Natural language processing and computational linguistics</article-title>. <source>Comput. Linguist.</source> <volume>47</volume>, <fpage>1</fpage>&#x2013;<lpage>21</lpage>. doi: <pub-id pub-id-type="doi">10.1162/coli_a_00420</pub-id></citation></ref>
<ref id="ref158"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Van Vu</surname> <given-names>T.</given-names></name> <name><surname>Kuwahara</surname> <given-names>T.</given-names></name> <name><surname>Saito</surname> <given-names>K.</given-names></name></person-group> (<year>2024</year>). <article-title>Fidelity-dissipation relations in quantum gates</article-title>. <source>Phys. Rev. Res.</source> <volume>6</volume>:<fpage>033225</fpage>. doi: <pub-id pub-id-type="doi">10.1103/PhysRevResearch.6.033225</pub-id>, PMID: <pub-id pub-id-type="pmid">39752716</pub-id></citation></ref>
<ref id="ref159"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Varmantchaonala</surname> <given-names>C. M.</given-names></name> <name><surname>Fendji</surname> <given-names>J. L. K. E.</given-names></name> <name><surname>Sch&#x00F6;ning</surname> <given-names>J.</given-names></name> <name><surname>Atemkeng</surname> <given-names>M.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum natural language processing: A comprehensive survey</article-title>. <source>IEEE Access</source> <volume>12</volume>, <fpage>99578</fpage>&#x2013;<lpage>99598</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2024.3420707</pub-id></citation></ref>
<ref id="ref160"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Veleiro</surname> <given-names>U.</given-names></name> <name><surname>de la Fuente</surname> <given-names>J.</given-names></name> <name><surname>Pizurica</surname> <given-names>M.</given-names></name> <name><surname>Pineda-Lucena</surname> <given-names>A.</given-names></name> <name><surname>Ochoa</surname> <given-names>I.</given-names></name> <name><surname>Gevaert</surname> <given-names>O.</given-names></name> <etal/></person-group>. (<year>2023</year>). GeNNius: An ultrafast drug-target interaction inference method based on graph neural networks. bioRxiv.</citation></ref>
<ref id="ref161"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vincentius</surname> <given-names>M.</given-names></name> <name><surname>Zhao</surname> <given-names>J.</given-names></name> <name><surname>Afek</surname> <given-names>A.</given-names></name> <name><surname>Mielko</surname> <given-names>Z.</given-names></name> <name><surname>Gord&#x00E2;n</surname> <given-names>R.</given-names></name></person-group> (<year>2019</year>). <article-title>QBiC-Pred: quantitative predictions of transcription factor binding changes due to sequence variants</article-title>. <source>Nucleic Acids Res.</source> <volume>47</volume>, <fpage>W127</fpage>&#x2013;<lpage>W135</lpage>. doi: <pub-id pub-id-type="doi">10.1093/nar/gkz363</pub-id>, PMID: <pub-id pub-id-type="pmid">31114870</pub-id></citation></ref>
<ref id="ref162"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Alexeev</surname> <given-names>Y.</given-names></name> <name><surname>Jiang</surname> <given-names>L.</given-names></name> <name><surname>Chong</surname> <given-names>F. T.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). <article-title>Fundamental causal bounds of quantum random access memories</article-title>. <source>NPJ Quant. Inform.</source> <volume>10</volume>, <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi: <pub-id pub-id-type="doi">10.1038/s41534-024-00848-3</pub-id>, PMID: <pub-id pub-id-type="pmid">39853092</pub-id></citation></ref>
<ref id="ref163"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). <article-title>Quantum machine learning: from NISQ to fault tolerance</article-title>. <source>ArXiv</source>, <comment>abs/2401.11351</comment>. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2401.11351</pub-id></citation></ref>
<ref id="ref164"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Webber</surname> <given-names>M.</given-names></name> <name><surname>Elfving</surname> <given-names>V.</given-names></name> <name><surname>Weidt</surname> <given-names>S.</given-names></name> <name><surname>Hensinger</surname> <given-names>W. K.</given-names></name></person-group> (<year>2022</year>). <article-title>The impact of hardware specifications on reaching quantum advantage in the fault tolerant regime</article-title>. <source>AVS Quantum Sci.</source> <volume>4</volume>:<fpage>013801</fpage>. doi: <pub-id pub-id-type="doi">10.1116/5.0073075</pub-id></citation></ref>
<ref id="ref165"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Weidner</surname> <given-names>C. A.</given-names></name> <name><surname>Reed</surname> <given-names>E. A.</given-names></name> <name><surname>Monroe</surname> <given-names>J.</given-names></name> <name><surname>Sheller</surname> <given-names>B.</given-names></name> <name><surname>O&#x2019;Neil</surname> <given-names>S.</given-names></name> <name><surname>Maas</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2024</year>). <article-title>Robust quantum control in closed and open systems: theory and practice</article-title>. <source>Automatica</source> <volume>172</volume>:<fpage>111987</fpage>. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2401.00294</pub-id></citation></ref>
<ref id="ref166"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Widdows</surname> <given-names>D.</given-names></name> <name><surname>Alexander</surname> <given-names>A.</given-names></name> <name><surname>Zhu</surname> <given-names>D.</given-names></name> <name><surname>Zimmerman</surname> <given-names>C.</given-names></name> <name><surname>Majumder</surname> <given-names>A.</given-names></name></person-group> (<year>2024</year>). <article-title>Near-term advances in quantum natural language processing</article-title>. <source>Ann. Math. Artif. Intell.</source> <volume>92</volume>, <fpage>1249</fpage>&#x2013;<lpage>1272</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s10472-024-09940-y</pub-id>, PMID: <pub-id pub-id-type="pmid">39850651</pub-id></citation></ref>
<ref id="ref167"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Wiebe</surname> <given-names>N.</given-names></name> <name><surname>Bocharov</surname> <given-names>A.</given-names></name> <name><surname>Smolensky</surname> <given-names>P.</given-names></name> <name><surname>Troyer</surname> <given-names>M.</given-names></name> <name><surname>Svore</surname> <given-names>K. M.</given-names></name></person-group> (<year>2019</year>). Quantum language processing. arXiv arXiv:1902.05162 [Preprint].</citation></ref>
<ref id="ref168"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Wong</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). On quantum entanglement. 5, 1&#x2013;7.</citation></ref>
<ref id="ref169"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wong</surname> <given-names>R.</given-names></name> <name><surname>Chang</surname> <given-names>W.-L.</given-names></name></person-group> (<year>2021</year>). <article-title>Quantum speedup for protein structure prediction</article-title>. <source>IEEE Trans. Nanobiosci.</source> <volume>20</volume>, <fpage>323</fpage>&#x2013;<lpage>330</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TNB.2021.3065051</pub-id>, PMID: <pub-id pub-id-type="pmid">33690123</pub-id></citation></ref>
<ref id="ref170"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wong</surname> <given-names>R.</given-names></name> <name><surname>Chang</surname> <given-names>W.-L.</given-names></name></person-group> (<year>2022</year>). <article-title>Fast quantum algorithm for protein structure prediction in hydrophobic-hydrophilic model</article-title>. <source>J. Parallel Distrib. Comp.</source> <volume>164</volume>, <fpage>178</fpage>&#x2013;<lpage>190</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.jpdc.2022.03.011</pub-id></citation></ref>
<ref id="ref171"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Xiong</surname> <given-names>Z.</given-names></name> <name><surname>Cui</surname> <given-names>X.</given-names></name> <name><surname>Lin</surname> <given-names>X.</given-names></name> <name><surname>Ren</surname> <given-names>F.</given-names></name> <name><surname>Liu</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2023</year>). Q-drug: A framework to bring drug design into quantum space using deep learning. arXiv preprint arXiv:2308.13171.</citation></ref>
<ref id="ref172"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>P.</given-names></name> <name><surname>Li</surname> <given-names>L.</given-names></name> <name><surname>Jin</surname> <given-names>M.</given-names></name> <name><surname>Zeng</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>Quantum probability-inspired graph neural network for document representation and classification</article-title>. <source>Neurocomputing</source> <volume>445</volume>, <fpage>276</fpage>&#x2013;<lpage>286</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.neucom.2021.02.060</pub-id></citation></ref>
<ref id="ref173"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>L.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>T.</given-names></name> <name><surname>Zhu</surname> <given-names>H.</given-names></name></person-group> (<year>2013</year>). <article-title>Large local analysis of the unaligned genome and its application</article-title>. <source>J. Comput. Biol.</source> <volume>20</volume>, <fpage>19</fpage>&#x2013;<lpage>29</lpage>. doi: <pub-id pub-id-type="doi">10.1089/cmb.2011.0052</pub-id>, PMID: <pub-id pub-id-type="pmid">23294269</pub-id></citation></ref>
<ref id="ref174"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Yeung</surname> <given-names>R.</given-names></name> <name><surname>Kartsaklis</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>A CCG-based version of the DisCoCat framework</article-title>. <source>arXiv</source>:<fpage>arXiv:2105.07720</fpage> [Preprint].</citation></ref>
<ref id="ref175"><citation citation-type="other"><person-group person-group-type="author"><name><surname>Yu</surname> <given-names>Y.</given-names></name> <name><surname>Qiu</surname> <given-names>D.</given-names></name> <name><surname>Yan</surname> <given-names>R.</given-names></name></person-group> (<year>2020</year>). &#x201C;Quantum entanglement based sentence similarity computation.&#x201D; in 2020 IEEE international conference on Progress in informatics and computing (PIC), Shanghai, China. pp. 250&#x2013;257.</citation></ref>
<ref id="ref176"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zarei</surname> <given-names>M.</given-names></name> <name><surname>Elaheh</surname> <given-names>A.</given-names></name></person-group> (<year>2024</year>). <article-title>Potential of quantum machine learning for solving the real-world problem of cancer classification</article-title>. <source>Dis. Appl. Sci.</source> <volume>6</volume>:<fpage>513</fpage>. doi: <pub-id pub-id-type="doi">10.1007/s42452-024-06220-6</pub-id>, PMID: <pub-id pub-id-type="pmid">39850651</pub-id></citation></ref>
<ref id="ref177"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>J.</given-names></name> <name><surname>Li</surname> <given-names>W.</given-names></name> <name><surname>Cheng</surname> <given-names>J.</given-names></name> <name><surname>Karemore</surname> <given-names>G.</given-names></name> <name><surname>Zitnik</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2024</year>). <article-title>Quantum-machine-assisted drug discovery: Survey and perspective</article-title>. <source>arXiv</source>. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2408.13479</pub-id></citation></ref>
<ref id="ref178"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>X.</given-names></name> <name><surname>Li</surname> <given-names>S.</given-names></name> <name><surname>Feng</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Quantum circuit transformation based on simulated annealing and heuristic search</article-title>. <source>IEEE Trans. Comp. Aided Design Integ. Circ. Syst.</source> <volume>39</volume>, <fpage>4683</fpage>&#x2013;<lpage>4694</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TCAD.2020.2969647</pub-id></citation></ref>
</ref-list>
</back>
</article>