Publication details

Exact quantum algorithms have advantage for almost all Boolean functions

Authors

AMBAINIS Andris GRUSKA Jozef ZHENG Shenggen

Type Article in Periodical
Magazine / Source Quantum Information & Computation
MU Faculty or unit

Faculty of Informatics

Citation
WWW http://www.rintonpress.com/journals/qiconline.html#v15n56
Field Informatics
Keywords Quantum computing; Quantum query complexity; Boolean function; Symmetric Boolean function; Monotone Boolean function; Read-once Boolean functio n
Description It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that ANDn is the only n-bit Boolean function, up to isomorphism, that requires n queries.
Related projects: