Metraipolis › archive › dc_30e9b2ae8bfb

A Block Decomposed QUBO Workflow for Chromosome-Y Phylogeny Reconstruction — arXiv:2609.29856

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29856
License (as archived)
CC0-1.0
Archived
2026-10-08T04:50:31.190Z
SHA-256 of the archived text
518444334656bcb135ad7ebf1132d1418b210d13c6af7e4a834485d77a073496
Stable URL of this page
https://metraipolis.com/documento/dc_30e9b2ae8bfb

How to cite

A Block Decomposed QUBO Workflow for Chromosome-Y Phylogeny Reconstruction — arXiv:2609.29856 — arXiv (en), https://arxiv.org/abs/2609.29856 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_30e9b2ae8bfb (Metraipolis archive dc_30e9b2ae8bfb, sha256 518444334656bcb135ad7ebf1132d1418b210d13c6af7e4a834485d77a073496)
BibTeX
@misc{dc30e9b2ae8bfb,
  title = {A Block Decomposed QUBO Workflow for Chromosome-Y Phylogeny Reconstruction — arXiv:2609.29856},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29856},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_30e9b2ae8bfb; sha256 518444334656bcb135ad7ebf1132d1418b210d13c6af7e4a834485d77a073496},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29856. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper sets out a computational workflow that reconstructs the phylogeny of human Y-chromosome populations from a Variant Call Format (VCF) file of biallelic Single Nucleotide Polymorphisms (SNP). The two classical phylogenetic decisions - topology selection and root placement - are cast as Quadratic Unconstrained Binary Optimisation (QUBO) problems. The workflow combines two QUBO formulations with an Alternating Direction Method of Multipliers (ADMM) decomposition strategy and a plug-in Digitized Counter-Diabatic Quantum Optimization (DCQO) solver, enabling large phylogenetic optimization problems to be executed across multiple classical or quantum computing resources. The DCQO gate-based optimizer drives each ADMM-block QUBO with short-depth counter-diabatic circuits in the impulse regime, without the necessity for an outer variational loop. The combination of ADMM decomposition and the DCQO block solver facilitates problem sizes that surpass the qubit budget of any individual digital quantum processing unit call, while maintaining the integrity of the original objective. The workflow extracts genotype information from VCF files, reconstructs topology and rooting through two QUBO formulations, and annotates the resulting tree using PhyloTree. The resultant data set comprises a Nexus-annotated rooted tree, in addition to diagnostic figures. The workflow demonstrates the potential of modest-scale QUBO formulations combined with ADMM decomposition to serve as a scalable alternative to greedy heuristics in the domain of population genomics.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-25 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.29856 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T04:28:24.132Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).