Program

Time	Program
8:00–9:00	Registration
9:00–10:00 Chair: Alfons Laarman	Bob Coecke (Keynote): From quantum in pictures to interpretable and scalable quantum AI
10:00–10:30	Coffee break
10:30–11:00 Chair: Ondřej Lengál	Tim Coopmans (Invited talk): Minimal-size decision diagrams for quantum-circuit simulation
11:00–11:20	Arend-Jan Quist, Marc Farreras, Alexis de Colnet, John van de Wetering, and Alfons Laarman: From Tensor Networks to Tractable Circuits, and Back
11:20–11:40	Jaco van de Pol: Optimal Clifford-Circuit Synthesis as SAT and Planning (substitute for: Dimitrios Thanos, Muhammad Mahmoud, and Alfons Laarman: GPU-Accelerated Quantum Simulation of Stabilizer Circuits)
11:40–12:00	Colin Blake: A Complete Equational Presentation of Qudit Circuits via Polycontrolled PROPs
12:00–13:20	Lunch break
13:20–13:50 Chair: Tim Coopmans	Johannes Klaus Fichte (Invited talk): Model Counting: Solving, Complexity, and Applications
13:50–14:20	Markus Hecher (Invited talk): New Insights into Counting Complexity and Quantitative Reasoning with Complex Numbers
14:20–14:40	Joon Lee, Dirck van den Ende, Alfons Laarman, and Henning Basold: Quantum Physics using Weighted Model Counting
14:40–15:00	Max Bannach, Thore Gerlach, Jai Grover, and Dolf Huybrechts: Noisy Quantum Circuit Simulation Via Automated Reasoning
15:00–15:30	Coffee break
15:30–16:00 Chair: Max Bannach	Yu-Fang Chen (Invited talk): Automata-Based Verification of Size-Parameterized Quantum Circuits
16:00–16:20	Jakub Havlík and Ondřej Lengál: Synthesizing Quantum Circuits using SMT and MILP
16:20–16:40	Jad Issa, Christophe Chareton, and Romain Péchoux: Static Resource Analysis of Hybrid Programs with Unbounded Loops
16:40–17:10	Discussion