The DOI matches its Crossref record; 155 of the 202 references it cites were found in a registry or an index; 69 of the 107 sources its claims cite were checked for support.
Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics
Open accessAbstract
Modern biological science is trying to solve the fundamental complex problems of molecular biology, which include protein folding, drug discovery, simulation of macromolecular structure, genome assembly, and many more. Currently, quantum computing (QC), a rapidly emerging technology exploiting quantum mechanical phenomena, has developed to address current significant physical, chemical, biological issues, and complex questions. The present review discusses quantum computing technology and its status in solving molecular biology problems, especially in the next-generation computational biology scenario. First, the article explained the basic concept of quantum computing, the functioning of quantum systems where information is stored as qubits, and data storage capacity using quantum gates. Second, the review discussed quantum computing components, such as quantum hardware, quantum processors, and quantum annealing. At the same time, article also discussed quantum algorithms, such as the grover search algorithm and discrete and factorization algorithms. Furthermore, the article discussed the different applications of quantum computing to understand the next-generation biological problems, such as simulation and modeling of biological macromolecules, computational biology problems, data analysis in bioinformatics, protein folding, molecular biology problems, modeling of gene regulatory networks, drug discovery and development, mechano-biology, and RNA folding. Finally, the article represented different probable prospects of quantum computing in molecular biology.
Overview
CoChat Summary
TL;DR
This is a narrative review of quantum computing concepts, hardware, algorithms, and limitations, framed around potential uses in computational biology and molecular biology. It argues that quantum computing may help with problems like protein folding, molecular simulation, sequence alignment, and drug discovery, but emphasizes that current hardware is still noisy, limited, and far from fully practical.
Key findings
- The review identifies a set of biological application areas for quantum computing, including protein folding, molecular dynamics/simulation, genome assembly, sequence alignment, phylogenetic tree inference, drug discovery, gene regulatory networks, transcription factor binding, RNA folding, and data analysis in bioinformatics.
- It states that quantum algorithms can provide speedups in some settings, citing examples such as Grover’s algorithm for search, Shor’s algorithm for factorization/discrete logarithms, and the Harrow-Hassidim-Lloyd algorithm for linear systems; however, it also says that “quantum speedup” has not been validated in general.
- For protein folding, the paper reports that lattice protein models have been mapped to quantum annealing, and cites Perdomo-Ortiz et al. as finding low-energy conformations of lattice protein models by quantum annealing.
- For hardware progress, it notes processor sizes ranging from 2 qubits to 433 qubits, and highlights a 53-qubit superconducting experiment whose runtime was described as about 200 seconds versus approximately 10,000 years on a state-of-the-art classical supercomputer.
Methods
- This is a review article, not an original empirical study; it synthesizes prior literature on quantum computing foundations, hardware, algorithms, and biological applications.
- The paper draws on published studies, reviews, and example algorithms/hardware reports, and organizes them into thematic sections with summary tables of algorithms and application areas.
- The main analysis is descriptive and comparative: it contrasts classical vs. quantum concepts, summarizes reported computational advantages, and maps candidate quantum approaches to biological problems.
Limitations
- The paper explicitly states that current quantum hardware is noisy, error-prone, difficult to calibrate, and requires expensive near-absolute-zero refrigeration; it also says current machines fall short of the one-million qubits needed for economic viability.
- It notes that quantum computers are still being developed and are not yet economically viable, with many practical applications still dependent on future hardware advances.
- Evident from the text: the article is largely a high-level narrative review with tables and cited examples, so it does not present new experimental data or a systematic meta-analysis of effect sizes or benchmark performance.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
49 Valid · 4 Not valid · 21 Not checked · 22 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“The researchers have explained that their sycamore processor takes about 200s to compute. A similar job would take approximately 10,000years by a state-of-the-art classical supercomputer [5].”
What the sources say
- Supportedcites [5] Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., et al. (2019). Quantum supremacy using a programmable superconducting processor. Nature, 574(7779), 505–510. source
The opening passage states that Sycamore takes about 200 seconds to sample one quantum circuit a million times and that benchmarks indicate the equivalent task would take approximately 10,000 years on a state-of-the-art classical supercomputer. “The future” section repeats the comparison for a million samples at m = 20. (LLM, conf=0.94)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“For instance, the variational algorithms employ a classic computer together with a smaller quantum processor to complete many short forms of quantum computations before noise disrupts them.”
What the sources say
- Supportedcites [35] Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79. source
Section 6.1 (p. 8) describes a hybrid algorithm in which a classical optimizer repeatedly directs a quantum processor. Section 6.2 (p. 8) explains that noise limits near-term processors to short circuits, supporting the claim’s account of why the quantum computations are brief. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The 'quantum entanglement phenomenon' is the cornerstone of quantum calculation speed and pieces of literature are available [21, 22].”
What the sources say
- Could not verifycites [21] D. Gottesman, The Heisenberg representation of quantum computers, arXiv preprint quant-ph/9807006 (1998). sourceExperimental — accuracy not yet measured
The paper discusses entangled Bell states in quantum teleportation (Section 7, p. 15), but does not say that entanglement is the cornerstone of quantum computational speed. Its Discussion and Summary (p. 19) instead says that computation is more powerful than classical computation only when it uses gates outside the Clifford group; that does not settle entanglement’s role in the claimed speed advantage. (LLM, conf=0.72)
- Partly supportedcites [22] Jozsa, R., & Linden, N. (2003). On the role of entanglement in quantum-computational speed-up. Proceedings of the Royal Society of London Series A: Mathematical, Physical and Engineering Sciences, 459(2036), 2011–2032. sourceExperimental — accuracy not yet measured
The Introduction (p. 5) says entanglement is necessary for exponential speed-up in pure-state quantum algorithms. But it explicitly cautions against concluding that entanglement is an essential resource for quantum computational power, and Section 6 (p. 19) says its significance depends on the mathematical formalism used. Calling it the unqualified “cornerstone” of quantum calculation speed overstates the paper’s conclusion. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“It has been demonstrated that if the 'quantum entanglement phenomenon' is not used in the quantum algorithm, then the same algorithm can be worked with classical 0 and 1 bits computer systems without any remarkable change in computational speed.”
What the sources say
- Partly supportedcites [21] D. Gottesman, The Heisenberg representation of quantum computers, arXiv preprint quant-ph/9807006 (1998). sourceExperimental — accuracy not yet measured
The Discussion and Summary (p. 19) says that circuits restricted to Clifford operations and Pauli measurements can be simulated in polynomial time on a classical computer. It does not make absence of entanglement the condition for that result or establish that the classical version runs at nearly the same speed. The paper also discusses a Bell-state teleportation circuit (Measurements, p. 15), so its classically simulable circuits are not defined by a lack of entanglement. (LLM, conf=0.87)
- Partly supportedcites [22] Jozsa, R., & Linden, N. (2003). On the role of entanglement in quantum-computational speed-up. Proceedings of the Royal Society of London Series A: Mathematical, Physical and Engineering Sciences, 459(2036), 2011–2032. sourceExperimental — accuracy not yet measured
The Introduction (p. 3) says that a quantum algorithm on unentangled pure states can be classically simulated with equivalent resources. The claim omits the pure-state restriction: Section 5 (p. 17) says whether algorithms using unentangled mixed states can be efficiently simulated remains unresolved. (LLM, conf=0.88)
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“The surface code, one of the most frequently used techniques, can operate with error rates close to 1% [32].”
What the sources say
- Supportedcites [32] Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012). Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86(3), 032324. source
The Background (p. 2) states that surface codes tolerate per-operation error rates as high as about 1%. This supports the cited claim, with the qualification that the rate is per operation. (LLM, conf=0.92)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
26 more claims · 16 with their cited sources checked
Create a free account to see all 96 claims and to verify the 1 reference still open.
- Probably not a substantial claim. 58
- It may state two separate claims as one. 22
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Self-check results appear here once an independent check has confirmed them.
Cited works that were retracted
Works this paper cites that were later retracted, from the retraction notices publishers deposit. Major when the notice came out before this paper was published.
A note, not an issue: for example, a cited work that was retracted only after this paper was published, which its authors could not have known.
In the paper
“…in biological interactions, its contribution is possible in biochemical systems [7], biology [8], biochemistry [9], computation of protein–ligand interplay [10], mRNA codon optimization [11], and protein folding [12] to name a few with higher-order speeds compared with conventional computers.”
Cited work 10.1002/qua.26975 · retracted 2024-01-04 · notice 10.1002/qua.27266 · this paper published 2023-05-27
Citations
Cites
1 retracted
Quantum computational quantification of protein–ligand interactions
Kirsopp, J. J. M., Di Paola, C., Manrique, D. Z., Krompiec, M., Greene‐Diniz, G., Guba, W., Meyder, A., Wolf, D., Strahm, M., & Muñoz Ramo, D. (2022) · International Journal of Quantum Chemistry · doi:10.1002/qua.26975 · Cited by 59 · cited 1×
“…in biological interactions, its contribution is possible in biochemical systems [7], biology [8], biochemistry [9], computation of protein–ligand interplay [10], mRNA codon optimization [11], and protein folding [12] to name a few with higher-order speeds compared with conventional computers.”
RetractedQuantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“This factorization can be undertaken with an assumption of a 16-GHz gate rate, which takes approximately one day to complete [33].”
BackgroundQuantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · cited 2×
“A similar job would take approximately 10,000 years by a state-of-the-art classical supercomputer [5].”
InfluentialElementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311 · cited 1×
“One of the earliest achievements in quantum computation is the realization of the possible options that can be enacted using a unique set comprising the universal gates for one qubit or two qubits [24, 25].”
BackgroundDegen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Die gegenw�rtige Situation in der Quantenmechanik
Schr�dinger, E. (1935) · Die Naturwissenschaften · doi:10.1007/bf01491891 · Cited by 3,392
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 6×
“As proposed by Harrow et al. [75], the quantum algorithm is capable enough to give solutions to definite linear systems at exponentially rapid speed compared to any existing algorithm.”
InfluentialLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Research works printed but not linked: 6
- M. Denil, N. de Freitas, NIPS Deep Learning and Unsupervised Feature Learning Workshop, NIPS, 2011.
- Hollenberg, L. C. (2000). Fast quantum search algorithms in protein sequence comparisons: quantum bioinformatics. Physical Review E, 62(5), 7532. · DOI · Paper page
- Prousalis, K., & Konofaos, N. (2019). Α quantum pattern recognition method for improving pairwise sequence alignment. Scientific Reports, 9(1), 7226. · DOI · Paper page
- J. Jiang, X. Zhang, C. Li, Y. Zhao, R. Li, Generalization study of quantum neural network, arXiv preprint arXiv:2006.02388 (2020). · arXiv
- Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012). Finding low-energy conformations of lattice protein models by quantum annealing. Scientific Reports, 2(1), 1–7. · DOI · Paper page
- Li, R. Y., Di Felice, R., Rohs, R., & Lidar, D. A. (2018). Quantum annealing versus classical machine learning applied to a simplified computational biology problem. npj Quantum Information, 4(1), 14. · DOI · Paper page
Cited by
Lappala, A. (2024) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2024.102919 · Cited by 70
Marengo, A., & Santamato, V. (2025) · Frontiers in Computer Science · doi:10.3389/fcomp.2025.1584114 · Cited by 83
Bhujel, R., Enkmann, V., Burgstaller, H., & Maharjan, R. (2025) · Pharmaceutics · doi:10.3390/pharmaceutics17080992 · Cited by 62
“The Quantum Biocompute Alliance aims to standardize lipid qubit encoding (OpenQASM 3.0 syntax) and establish GxP-grade error mitigation [223,224].”
InfluentialQuantum computing in bioinformatics: a systematic review mapping
Nałęcz-Charkiewicz, K., Charkiewicz, K., & Nowak, R. M. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae391 · Cited by 73
A primer for quantum computing and its applications to healthcare and biomedical research
Durant, T. J. S., Knight, E., Nelson, B. G., Dudgeon, S. N., Lee, S. J., Walliman, D., Young, H. P., Ohno-Machado, L., & Schulz, W. L. (2024) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocae149 · Cited by 55
Self-citation
Metadata
- Authors
- Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C.
- Affiliations
- Vellore Institute of Technology University (IN)
- Fakir Mohan University (IN)
- Hallym University Chuncheon Sacred Heart Hospital (KR)
- Adamas University (IN)
- Corresponding author
- Chakraborty, Chiranjib
- Venue
- Molecular Biotechnology
- Published
- 2023-05-27
- Volume
- 66
- Issue
- 2
- Pages
- 163-178
- ISSN
- 1073-6085 (ISSN-L)
- 1559-0305
- PMC
- PMC10224669
- OpenAlex
- W4378549390
- Cited by
- 103
- References
- 202
- Citations by year
- 2026: 34 · 2025: 38 · 2024: 27 · 2023: 3
- FWCI
- 1.66
- Type
- journal article
- Language
- en
- Update notices
- correction (2023-09-28)
- Open access
- bronze
- doi.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Molecular Biotechnology (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
- Keywords
- quantum computing, protein folding, molecular dynamics simulation, quantum annealing, Grover's algorithm, Shor's algorithm, quantum gates, qubits, quantum processors, drug discovery, gene regulatory networks, RNA folding, macromolecular structure, bioinformatics analysis
- MeSH terms
- Computing Methodologies, Quantum Theory, Protein Folding, Computational Biology, Molecular Dynamics Simulation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics. https://app.cochat.ai/papers/10.1007/s12033-023-00765-4
- The paper
- Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024). Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics. Molecular Biotechnology. https://doi.org/10.1007/s12033-023-00765-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.