Cited by 36Quantum Computing Algorithms and ArchitectureAlgorithms and Data CompressionDNA and Biological Computing

QiBAM: approximate sub-string index search on quantum accelerators applied to DNA read alignment

Open access
Sarkar, Aritra, Al-Ars, Zaid, Almudever, Carmen G., Bertels, Koen L. M.·2021·Electronics

Abstract

With small-scale quantum processors transitioning from experimental physics labs to industrial products, these processors in a few years are expected to scale up and be more robust for efficiently computing important algorithms in various fields. In this paper, we propose a quantum algorithm to address the challenging field of data processing for genome sequence reconstruction. This research describes an architecture-aware implementation of a quantum algorithm for sub-sequence alignment. A new algorithm named QiBAM (quantum indexed bidirectional associative memory) is proposed, which uses approximate pattern-matching based on Hamming distances. QiBAM extends the Grover’s search algorithm in two ways, allowing: (1) approximate matches needed for read errors in genomics, and (2) a distributed search for multiple solutions over the quantum encoding of DNA sequences. This approach gives a quadratic speedup over the classical algorithm. A full implementation of the algorithm is provided and verified using the OpenQL compiler and QX Simulator framework. Our implementation represents a first exploration towards a full-stack quantum accelerated genome sequencing pipeline design.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/electronics10192433

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • It basically extends Grover's search algorithm to allow for errors in the alignment between reads and the reference sequence stored in a quantum memory (QRAM).

    “It basically extends Grover’s search algorithm to allow for errors in the alignment between reads and the reference sequence stored in a quantum memory (QRAM).”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Ventura, D.; Martinez, T. Initializing the amplitude distribution of a quantum state. Found. Phys. Lett. 1999, 12, 547-559. [CrossRef] · DOI
  2. Lao, L.; Manzano, D.M.; van Someren, H.; Ashraf, I.; Almudever, C.G. Mapping of quantum circuits onto NISQ superconducting processors. arXiv 2019, arXiv:1908.04226. · arXiv

Cited by

Sorted by citations

Authors
Sarkar, A., Al-Ars, Z., Almudever, C. G., & Bertels, K. L. M.
Affiliations
  • Delft University of Technology (NL)
  • Department of Quantum & Computer Engineering, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, 2628 CD Delft, The Netherlands
  • KU Leuven (BE)
Corresponding author
Sarkar, Aritra
Venue
Electronics
Publisher
MDPI AG
Published
2021-10-07
Volume
10
Issue
19
Pages
2433
ISSN
2079-9292 (ISSN-L)
OpenAlex
W3204611084
Cited by
20
References
33
Citations by year
2026: 1 · 2025: 6 · 2024: 8 · 2023: 3 · 2022: 2
FWCI
1.15
Type
journal article
Language
en
Open access
Locations
  • Electronics (publishedVersion, cc-by)
  • Lirias (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Research Repository (Delft University of Technology) (submittedVersion, cc-by)
  • Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
Keywords
quantum computing, approximate pattern matching, Hamming distance, Grover's algorithm, quantum accelerators, distributed search

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