Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies
Quantum Physics
2025-10-14 v1
Abstract
We present a quantum algorithm in bioinformatics for solving the Binary Near-Perfect Phylogeny Problem (BNPP) with a complexity bound of , 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 in the circuit model.
Cite
@article{arxiv.2510.09911,
title = {Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies},
author = {Lingfa Meng and David Salvador Novo and Albert H. Werner and Samir Bhatt},
journal= {arXiv preprint arXiv:2510.09911},
year = {2025}
}