Aug Bounds For Aug Bounds for Small-Error and Zero-Error Quantum Algorithms Harry Buhrman CWI...  Home/Search
Context
Related
| pages.cpsc.ucalgar...l_zero_error_cc.ps 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: pages.cpsc.ucalgary.ca/~cleve/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for quantum versions of amplification problems. Next, we establish nearly optimal quantum-classical... (Update)
Similar documents (at the sentence level):
79.3%: Bounds for Small-Error and Zero-Error Quantum Algorithms - Buhrman, Cleve, de Wolf.. (1999) (Correct)
51.9%: Reducing Error Probability in Quantum Algorithms.. - Buhrmann, Cleve, de.. (1999) (Correct)
Active bibliography (related documents): More All
0.3: Lower Bounds for Quantum Search and Derandomization - Buhrman, de Wolf (1998) (Correct)
0.2: Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (1999) (Correct)
0.2: Quantum and Classical Strong Direct Product Theorems and.. - Klauck, Spalek, de Wolf (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ for-cscc,
author = "Aug Bounds For",
title = "cs.CC/9904019",
url = "citeseer.ist.psu.edu/764090.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1998
60 Generic oracles and oracle classes (context) - Blum, Impagliazzo - 1987
50 Quantum algorithms revisited - Cleve, Ekert et al. - 1998
49 Quantum lower bounds by polynomials - Beals, Buhrman et al. - 1998
46 An exact quantum polynomialtime algorithm for Simon's proble.. - Brassard, Hyer - 1997
45 Quantum computation - Berthiaume - 1997
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1998
32 An oracle builder's toolkit - Fenner, Fortnow et al. - 1993
30 Quantum counting - Brassard, Hyer et al. - 1998
29 classical communication and computation (context) - Buhrman, Cleve et al. - 1998
22 The quantum communication complexity of sampling - Ambainis, Schulman et al. - 1998
22 A framework for fast quantum mechanical algorithms (context) - Grover - 1998
7 Information Processing Letters (context) - Alonso, Reingold et al. - 1993
6 Space-time tradeoffs for graph properties - Dodis, Khanna - 1999
5 The growth of polynomials bounded at equally spaced points (context) - Coppersmith, Rivlin - 1992
Documents on the same site (http://pages.cpsc.ucalgary.ca/~cleve/pubs/): More
The query complexity of order-finding - Richard Cleve Department (Correct)
quant-ph/9802049 - Sep Quantum Lower (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (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