Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.