跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21994 · v1

An alternate proof of the QMA lower bound for set-size estimation

首次提交 2026-11-17 07:26
版本更新 2026-11-17 07:26
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

In the set-size estimation query task, a query algorithm decides whether an NN-bit input has Hamming weight ≥B\ge B or ≤A\le A (with ≥B\ge B as the yes instances and ≤A\le A as the no instances). When B=2AB = 2A, this is sometimes called approximate counting. The query complexity for this problem with a quantum witness (i.e., QMA\mathsf{QMA} query bounds) was resolved by Aaronson, Kothari, Kretschmer, and Thaler (CCC 2020) and proved using Laurent polynomials. Here we give a morally similar but distinct proof of the lower bound using the polynomial method.

作者备注:5 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 07:26 · 最新观测版本

An alternate proof of the QMA lower bound for set-size estimation

In the set-size estimation query task, a query algorithm decides whether an NN-bit input has Hamming weight ≥B\ge B or ≤A\le A (with ≥B\ge B as the yes instances and ≤A\le A as the no instances). When B=2AB = 2A, this is sometimes called approximate counting. The query complexity for this problem with a quantum witness (i.e., QMA\mathsf{QMA} query bounds) was resolved by Aaronson, Kothari, Kretschmer, and Thaler (CCC 2020) and proved using Laurent polynomials. Here we give a morally similar but distinct proof of the lower bound using the polynomial method.

查看此版本解读 →查看此版本原文 ↗