Implementation of a quantum sequence alignment algorithm for quantum bioinformatics

• URL: http://arxiv.org/abs/2506.22775v2
• Date: Tue, 01 Jul 2025 05:41:31 GMT
• Title: Implementation of a quantum sequence alignment algorithm for quantum bioinformatics
• Authors: Floyd M. Creevey, Mingrui Jing, Lloyd C. L. Hollenberg,
• Abstract summary: The paper adapts the original QSA algorithm proposed in 2000 to current capabilities and limitations of NISQ-era quantum computers.<n>The implementation is tested in a simulated quantum computer environment to validate the approach and refine the GASP data-loading circuit designs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents the implementation of a quantum sequence alignment (QSA) algorithm on biological data in environments simulating noisy intermediate-scale quantum (NISQ) computers. The approach to quantum bioinformatics adapts the original QSA algorithm proposed in 2000 to current capabilities and limitations of NISQ-era quantum computers and uses a genetic algorithm for state preparation (GASP) to create encoding circuits to load both database and target sequences into the quantum data registers. The implementation is tested in a simulated quantum computer environment to validate the approach and refine the GASP data-loading circuit designs. The results demonstrate the practicalities of deploying the QSA algorithm and exemplify the potential of GASP for data encoding in the realm of quantum circuit design, particularly for complex algorithms in quantum bioinformatics and other data-rich problems.

Related papers

• Simulation of Two-Qubit Grover Algorithm in MBQC with Universal Blind Quantum Computation [0.5755004576310334]
  Universal Blind Quantum Computation protocol provides framework for ensuring function and data privacy in quantum computing.<n>Current quantum cloud computing platforms are limited in their ability to simulate MBQC efficiently.<n>This paper presents an efficient method to simulate MBQC on circuit-based quantum computing platforms.
  arXiv  Detail & Related papers  (2025-03-12T06:29:35Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Exploring Quantum-Enhanced Machine Learning for Computer Vision: Applications and Insights on Noisy Intermediate-Scale Quantum Devices [0.0]
  This study explores the intersection of quantum computing and Machine Learning (ML) It evaluates the effectiveness of hybrid quantum-classical algorithms, such as the data re-uploading scheme and the patch Generative Adversarial Networks (GAN) model, on small-scale quantum devices.
  arXiv  Detail & Related papers  (2024-04-01T20:55:03Z)
• Classification of the Fashion-MNIST Dataset on a Quantum Computer [0.0]
  Conventional methods for encoding classical data into quantum computers are too costly and limit the scale of feasible experiments on current hardware. We propose an improved variational algorithm that prepares the encoded data using circuits that fit the native gate set and topology of currently available quantum computers. We deploy simple quantum variational classifiers trained on the encoded dataset on a current quantum computer ibmq-kolkata and achieve moderate accuracies.
  arXiv  Detail & Related papers  (2024-03-04T19:01:14Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• GASP -- A Genetic Algorithm for State Preparation [0.0]
  We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. GASP can produce more efficient circuits of a given accuracy with lower depth and gate counts than other methods.
  arXiv  Detail & Related papers  (2023-02-22T04:41:01Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• QuantumSkynet: A High-Dimensional Quantum Computing Simulator [0.0]
  Current implementations of quantum computing simulators are limited to two-level quantum systems. Recent advances in high-dimensional quantum computing systems have demonstrated the viability of working with multi-level superposition and entanglement. We introduce QuantumSkynet, a novel high-dimensional cloud-based quantum computing simulator.
  arXiv  Detail & Related papers  (2021-06-30T06:28:18Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Resource-efficient encoding algorithm for variational bosonic quantum simulations [0.0]
  In the Noisy Intermediate Scale Quantum (NISQ) era of quantum computing, quantum resources are limited. We present a resource-efficient quantum algorithm for bosonic ground and excited state computations.
  arXiv  Detail & Related papers  (2021-02-23T19:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.