arXiv (All)
open access
Small-Bias Quantum Approximate Counting via the Multiplicative Adversary Method
We study the two-weight decision version of quantum approximate counting: given oracle access to $x\in\{0,1\}^N$, distinguish $|x|=M$ from $|x|=M+Δ$ with success probability $1/2+ζ$. Using the multiplicative adversary method, we prove $Ω\left(\max\left\{ζ\sqrt{(N-M)(M+Δ)}/Δ,\sqrt{ζN/Δ}\right\}\right
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
- Effective Euler Sums#987025
- An $m^{2.943}$ Bohnenblust--Hille Bound on the Boolean Cube#1035112
- Exact Asymptotic Efficiency under zCDP: Diameter-Constrained Information Geometry#1123310
- Metrological Benchmarking of Random Quantum Circuits#1144193
- A decision-theoretic approach to dealing with uncertainty in quantum mechanics#183220
Record · ID 996624
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