量子公式的一个下界及其模拟
Quantum Formulas: a Lower Bound and Simulation
摘要:
我们表明,Nechiporuk的方法证明布尔公式的下界可以扩展到量子的情况下。这导致计算显式函数的量子公式的$Ω(n^2 / \log^2 n)$下界。先前唯一已知的量子公式的显式下限表明多数函数不具有线性尺寸的量子公式。我们还表明,量子公式可以模拟布尔电路几乎相同的大小。
英文摘要:
We show that Nechiporuk's method for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an $Ω(n^2 / \log^2 n)$ lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas states that the majority function does not have a linear-size quantum formula. We also show that quantum formulas can be simulated by Boolean circuits of almost the same size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。