103 citations · 515 across the 33 of their papers we have counts for
34 papers
Parameterised graph theory for tensor networks: entanglement rerouting, structural simplification, and agnostic tomography
Matthias C. Caro, Natalie McHugh, Sergii Strelchuk
Parameterised graph theory studies how the complexity of graph-theoretic problems depends on structural parameters of the input graph. This perspective has proved useful in analysi…
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…
Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States
Floyd M. Creevey, Hitham T. Hassan, James McCafferty +2
As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly impor…
A finite sufficient set of conditions for catalytic majorization
David Elkouss, Ananda G. Maity, Aditya Nema +1
The majorization relation has found numerous applications in mathematics, quantum information and resource theory, and quantum thermodynamics, where it describes the allowable tran…
Structure, Positivity and Classical Simulability of Kirkwood-Dirac Distributions
Jędrzej Burkat, Sergii Strelchuk
Kirkwood-Dirac (KD) quasiprobability distributions are increasingly used across quantum information science, yet their computational significance remains unclear. We classify unita…