量子加速器上的DNA读序比对算法
An algorithm for DNA read alignment on quantum accelerators
摘要:
随着小规模量子处理器从实验物理实验室过渡到工业产品,这些处理器使我们能够有效地计算各个领域的重要算法。在本文中,我们提出了一个量子算法,以解决具有挑战性的大数据处理领域的基因组序列重建。本研究描述子序列比对的量子算法的架构感知实现。提出了一种基于汉明距离的近似模式匹配算法QiBAM(quantum indexed bidirectional associative memory)。QiBAM以两种方式扩展了Grover的搜索算法,以允许:(1)基因组学中读取错误所需的近似匹配,以及(2)在DNA序列的量子编码上分布式搜索多个解决方案。这种方法给出了一个二次加速比的经典算法。该算法的完整实现,并使用OpenQL编译器和QX模拟器框架进行验证。这代表了对全栈量子加速基因组测序管道设计的首次探索。开源实现可以在https://github.com/prince-ph0en1x/QAGS上找到。
英文摘要:
With small-scale quantum processors transitioning from experimental physics labs to industrial products, these processors allow us to efficiently compute important algorithms in various fields. In this paper, we propose a quantum algorithm to address the challenging field of big 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, that uses approximate pattern-matching based on Hamming distances. QiBAM extends the Grover's search algorithm in two ways to allow for: (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. This represents a first exploration towards a full-stack quantum accelerated genome sequencing pipeline design. The open-source implementation can be found on https://github.com/prince-ph0en1x/QAGS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。