量子Oracle审讯:以几乎一半的价格获得所有信息
Quantum Oracle Interrogation: Getting all information for almost half the price
摘要:
考虑量子计算机与域大小为N的二进制预言机的组合。它示出了如何N/2+sqrt(N)调用的oracle是足够的猜测的整个内容的oracle(是一个N位字符串)的概率大于95%。这与传统计算机的能力形成了鲜明对比,传统计算机需要N次调用才能完成相同的任务。从这个结果可以得出,如果我们允许很小的错误概率,任何以Oracle的N位作为输入的函数都可以使用N/2+sqrt(N)查询来计算。它还表明,这个错误概率可以任意小,通过使用N/2+O(sqrt(N))Oracle查询。该条第二部分考虑了“近似讯问”。这是当仅请求N个oracle位的某一部分时。在这种情况下,量子算法也优于经典协议。给出了一个例子,其中具有N/10个查询的量子过程返回一个字符串,其中80%的位是正确的。任何经典协议都需要6 N/10个查询来建立这样的正确率。
英文摘要:
Consider a quantum computer in combination with a binary oracle of domain size N. It is shown how N/2+sqrt(N) calls to the oracle are sufficient to guess the whole content of the oracle (being an N bit string) with probability greater than 95%. This contrasts the power of classical computers which would require N calls to achieve the same task. From this result it follows that any function with the N bits of the oracle as input can be calculated using N/2+sqrt(N) queries if we allow a small probability of error. It is also shown that this error probability can be made arbitrary small by using N/2+O(sqrt(N)) oracle queries. In the second part of the article `approximate interrogation' is considered. This is when only a certain fraction of the N oracle bits are requested. Also for this scenario does the quantum algorithm outperform the classical protocols. An example is given where a quantum procedure with N/10 queries returns a string of which 80% of the bits are correct. Any classical protocol would need 6N/10 queries to establish such a correctness ratio.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。