arXiv (All)
open access
The Quantumly Fast and the Classically Forrious
We study the extremal Forrelation problem, where, provided with oracle access to Boolean functions $f$ and $g$ promised to satisfy either $\operatorname{forr}(f,g)=1$ or $\operatorname{forr}(f,g)=-1$, one must determine (with high probability) which of the two cases holds while performing as few ora
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
- An operational continuum limit of quantum combs#1156262
- Symmetry-resolved entanglement entropy in Wess-Zumino-Witten models#312016
- Operational theory for photonic circuits: generalizing linear optics beyond quantum theory#1141942
- Representation of strongly independent preorders by vector-valued functions#103568
- A probabilistic approach to the Yang--Baxter equation and skew braces#659182
Record · ID 1155113
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