Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Advanced Science

Derivation of optimal sequence alignment using quantum annealing

Tatsuya AKAMATSU, Hironori Makino

Published Jan 1, 2025• 0 citations
Publisher

Abstract

Gene sequence-alignment is an important technique in the research field of bioinformatics, providing a fundamental approach to elucidating the structure and function of organisms and their evolutionary relationships.This method enables the correct assessment of the similarity of gene sequences between organisms.On the other hand, information processing to obtain optimal alignment results is NP-complete problem and requires huge computational resources when processing large sequence data.Quantum computation has the potential to provide an innovative approach to this type of problem.In this paper, we propose an alignment method using quantum annealing, an effective computational technique of quantum computing for combinatorial optimization problems, and report the results of validating its effectiveness on computer simulations.

DOI
10.2978/jsas.37102

Related papers

Quantum Bioinformatics: Gene Sequence Alignment Based on Quantum Entanglement

Jincheng Zhang

This paper introduces a novel approach to gene sequence alignment leveraging the principles of quantum entanglement. Traditional gene sequence alignment methods face significant computational challenges, particularly with increasing genome sizes, leading to slow processing times and limitations in accuracy. Our proposed methodology encodes gene sequences into qubits and utilizes quantum entanglement to establish correlations between sequences, dramatically accelerating the alignment process. We present a theoretical framework outlining the core claim, mechanism, and potential advantages of this approach. The theoretical model focuses on exploiting quantum superposition and entanglement to explore the vast solution space of possible alignments concurrently, offering a significant speedup compared to classical algorithms. We detail the mathematical formulation of the entanglement-based alignment process, including the key equations governing the correlation probability and the estimated reduction in computational complexity. The core aim is to demonstrate the feasibility of using quantum entanglement to enhance gene sequence alignment, potentially revolutionizing bioinformatics research and accelerating the discovery of biological insights.

•Sep 3, 2026•0 citations

Genome assembly using quantum and quantum-inspired annealing

Aleksey S. Boev, Alexander Rakitko, Sergey R. Usmanov +5 more

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 [Formula: see text]X 174 bacteriophage. Our results pave a way for a significant increase in the efficiency of solving bioinformatics problems with the use of quantum computing technologies and, in particular, quantum annealing might be an effective method. 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.

arXiv:2004.06719•Scientific Reports•Jun 23, 2021•63 citations

Bioinformatics Quantum Algorithm

Jincheng Zhang

This paper explores the potential of quantum computing to revolutionize bioinformatics, specifically focusing on enhanced gene sequence analysis and protein structure prediction. The core concept centers around utilizing quantum error correction and quantum computation to accelerate these computationally intensive tasks. We propose a novel algorithm architecture leveraging quantum entanglement and superposition to overcome limitations inherent in classical approaches. The paper details the design of a quantum algorithm for sequence alignment and protein folding, emphasizing the key quantum mechanisms that underpin its enhanced performance. We present a preliminary analysis of the algorithm's potential advantages, focusing on reduced computational complexity and improved accuracy compared to existing classical methods. The research highlights the significance of quantum algorithms in addressing critical challenges within the field of bioinformatics.

•Aug 31, 2026•0 citations

Quantum Bioinformatics

Jincheng Zhang

This paper explores the emerging field of quantum bioinformatics, proposing a novel approach to tackling complex challenges within biological information analysis. Traditional biological data processing often encounters limitations due to the exponential growth of datasets and the computational intensity of tasks like sequence alignment, gene prediction, and protein structure prediction. We posit that quantum computing, leveraging phenomena like superposition and entanglement, offers a paradigm shift capable of dramatically accelerating these calculations. This document details the core concept of representing biological sequences as quantum states and utilizing quantum algorithms – specifically tailored for bioinformatics applications – to perform these computations. The theoretical framework incorporates key quantum principles to enhance efficiency and potentially unlock new insights in biological systems. We present a foundational model for quantum sequence alignment, quantum gene prediction, and quantum protein structure prediction, outlining the mathematical formulations and algorithmic approaches. The potential impact of this work is significant, suggesting a future where quantum bioinformatics becomes a cornerstone of biological research. ---

