arXiv (All)
open access
Exact Quantum Query Complexity of the Five-Bit Symmetric Boolean Function $\Exact^5_{3,4}$
Let \(f = \text{EXACT}^5_{3,4}\) be the Boolean function that equals 1 exactly on inputs of Hamming weight 3 or 4. Earlier numerical studies reported success probabilities close to one using three queries, but the existence of an exact three-query algorithm had remained unresolved. This paper settle
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
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#670559
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#668494
- A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds#1296671
- Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity#1062565
- Quantum Query Advantage Requires Space#1077425
Record · ID 1389464
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