What if we could picture quantum computations not as daunting complex matrices, but as simple graphs of nodes and wires? The ZX-calculus offers exactly that: a rigorous graphical language where any quantum circuit can be represented as a network of connected nodes. In this interactive talk, I will introduce the basics of ZX-calculus in an accessible way. We’ll start with a quick refresher on quantum computing (just the basics, there is quantum background requirement for this talk), then see how these concepts translate into colorful ZX-diagrams. Using a handful of intuitive graph transformation rules, we will visually simplify and reason about quantum circuits — almost like solving a puzzle. For example, we’ll demonstrate how the famous quantum teleportation protocol, when depicted in ZX form, collapses into a trivially simple diagram, revealing its essence at a glance.
Along the way, a few fun quiz questions (via Kahoot!) will test and engage your intuition. Beyond the fun, we will discuss why this graphical approach is powerful for research. The ZX-calculus provides a sound framework for optimizing quantum programs and verifying algorithm correctness, and it even reveals surprising connections to combinatorics and algebra (its rewrite rules mirror an underlying Hopf algebra structure). I will also highlight current challenges and my ongoing work — in particular, extending these diagrammatic techniques to qudits (quantum systems with more than two levels), an open problem at the frontier of quantum computing theory. By the end of the talk, you’ll see quantum computing from a new angle and understand why one might say that « quantum computing is just graphs. »
Localisation
Salle de séminaire 4B125 (bâtiment Copernic)
5 Boulevard Descartes 77420 Champs-sur-Marne