2 citations · 3 across the 5 of their papers we have counts for
6 papers
Lossless Reductions and Hybrid Sampling for Phylogeny Using the Maximum Compatibility Criterion
Orson Ye, James Bonfield, Joshua Cudby +2
Maximum compatibility provides a criterion for phylogenetic reconstruction in which the objective is to retain a maximum set of mutually compatible characters. For binary character…
Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly
Josh Cudby, Sergii Strelchuk
Assembling genomes from short-read sequencing data remains difficult in repetitive regions, where reference bias and combinatorial complexity limit existing methods. Pangenome-guid…
Parameterized quantum algorithms for closest string problems
Josh Cudby, Sergii Strelchuk
Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world app…
Pangenome-guided sequence assembly via binary optimisation
Josh Cudby, James Bonfield, Chenxi Zhou +2
De novo genome assembly is challenging in highly repetitive regions; however, reference-guided assemblers often suffer from bias. We propose a framework for pangenome-guided sequen…
Learning Gaussian Operations and the Matchgate Hierarchy
Joshua Cudby, Sergii Strelchuk
Learning an unknown quantum process is a central task for validation of the functioning of near-term devices. The task is generally hard, requiring exponentially many measurements…
Gaussian decomposition of magic states for matchgate computations
Joshua Cudby, Sergii Strelchuk
Magic states, pivotal for universal quantum computation via classically simulable Clifford gates, often undergo decomposition into resourceless stabilizer states, facilitating simu…