Comparison of quantum oracles
A comparison of the query complexity analysis of quantum algorithms was presented. Two different ways of representing a permutation in terms of a black box quantum oracle were provided. A simple promise problem that minimal quantum oracles could solve faster that the classical oracles was discussed....
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2002
|