arXiv (All)
open access
The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem
In the quest to identify further quantum algorithms exhibiting superpolynomial speed-ups, a recurring theme is that the complexity of a problem is largely shaped by the input access model. Here, we study this phenomenon for the state hidden subgroup problem (StateHSP), a quantum generalization of th
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
- On the Need for (Quantum) Memory with Short Outputs#1116216
- $\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing#1122456
- Lie-Algebraic Bounds on Quantum Control Time via the Baker-Campbell-Hausdorff Formula#1122898
- A Quantum Bluestein's Algorithm for Arbitrary-Size Quantum Fourier Transform#1052063
- Quantum Information in High-Energy Physics: a top subject#1155402
Record · ID 1130310
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