We discuss the question of the existence of quantum one-way permutations. First, we consider the question: if a state is difficult to prepare, is the reflection operator about that state difficult to construct? By revisiting Grover's algorithm, we present the relationship between this question and the existence of quantum one-way permutations. Next, we prove the equivalence between inverting a permutation and that of constructing polynomial size quantum networks for reflection operators about a class of quantum states. We will consider both the worst case and the average case complexity scenarios for this problem. Moreover, we compare our method to Grover's algorithm and discuss possible applications of our results.
|Number of pages||20|
|Journal||Quantum Information and Computation|
|Publication status||Published - 2002|