Towards compositional interpretability for xai

S Tull, R Lorenz, S Clark, I Khan, B Coecke - arxiv preprint arxiv …, 2024 - arxiv.org
Artificial intelligence (AI) is currently based largely on black-box machine learning models
which lack interpretability. The field of eXplainable AI (XAI) strives to address this major …

Advances in machine learning optimization for classical and quantum photonics

M Sanchez, C Everly, PA Postigo - JOSA B, 2024 - opg.optica.org
The development and optimization of photonic devices and various other nanostructure
electromagnetic devices present a computationally intensive task. Much optimization relies …

The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification

B Poór, RI Booth, T Carette, J Van De Wetering… - arxiv preprint arxiv …, 2023 - arxiv.org
We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-
dimensional qudits (ie qupits). We derive a simplified rule set that closely resembles the …

Light-matter interaction in the ZXW calculus

G de Felice, RA Shaikh, B Poór, L Yeh, Q Wang… - arxiv preprint arxiv …, 2023 - arxiv.org
In this paper, we develop a graphical calculus to rewrite photonic circuits involving light-
matter interactions and non-linear optical effects. We introduce the infinite ZW calculus, a …

An introduction to string diagrams for computer scientists

R Piedeleu, F Zanasi - arxiv preprint arxiv:2305.08768, 2023 - arxiv.org
This document is an elementary introduction to string diagrams. It takes a computer science
perspective: rather than using category theory as a starting point, we build on intuitions from …

Quantum picturalism: learning quantum theory in high school

S Dündar-Coecke, L Yeh, C Puca… - 2023 IEEE …, 2023 - ieeexplore.ieee.org
Quantum theory is often regarded as challenging to learn and teach, with advanced
mathematical prerequisites ranging from complex numbers and probability theory to matrix …

Automated reasoning in quantum circuit compilation

D Thanos, A Villoria, S Brand, AJ Quist, J Mei… - … Symposium on Model …, 2024 - Springer
Automated reasoning techniques have been proven of immense importance in classical
applications like formal verification, circuit design and probabilistic inference. The domain of …

Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions

M Koch, R Yeung, Q Wang - arxiv preprint arxiv:2307.01803, 2023 - arxiv.org
Recent advances in classical simulation of Clifford+ T circuits make use of the ZX calculus to
iteratively decompose and simplify magic states into stabiliser terms. We improve on this …

Automating Equational Proofs in Dirac Notation

Y Xu, G Barthe, L Zhou - Proceedings of the ACM on Programming …, 2025 - dl.acm.org
Dirac notation is widely used in quantum physics and quantum programming languages to
define, compute and reason about quantum states. This paper considers Dirac notation from …

Mixed-dimensional quantum circuit simulation with decision diagrams

K Mato, S Hillmich, R Wille - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
Quantum computers promise to solve several categories of problems faster than classical
computers ever could. Current research mostly focuses on qubits, ie, systems where the unit …