Program

Time	Program
8:30–9:00	Registration
9:00–9:50 Chair: Christian Schilling	Alfons Laarman (Invited talk): The Unreasonable Effectiveness of Automated Reasoning in Quantum Computing
9:50–10:20	Coffee break
10:20–11:10 Chair: Christian Schilling	John van de Wetering (Invited talk): Picturing Quantum Software
11:10–11:35	Abhoy Kole and Rolf Drechsler: Performance Gains in Quantum SAT Solvers Using ESOP Encoding
11:35–12:00	Jens Chr. Godskesen: Model Checking Reachability Properties for Quantum Markov Chains
12:00–13:30	Lunch break
13:30–14:20 Chair: Kim G. Larsen	Jørgen Ellegaard Andersen (Invited talk): Replacing Monte Carlo Simulation with Gaussian Boson Sampling
14:20–14:25	Lightning talks
14:25–14:40	Coffee break including poster session Suhaib Al-Rousan, Kim Guldstrand Larsen, Christian Schilling and Max Tschaikowski: Learning Optimal Tensor-Contraction Plans for Scalable Quantum-Circuit Equivalence Checking
14:40–15:05 Chair: Kim G. Larsen	Martin Sachenbacher and Martin Leucker: Towards Monitoring and Diagnosis of Quantum Digital Twins
15:05–15:30	Lorenzo Ceragioli, Fabio Gadducci, Giuseppe Lomurno and Gabriele Tedeschi: The Need for Feasible Non-determinism in Modelling Quantum Protocols
15:30–15:55	Adam Husted Kjelstrøm, Andreas Pavlogiannis and Jaco van de Pol: Efficient Simulation of High-Level Quantum Gates
15:55–16:15	Coffee break
16:15–16:40 Chair: Alfons Laarman	Fatimah Rita Ahmadi and Aleks Kissinger: The ZX-calculus as a Language for Topological Quantum Computation
16:40–17:30	Lukas Burgholzer (Invited talk): SAT for Quantum: From Circuit Mapping over Clifford Synthesis to Optimal State Preparation for Neutral Atom Architectures