Work

Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies

Year: 2025

Type: preprint

Abstract: We present a quantum algorithm in bioinformatics for solving the Binary Near-Perfect Phylogeny Problem (BNPP) with a complexity bound of $O(8.926^q + 8^q nm2)$, where n is the number of input taxa and m is the sequence length for each taxon with each character in the sequence being a binary bit using the QRAM model. We give another polynomial space exact algorithm for the Minimum Steiner Tree (MST) problem with complexity $O^*(e^{(1+g(k,l))k})$ in the circuit model.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2510.09911

Authors: Meng, Lingfa, Novo, David Salvador, Werner, Albert H., Bhatt, Samir

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7090921522

Cites:

Cited by:

Related to: