This paper considers the quantum query complexity of ε-biased oracles that return the correct value with probability only 1/2 + e. In particular, we show a quantum algorithm to compute N-bit OR functions with O(radic;N/ε) queries to ε-biased oracles. This improves the known upper bound of O(radic;N/ε2) and matches the known lower bound; we answer the conjecture raised by the paper [1] affirmatively. We also show a quantum algorithm to cope with the situation in which we have no knowledge about the value of ε. This contrasts with the corresponding classical situation, where it is almost hopeless to achieve more than a constant success probability without knowing the value of ε. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Suzuki, T., Yamashita, S., Nakanishi, M., & Watanabe, K. (2006). Robust quantum algorithms with ε-biased oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 116–125). Springer Verlag. https://doi.org/10.1007/11809678_14
Mendeley helps you to discover research relevant for your work.