Graphical Primitive Recursion for String Diagrams - PLanQC'24

Explore a groundbreaking approach to incorporating primitive recursion in graphical languages for symmetric monoidal categories. Learn how to convert diagrams into executable code, enabling graphical languages like the ZX calculus to express and prove recursive algorithms. Delve into two distinct semantics for recursive diagrams: translating them into endofunctor algebras for paramorphism-based primitive recursion modeling, and interpreting them as coend compositions. Witness the practical application of this technique through a detailed depiction of the Quantum Fourier Transform in this 20-minute conference talk presented at PLanQC'24 by Zhulien Zhelezchev and Aleks Kissinger.

[PLanQC'24] Graphical Primitive Recursion For String Diagrams