Tootfinder

String Diagrams for Defect-Based Surface Code Computing
Mateusz Kupper (Department of Informatics, University of Sussex), Dominic Horsman (Department of Computer Science, University of Oxford), Chris Heunen (School of Informatics, University of Edinburgh), Niel de Beaudrap (Department of Informatics, University of Sussex)
https://arxiv.org…

String Diagrams for Defect-Based Surface Code Computing
Surface codes are a popular choice for implementing fault-tolerant quantum computing. Two-qubit gates may be realised in these codes using only nearest-neighbour interactions, either by lattice surgery or by braiding defects around each other. The effect of lattice surgery operations may be simply described using the ZX-calculus: a graphical language that has proven effective for program design and optimisation. In this work, we formalise a similar description via the ZX-calculus of defect brai…

Compositional Verification of Almost-Sure B\"uchi Objectives in MDPs
Marck van der Vegt, Kazuki Watanabe, Ichiro Hasuo, Sebastian Junges
https://arxiv.org/abs/2508.13087 ht…

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
This paper studies the verification of almost-sure Büchi objectives in MDPs with a known, compositional structure based on string diagrams. In particular, we ask whether there is a strategy that ensures that a Büchi objective is almost-surely satisfied. We first show that proper exit sets -- the sets of exits that can be reached within a component without losing locally -- together with the reachability of a Büchi state are a sufficient and necessary statistic for the compositional verificat…

Treemble: A Graphical Tool to Generate Newick Strings from Phylogenetic Tree Images
John B. Allard, Sudhir Kumar
https://arxiv.org/abs/2508.07081 https://a…

Treemble: A Graphical Tool to Generate Newick Strings from Phylogenetic Tree Images
Phylogenetic trees are ubiquitous and central to biology, but most published trees are available only as visual diagrams and not in the machine-readable newick format. There are thus thousands of published trees in the scientific literature that are unavailable for follow-up analyses, comparisons, supertree construction, etc. Experts can easily read such diagrams, but the manual construction of a newick string is prohibitively laborious. Previous attempts to semi-automate the reading of tree im…

Replaced article(s) found for math.CT. https://arxiv.org/list/math.CT/new
[1/1]:
- Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams
Gabriele Lobbia, Wojciech R\'o\.zowski, Ralph Sarkis, Fabio Zanasi