The quantum query complexity of the semigroup product problem
quant-ph
Submitted: 2026-09-30
Updated: 2026-09-30
Code: https://github.com/troyjlee/monoid-product
Terminology
Sources
- Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
- A Quantum Query Complexity Trichotomy for Regular Languages
- On the quantum time complexity of divide and conquer
- Representation Theory of Finite Semigroups, Semigroup Radicals and Formal Language Theory
- Quantum Amplitude Amplification and Estimation
- Note on Sunflowers
- Quantum Speedup Based on Classical Decision Trees
- Quantum Walks and Electric Networks
- Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
- Improved Quantum Query Upper Bounds Based on Classical Decision Trees
- Quantum query complexity of some graph problems
- Negative weights make adversaries stronger
- Quantum Subroutine Composition
- Quantum query complexity of state conversion
- Reflections for quantum query algorithms
- Davenport constant for semigroups II
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity