Time/space trade-offs for reversible computation
SIAM Journal on Computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tight bounds on quantum searching
Tight bounds on quantum searching
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum search in structured database
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Random oracles in a quantum world
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A quantum genetic algorithm with quantum crossover and mutation operations
Quantum Information Processing
| Hi-index | 0.00 |
This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded search that takes N steps, can be improved to approximately √N steps. The quantum search algorithm is one of several immediate consequences of this framework. Several novel search-related applications are presented.