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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Meng, Lingfa, Novo, David Salvador, Werner, Albert H., Bhatt, Samir
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911203735896064
author Meng, Lingfa
Novo, David Salvador
Werner, Albert H.
Bhatt, Samir
author_facet Meng, Lingfa
Novo, David Salvador
Werner, Albert H.
Bhatt, Samir
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2510_09911
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies
Meng, Lingfa
Novo, David Salvador
Werner, Albert H.
Bhatt, Samir
Quantum Physics
81P68 (Primary), 68Q12 (Secondary)
F.2.2
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.
title Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies
topic Quantum Physics
81P68 (Primary), 68Q12 (Secondary)
F.2.2
url https://arxiv.org/abs/2510.09911