•Sep 5, 2026•0 citations

Quantum Annealing-Based Combinatorial Optimization Algorithm

Jincheng Zhang

This paper investigates the application of quantum annealing for solving complex combinatorial optimization problems. The core claim is that quantum annealing leverages its global search capabilities to efficiently address such problems. The proposed mechanism involves formulating the combinatorial optimization problem as a quantum annealing problem and utilizing the simulated annealing process within quantum annealing to conduct a search for the optimal solution. This research explores the potential of quantum annealing in practical applications, acknowledging that its application in combinatorial optimization is still in its exploratory phase. The algorithm is designed to minimize the energy of a system described by a Hamiltonian, which evolves over time according to the time-dependent Schrödinger equation. The core of the algorithm lies in mapping the problem's constraints and objective function into this Hamiltonian. The search process is governed by quantum fluctuations, represented by the operator $\hat{H}$, which encourages transitions to lower energy states, effectively navigating the solution space. The effectiveness of the algorithm is evaluated based on the quality of the solution found and the computational resources required. This work provides a foundational exploration of quantum annealing's potential within the field of combinatorial optimization.

•Sep 3, 2026•0 citations

Preliminary Results of Applying Modified MSA Algorithm on Quantum Annealers (MAQ)

M.W. Lee

We propose a modified MSA algorithm on quantum annealers with applications in areas of bioinformatics and genetic sequencing.To understand the human genome, researchers compare extensive sets of these genetic sequences -or their protein counterparts -to identify patterns.This comparison begins with the alignment of the set of (multiple) sequences.However, this alignment problem is considered nondeterministically-polynomial time complete and, thus, current classical algorithms at best rely on brute force or heuristic methods to find solutions.Quantum annealing algorithms are able to bypass this need for sheer brute force due to their use of quantum mechanical properties.However, due to the novelty of these algorithms, many are rudimentary in nature and limited by hardware restrictions.We apply progressive alignment techniques to modify annealing algorithms, achieving a linear reduction in spin usage whilst introducing more complex heuristics to the algorithm.This opens the door for further exploration into quantum computing-based bioinformatics, potentially allowing for a deeper understanding of disease detection and monitoring.

