Robust Quantum Algorithms with $\eps$-Biased Oracles
| dc.creator | Suzuki, Tomoya | |
| dc.creator | Yamashita, Shigeru | |
| dc.creator | Nakanishi, Masaki | |
| dc.creator | Watanabe, Katsumasa | |
| dc.date | 2006-05-08 | |
| dc.date.accessioned | 2026-07-07T07:15:18Z | |
| dc.date.available | 2026-07-07T07:15:18Z | |
| dc.description | This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with $O(\sqrt{N}/{\eps})$ queries to $\eps$-biased oracles. This improves the known upper bound of $O(\sqrt{N}/{\eps}^2)$ and matches the known lower bound; we answer the conjecture raised by the paper by Iwama et al. affirmatively. We also show a quantum algorithm to cope with the situation in which we have no knowledge about the value of $\eps$. 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 $\eps$. | |
| dc.description | To appear in COCOON'06 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0605077 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0605077 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/113210 | |
| dc.subject | Quantum Physics | |
| dc.title | Robust Quantum Algorithms with $\eps$-Biased Oracles | |
| dc.type | text |