按年被提到
19982014 · 1 次2026
物理与量子›量子计算·arXiv:quant-ph/9802049 · quant-ph

Quantum Lower Bounds by Polynomials

Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf · 1998
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2014-06-19 · 最近 2015-06-18
2不同的人
2活跃月份
2讨论串
180被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes some total Boolean function f with bounded-error using T black-box queries then there is a classical deterministic algorithm that computes f exactly with O(T^6) queries. We also give asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings. Finally, we give new precise bounds for AND, OR, and PARITY. Our results are a quantum extension of the so-called polynomial method, which has been successfully applied in classical complexity theory, and also a quantum extension of results by Nisan about a polynomial relationship between randomized and deterministic decision tree complexity.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论michael_nielsen · 2014-06

“That's right. The search result, however, assumes the only way of accessing the database is through a black box oracle. That's why I wrote "non-oracle" in my previous comment. It's called an oracle because the internals of the black box are assumed to be unknown. That assumption is necessary in order to prove that classical computers need ~ N operations. …”

Performance of quantum computer no better than ordinary PC, say analysts原评论 ↗
评论j2kun · 2015-06

“Yes. They refuted two conjectures 1. From 1998 [1] that the biggest gap in this model between quantum and classical was quadratic. (they got quartic) 2. From 1984 [2] that the biggest randomized/classical gap was something like N^0.75 (they got quadratic) The reason I call these "major" is perhaps not exciting to people outside of academia: smart peopl…”

A query complexity breakthrough原评论 ↗