DocumentCode :
2261725
Title :
An exact quantum polynomial-time algorithm for Simon´s problem
Author :
Brassard, Gilles ; Hoyer, Peter
Author_Institution :
Dept. d´´Inf. et de Recherche Oper., Montreal Univ., Que., Canada
fYear :
1997
fDate :
17-19 Jun 1997
Firstpage :
12
Lastpage :
23
Abstract :
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon´s problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon´s and Grover´s algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box
Keywords :
Turing machines; computational complexity; optical information processing; Simon´s problem; bounded-error probabilistic computer; decision problem; exact quantum polynomial-time algorithm; natural generalization; quantum computers; upper bounds; worst-case running time; Algorithm design and analysis; Error probability; Polynomials; Quadratic programming; Quantum computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Theory of Computing and Systems, 1997., Proceedings of the Fifth Israeli Symposium on
Conference_Location :
Ramat-Gan
Print_ISBN :
0-8186-8037-7
Type :
conf
DOI :
10.1109/ISTCS.1997.595153
Filename :
595153
Link To Document :
بازگشت