arXiv:2403.17979•The Journal of Computational Science Education•Jul 1, 2023•0 citations
Gene sequence-alignment is an important technique in the research field of bioinformatics, providing a fundamental approach to elucidating the structure and function of organisms and their evolutionary relationships.This method enables the correct assessment of the similarity of gene sequences between organisms.On the other hand, information processing to obtain optimal alignment results is NP-complete problem and requires huge computational resources when processing large sequence data.Quantum computation has the potential to provide an innovative approach to this type of problem.In this paper, we propose an alignment method using quantum annealing, an effective computational technique of quantum computing for combinatorial optimization problems, and report the results of validating its effectiveness on computer simulations.
This paper introduces a novel approach to gene sequence alignment leveraging the principles of quantum entanglement. Traditional gene sequence alignment methods face significant computational challenges, particularly with increasing genome sizes, leading to slow processing times and limitations in accuracy. Our proposed methodology encodes gene sequences into qubits and utilizes quantum entanglement to establish correlations between sequences, dramatically accelerating the alignment process. We present a theoretical framework outlining the core claim, mechanism, and potential advantages of this approach. The theoretical model focuses on exploiting quantum superposition and entanglement to explore the vast solution space of possible alignments concurrently, offering a significant speedup compared to classical algorithms. We detail the mathematical formulation of the entanglement-based alignment process, including the key equations governing the correlation probability and the estimated reduction in computational complexity. The core aim is to demonstrate the feasibility of using quantum entanglement to enhance gene sequence alignment, potentially revolutionizing bioinformatics research and accelerating the discovery of biological insights.
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 [Formula: see text]X 174 bacteriophage. Our results pave a way for a significant increase in the efficiency of solving bioinformatics problems with the use of quantum computing technologies and, in particular, quantum annealing might be an effective method. 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.
This paper explores the potential of quantum computing to revolutionize bioinformatics, specifically focusing on enhanced gene sequence analysis and protein structure prediction. The core concept centers around utilizing quantum error correction and quantum computation to accelerate these computationally intensive tasks. We propose a novel algorithm architecture leveraging quantum entanglement and superposition to overcome limitations inherent in classical approaches. The paper details the design of a quantum algorithm for sequence alignment and protein folding, emphasizing the key quantum mechanisms that underpin its enhanced performance. We present a preliminary analysis of the algorithm's potential advantages, focusing on reduced computational complexity and improved accuracy compared to existing classical methods. The research highlights the significance of quantum algorithms in addressing critical challenges within the field of bioinformatics.
This paper explores the emerging field of quantum bioinformatics, proposing a novel approach to tackling complex challenges within biological information analysis. Traditional biological data processing often encounters limitations due to the exponential growth of datasets and the computational intensity of tasks like sequence alignment, gene prediction, and protein structure prediction. We posit that quantum computing, leveraging phenomena like superposition and entanglement, offers a paradigm shift capable of dramatically accelerating these calculations. This document details the core concept of representing biological sequences as quantum states and utilizing quantum algorithms – specifically tailored for bioinformatics applications – to perform these computations. The theoretical framework incorporates key quantum principles to enhance efficiency and potentially unlock new insights in biological systems. We present a foundational model for quantum sequence alignment, quantum gene prediction, and quantum protein structure prediction, outlining the mathematical formulations and algorithmic approaches. The potential impact of this work is significant, suggesting a future where quantum bioinformatics becomes a cornerstone of biological research. ---
This paper investigates the application of quantum annealing for solving complex combinatorial optimization problems. The core claim is that quantum annealing leverages its global search capabilities to efficiently address such problems. The proposed mechanism involves formulating the combinatorial optimization problem as a quantum annealing problem and utilizing the simulated annealing process within quantum annealing to conduct a search for the optimal solution. This research explores the potential of quantum annealing in practical applications, acknowledging that its application in combinatorial optimization is still in its exploratory phase. The algorithm is designed to minimize the energy of a system described by a Hamiltonian, which evolves over time according to the time-dependent Schrödinger equation. The core of the algorithm lies in mapping the problem's constraints and objective function into this Hamiltonian. The search process is governed by quantum fluctuations, represented by the operator H^\hat{H}H^, which encourages transitions to lower energy states, effectively navigating the solution space. The effectiveness of the algorithm is evaluated based on the quality of the solution found and the computational resources required. This work provides a foundational exploration of quantum annealing's potential within the field of combinatorial optimization.
We propose a modified MSA algorithm on quantum annealers with applications in areas of bioinformatics and genetic sequencing.To understand the human genome, researchers compare extensive sets of these genetic sequences -or their protein counterparts -to identify patterns.This comparison begins with the alignment of the set of (multiple) sequences.However, this alignment problem is considered nondeterministically-polynomial time complete and, thus, current classical algorithms at best rely on brute force or heuristic methods to find solutions.Quantum annealing algorithms are able to bypass this need for sheer brute force due to their use of quantum mechanical properties.However, due to the novelty of these algorithms, many are rudimentary in nature and limited by hardware restrictions.We apply progressive alignment techniques to modify annealing algorithms, achieving a linear reduction in spin usage whilst introducing more complex heuristics to the algorithm.This opens the door for further exploration into quantum computing-based bioinformatics, potentially allowing for a deeper understanding of disease detection and monitoring.