Curator's Take
This article presents a fascinating convergence of quantum computing with bioinformatics by adapting Rotary Position Embeddings from large language models to create quantum encodings for DNA sequences. The researchers demonstrate that their quantum encoding preserves meaningful biological information by maintaining correlation between genetic similarity (measured by edit distance) and quantum state fidelity, essentially creating "quantum fingerprints" of genetic material. While their classical RotorMap algorithm already achieves impressive 50-700x speedups over existing DNA mapping tools, the quantum version opens intriguing possibilities for DNA authentication with potential quantum communication advantages. The successful deployment on Quantinuum's hardware, including their latest 98-qubit Helios-1 system, shows this approach is moving beyond theoretical concepts toward practical quantum bioinformatics applications.
— Mark Eatherly
Summary
For strings of letters from a small alphabet, such as DNA sequences, we present a quantum encoding that empirically provides a strong correlation between the Levenshtein edit distance and the fidelity between quantum states defined by the encodings. It is based on the principles of Rotary Position Embeddings (RoPE), employed in modern large language models. Classically, this encoding yields RotorMap - a GPU-accelerated DNA mapping algorithm that achieves speedups of 50-700x over single-thread Minimap2 in proof-of-concept tests on human and maize genomes. For use on quantum devices, we introduce the Angular encoding, which is built from RoPE and directly outputs state preparation circuits. To verify its properties and utility on NISQ devices, we report results of experiments conducted on quantum computers from Quantinuum: the 56-qubit H2-1, H2-2 and the latest 98-qubit Helios-1. As a potential application, we consider a quantum DNA authentication problem and conjecture that a quantum advantage in one-way communication complexity could be achieved over any comparable classical solution.