arXiv (All)
open access
The quantum query complexity of the semigroup product problem
We study the quantum query complexity of computing a semigroup product $x_1\cdots x_n$, when one query reveals one input element and the multiplication table is given. For a finite aperiodic semigroup of size $N-1$, the argument of Aaronson, Grier, and Schaeffer gives an upper bound of $\sqrt n\,(N\
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- QMA Lower Bounds for Batch Verification via Approximate Degree#996922
- Quantum Approximate Counting with Bernoulli Oracles#984515
- A polynomial time algorithm for almost bounded denumerant#612421
- A polynomial time algorithm for almost bounded denumerant#610944
- Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography#200399
Record · ID 1145141
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive