Quantum Queries on Permutations
K. Iwama and R. Freivalds considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of \(n\)-permutations where \(n\) is an odd number is difficult. There was no example of a permutation problem where quantization can save half of the queries for \((2m+1)\)-permutations if \(m\ge 2\). Even for \((2m)\)-permutations with \(m\ge 2\), the best proved advantage of quantum query algorithms is the result by Iwama/Freivalds where the quantum query complexity is \(m\) but the deterministic query complexity is \((2m-1)\). We present a group of \(5\)-permutations such that the deterministic query complexity is 4 and the quantum query complexity is 2.
- 3.Ambainis, A.: Polynomial degree vs. quantum query complexity. In: Proceedings of FOCS 1998, pp. 230–240 (1998)Google Scholar
- 4.Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of FOCS 1998, pp. 332– 341. Also quant-ph/9802062
- 8.Buhrman, H., Cleve, R., de Wolf, R., Zalka, C.: Bounds for small-error and zero-error quantum algorithms. In: Proceedings of FOCS 1999, pp. 358–368 (1999)Google Scholar