Genome assembly using quantum and quantum-inspired annealing
Open accessThe DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Abstract
Recent advances in DNA sequencing open prospects to make whole-genome analysis rapid and reliable, which is promising for various applications including personalized medicine. However, existing techniques for de novo genome assembly, which is used for the analysis of genomic rearrangements, chromosome phasing, and reconstructing genomes without a reference, require solving tasks of high computational complexity. Here we demonstrate a method for solving genome assembly tasks with the use of quantum and quantum-inspired optimization techniques. Within this method, we present experimental results on genome assembly using quantum annealers both for simulated data and the $$\phi $$ ϕ X 174 bacteriophage. Our results pave a way for an increase in the efficiency of solving bioinformatics problems with the use of quantum computing and, in particular, quantum annealing. We expect that the new generation of quantum annealing devices would outperform existing techniques for de novo genome assembly. To the best of our knowledge, this is the first experimental study of de novo genome assembly problems both for real and synthetic data on quantum annealing devices and quantum-inspired techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures



Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This is the case of the recently proposed quantum algorithm for DNA sequencing [240,241] and for identifying the most probable binding site of a transcription factor to DNA.[242]”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [241]
In the citing paper
“In two approaches proposed by Boev et al. [143] and Nałęcz-Charkiewicz and Nowak [144], OLC graph is obtained with classical computations and mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem.”
From Quantum computing algorithms: getting closer to critical problems in computational biology (2022) · cites this paper as [143]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Minimap2: Pairwise alignment for nucleotide sequences
Li, H. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty191 · Cited by 14,807
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · cited 3×
“One of the algorithms that can be realized via gate-based quantum computing is Grover’s search [24], which can be used as a subroutine for sub-sequence alignment with a quadratic speed-up [25].”
BackgroundMethodCanu: scalable and accurate long-read assembly via adaptive k -mer weighting and repeat separation
Koren, S., Walenz, B. P., Berlin, K., Miller, J. R., Bergman, N. H., & Phillippy, A. M. (2017) · Genome Research · doi:10.1101/gr.215087.116 · Cited by 7,304 · cited 2×
“[16] S.”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 2×
“, in simulating complex systems [19], machine learning [20], and optimization [21].”
BackgroundLadd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“[19] S.”
BackgroundIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · cited 2×
“Then one can prepare a quantum system to be in the ground state of the Hamiltonian H0 and adiabatically change the configuration of the system is as follows [42]:”
MethodProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 2×
“[43] H.”
MethodNucleotide sequence of bacteriophage G4 DNA
Godson, G. N., Barrell, B. G., Staden, R., & Fiddes, J. C. (1978) · Nature · doi:10.1038/276236a0 · Cited by 2,099
Nucleotide sequence of bacteriophage φX174 DNA
Sanger, F., Air, G. M., Barrell, B. G., Brown, N. L., Coulson, A. R., Fiddes, J. C., Hutchison, C. A., Slocombe, P. M., & Smith, M. (1977) · Nature · doi:10.1038/265687a0 · Cited by 1,615 · cited 2×
“[3] F.”
Cited by
Maraveas, C., Konar, D., Michopoulos, D. K., Arvanitis, K. G., & Peppas, K. P. (2024) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2024.108680 · Cited by 115
Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 103
“The researchers described that quantum annealing is as an efficient technique to solve computational biology problems in quantum computing.”
Quantum computing at the quantum advantage threshold: a down-to-business reviewPreprint
Fedorov, A. K., Gisin, N., Beloussov, S. M., & Lvovsky, A. I. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.17181 · Cited by 103
“• life science, including lattice protein folding [415, 416](25) and genome assembly [417, 418];”
BackgroundSelf-citationQuantum Computing for Molecular Biology**
Baiardi, A., Christandl, M., & Reiher, M. (2023) · ChemBioChem · doi:10.1002/cbic.202300120 · Cited by 93
RETRACTED ARTICLE: A review on quantum computing and deep learning algorithms and their applications
Valdez, F., & Melín, P. (2022) · Soft Computing · doi:10.1007/s00500-022-07037-4 · Cited by 92
“Also, Chen et al. (2020) proposed a robotic device capable of introducing needles and catheters into deformable tissues such as blood vessels to draw blood or deliver fluids autonomously.”
BackgroundRetracted
Metadata
- Authors
- Boev, A. S., Rakitko, A. S., Usmanov, S. R., Kobzeva, A. N., Popov, I. V., Ilinsky, V. V., Kiktenko, E. O., & Fedorov, A. K.
- Affiliations
- Russian Quantum Center (RU)
- Moscow Institute of Physics and Technology (RU)
- Corresponding author
- Fedorov, A. K.
- Venue
- Scientific Reports
- Published
- 2021-06-23
- Volume
- 11
- Issue
- 1
- Pages
- 13183-13183
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC8222255
- OpenAlex
- W3016448351
- Cited by
- 63
- References
- 53
- Citations by year
- 2026: 8 · 2025: 13 · 2024: 17 · 2023: 13 · 2022: 10 · 2021: 2
- FWCI
- 3.70
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- Russian Science Foundation (19-71-10092)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Keywords
- de novo genome assembly, quantum annealing, quantum-inspired optimization, quantum annealers, combinatorial optimization, simulated quantum annealing
- MeSH terms
- Algorithms, Computer Simulation, DNA, Viral, Humans, Mathematics, Bacteriophage phi X 174, Quantum Theory, Genome, Viral, Sequence Analysis, DNA, Computational Biology, Genomics, Datasets as Topic
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.
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: Genome assembly using quantum and quantum-inspired annealing. https://app.cochat.ai/papers/10.1038/s41598-021-88321-5
- The paper
- Boev, A. S., Rakitko, A. S., Usmanov, S. R., Kobzeva, A. N., Popov, I. V., Ilinsky, V. V., Kiktenko, E. O., & Fedorov, A. K. (2021). Genome assembly using quantum and quantum-inspired annealing. Scientific Reports. https://doi.org/10.1038/s41598-021-88321-5
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.