arXiv (All)
open access
Characterizing Quantum Advantage for Generalizations of the Boolean Hidden Matching Problem
We study the one-way communication complexity of the $f$-Boolean Hidden Partition problem. Here, Alice is given an $n$-bit string and Bob is given $Ω(n)$ disjoint blocks of its indices together with a string of labels. Under the promise that the evaluations of $f$ on these blocks either agree with a
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
- Optimal and Verifiable Quantum Advantages in Communication Complexity#1201598
- Decisional Monogamy-of-Entanglement for Coset States and Applications to Unclonable Cryptography with Correlated Challenges#1157301
- Optimal entanglement-assisted source coding under a balanced-difference promise#1109721
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation#1154550
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation#1136751
Record · ID 1215875
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