Gilles Brassard, Peter Høyer  Home/Search
Context Related
Links: ACM DBLP | brics.dk/~hoyer/papers/BH97.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/~hoyer/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 worstcase running time. This is achieved by generalizing both Simon's and Grover's algorithms and... (Update)
Cited by: More
Quantum Lower Bounds by Polynomials - Robert Beals University (Correct)
cs.CC/9904019 - Aug Bounds For (Correct)
A quantum Goldreich-Levin theorem - With Cryptographic Applications (Correct)
Similar documents (at the sentence level):
78.6%: An Exact Quantum Polynomial-Time Algorithm for Simon's Problem - Brassard, Høyer (1997) (Correct)
Active bibliography (related documents): More All
0.4: Efficient Quantum Transforms - Høyer (1997) (Correct)
0.2: Quantum Counting - Brassard, Høyer, Tapp (1998) (Correct)
0.1: On The Power of Exact Quantum Polynomial Time - Brassard, Høyer (1996) (Correct)
Similar documents based on text: More All
0.5: Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000) (Correct)
0.4: Tight Bounds on Quantum Searching - Boyer, Brassard, Høyer, Tapp (1998) (Correct)
0.3: Quantum Cryptanalysis of Hash and Claw-Free Functions - Brassard, Høyer, Tapp (1997) (Correct)
Related documents from co-citation: More All
32: A fast quantum mechanical algorithm for database search - Grover - 1996
31: Polynomial-time algorithms for prime factorization and discrete logarithms on a .. - Shor - 1995
24: the power of quantum computation - Simon - 1994
BibTeX entry: (Update)
Gilles Brassard and Peter Høyer, "An exact quantum polynomial-time algorithm for Simon's problem", Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems --- ISTCS '97, June 1997, IEEE Computer Society Press, pp. 12 -- 23. http://citeseer.ist.psu.edu/article/brassard97exact.html More
@inproceedings{ brassard97exact,
author = "Gilles Brassard and Peter Hoyer",
title = "An Exact Quantum Polynomial-Time Algorithm for Simon's Problem",
booktitle = "Israel Symposium on Theory of Computing Systems",
pages = "12-23",
year = "1997",
url = "citeseer.ist.psu.edu/article/brassard97exact.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996 ACM DBLP
175 Logical reversibility of computation (context) - Bennett - 1973
173 Quantum complexity theory - Bernstein, Vazirani
173 Quantum complexity theory - Bernstein, Vazirani - 1993 ACM DBLP
144 the power of quantum computation - Simon - 1994
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992 ACM
124 Elementary gates for quantum computation - Barenco, Bennett et al. - 1995
73 Tight Bounds on Quantum Searching - Boyer, Brassard et al. - 1996 ACM
45 Quantum computation - Berthiaume ACM
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992 DBLP
40 Quantum measurements and the Abelian stabilizer problem (context) - Yu - 1995 DBLP
36 Oracle quantum computing - Berthiaume, Brassard - 1994
16 A quantum jump in computer science (context) - Brassard - 1995 DBLP
8 Quantum physics and computers - Barenco - 1996
3 A note on computing Fourier transformation by quantum progra.. (context) - Cleve - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~hoyer/papers/): More
A Quantum Algorithm for Finding the Minimum - Dürr, Høyer (1996) (Correct)
Tight Bounds on Quantum Searching - Boyer, Brassard, Høyer, Tapp (1998) (Correct)
Quantum Cryptanalysis of Hash and Claw-Free Functions - Brassard, Høyer, Tapp (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC