Preprint
Sep 2026
The quantum query complexity of the semigroup product problem
It is proved that for monoids with a stable partial order in which the identity is the minimum element, the bounded-error quantum query complexity is at most $\sqrt{n+1}((\beta+2)\log(n+2))^{O(\log(\beta+2))}$.
Troy Lee, M. Santha
· 0 citations