Metraipolis › archive › dc_321bfc716609

Near-Optimal Separations of Certificate Complexity from Randomized and Quantum Query Complexity — arXiv:2609.11664

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11664
License (as archived)
CC0-1.0
Archived
2026-10-16T06:43:09.538Z
SHA-256 of the archived text
746dbdcc426a4de7d8d00778b3211f373c1b8ca08a884313d4018d32b0624d72
Stable URL of this page
https://metraipolis.com/documento/dc_321bfc716609

How to cite

Near-Optimal Separations of Certificate Complexity from Randomized and Quantum Query Complexity — arXiv:2609.11664 — arXiv (en), https://arxiv.org/abs/2609.11664 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_321bfc716609 (Metraipolis archive dc_321bfc716609, sha256 746dbdcc426a4de7d8d00778b3211f373c1b8ca08a884313d4018d32b0624d72)
BibTeX
@misc{dc321bfc716609,
  title = {Near-Optimal Separations of Certificate Complexity from Randomized and Quantum Query Complexity — arXiv:2609.11664},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11664},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_321bfc716609; sha256 746dbdcc426a4de7d8d00778b3211f373c1b8ca08a884313d4018d32b0624d72},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11664. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study how large the certificate complexity ${C}(f)$ of a total Boolean function can be relative to its randomized and quantum query complexities. We construct a total Boolean function $f$ whose randomized query complexity with one-sided error satisfies ${R}_1(f) = \Theta(\sqrt{{C}(f)})$. This separation is optimal even when two-sided error is allowed. From this construction, we obtain another total Boolean function $F$ with bounded-error quantum query complexity ${Q}(F) = \widetilde O({C}(F)^{1/4})$, attaining the general quartic bound up to polylogarithmic factors. For the same function, both exact and zero-error quantum query complexities are $\widetilde O(\sqrt{{C}(F)})$. We also prove matching lower bounds for these two measures on $F$.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-11 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.11664 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T06:20:50.304Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).