Invited Speakers

Bob Coecke (keynote)

From quantum in pictures to interpretable and scalable quantum AI Over some 20 years we have developed a compositional quantum formalism, called categorical quantum mechanics or quantum picturalism. We showed that this enabled secondary school students to perform exceptional on an Oxford University post-grad quantum exam. The same formalism has been used as the basis for a compositional interpretable formalism for NLP, and AI more generally.

Yu-Fang Chen

Automata-Based Verification of Size-Parameterized Quantum Circuits This talk focuses on how the automata structure in the quantum program verifier AutoQ has evolved, and how these changes enable the verification of size-parameterized quantum circuits. I will explain the motivation behind the new automata design, outline the resulting increase in expressiveness, and discuss what classes of parameterized circuits can now be handled, as well as current limitations.

Tim Coopmans

Minimal-size decision diagrams for quantum-circuit simulation Representing quantum states as decision diagrams can make quantum-circuit simulation significantly faster. In this talk, I will focus on Local-Invertible Map Decision Diagrams and discuss the impact of making such decision diagrams as small as possible by using an algorithm to bring the decision diagram into normal form.

Johannes Klaus Fichte

Model Counting: Solving, Complexity, and Applications In this talk, I will consider model counting, which asks to output the number of solutions to a given input instance. I will present recent complexity results and a solving approach that employs structural parameters (treewidth) for faster solving. While the algorithm provides a theoretical bound, a direct implementation is, unsurprisingly, practically infeasible. Therefore, we turn our attention to a more practical exploitable direction. Finally, I will illustrate practical applications of counting to analyze and navigate solution spaces, including directions that focus on counting for decision spaces rather than entire solution spaces, significantly improving complexity.

Markus Hecher

New Insights into Counting Complexity and Quantitative Reasoning with Complex Numbers In this talk we show recent insights into fine-grained counting complexity and demonstrate how we can efficiently count over semirings and with complex numbers.

Kuldeep Meel

TBA

Christopher Vasko

TBA