A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A lower bound on the quantum query complexity of read-once functions
2004
Journal of computer and system sciences (Print)
We establish a lower bound of Oð ffiffi ffi n p Þ on the bounded-error quantum query complexity of read-once Boolean functions. The result is proved via an inductive argument, together with an extension of a lower bound method of Ambainis. Ambainis' method involves viewing a quantum computation as a mapping from inputs to quantum states (unit vectors in a complex inner-product space) which changes as the computation proceeds. Initially the mapping is constant (the state is independent of the
doi:10.1016/j.jcss.2004.02.002
fatcat:gsbj7e4vzrfqdpvdy4qt6wnoby