3 papers
quant-ph2026
Time complexity of a monitored quantum search with resetting
Emma C. King, Sayan Roy, Francesco Mattiotti +3
Searching a database is a central task in computer science and is paradigmatic of transport and optimization problems in physics. For an unstructured search, Grover's algorithm pre…
math.CO2025
On average orders of automorphism groups of bilinear maps over finite fields
Markus Bläser, Yinan Li, Youming Qiao +1
Let be a bilinear map of finite vector spaces and over a finite field . We present asymptotic bounds on the number of isomorphism classes…
cs.AI2025
From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
Julian Dörfler, Benito van der Zander, Markus Bläser +1
The framework of Pearl's Causal Hierarchy (PCH) formalizes three types of reasoning: probabilistic (i.e. purely observational), interventional, and counterfactual, that reflect the…