arXiv (All)
open access
A Framework for Ruling Out Quantum Speedups
We study when partial Boolean functions can (and cannot) exhibit superpolynomial quantum query speedups, and develop a general framework for ruling out such speedups via two complementary lenses: promise-aware complexity measures and function completions. First, we introduce promise versions of stan
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
- Neural Fourier Surrogates for Data Reuploading Quantum Neural Networks#1155776
- Experimental robustness benchmarking of quantum neural networks on a superconducting quantum processor#177067
- Implementation of quantum gates by Floquet analysis of kicked quantum system#924258
- Implementation of quantum gates by Floquet analysis of kicked quantum system#920027
- Efficient Learning of Fermionic Magic States under Free-Fermion Evolution#1144339
Record · ID 1144779
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