An Almost-Quadratic Lower Bound for Quantum Formula Size
Quantum Physics
2007-05-23 v1 Computational Complexity
Abstract
We show that Nechiporuk's method for proving lower bound 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 (by Yao) states that the majority function does not have a linear-size quantum formula.
Cite
@article{arxiv.quant-ph/9903042,
title = {An Almost-Quadratic Lower Bound for Quantum Formula Size},
author = {Vwani P. Roychowdhury and Farrokh Vatan},
journal= {arXiv preprint arXiv:quant-ph/9903042},
year = {2007}
}
Comments
14 pages, 6 figures