Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig  Home/Search
Context Related
Links: ACM DBLP | nec.com/homepages/fortnow/pa...qprop.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: nec.com/homepages/fortnow/pape... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A language L has a property tester if there exists a probabilistic algorithm that given an input x only asks a small number of bits of x and distinguishes the cases as to whether x is in L and x has large Hamming distance from all y in L. We de ne a similar notion of quantum property testing and show that there exist languages with quantum property testers but no good classical testers. We also show there exist languages which require a large number of queries even for quantumly testing.... (Update)
Context of citations to this paper: More
...quantum counterparts, a quantum counterpart of the notion of property testing is being developed as well. There are already results in [14] showing that in some cases quantum computers can eciently test properties that classical computer cannot, while some other properties...
Cited by: More
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004) (Correct)
The art of uninformed decisions: A primer to property testing - Fischer (2001) (Correct)
Active bibliography (related documents): More All
0.6: Testing Hypergraph Coloring - Czumaj, Sohler (2001) (Correct)
0.4: Testing Convex Position - Czumaj, Sohler, Ziegler (2000) (Correct)
0.2: Testing Euclidean Minimum Spanning Trees in the Plane + - Artur Czumaj Department (Correct)
Similar documents based on text: More All
0.3: Probabilistic abstraction for model checking: An.. - Laplante.. (Correct)
0.2: Property Testers For Dense Non-Boolean Constraint.. - Andersson, Engebretsen (Correct)
0.2: CNF Properties are Hard to Test - Ben-Sasson, Harsha, Raskhodnikova (2002) (Correct)
Related documents from co-citation: More All
2: Property testing and its connection to learning and approximation - Goldreich, Goldwasser et al.
2: Regular languages are testable with a constant number of queries - Alon, Krivelevich et al. - 1999
2: Property testing - Ron - 2000
BibTeX entry: (Update)
H. Buhrman, L. Fortnow, I. Newman and H. Rohrig, Quantum property testing, manuscript. http://citeseer.ist.psu.edu/article/buhrman01quantum.html More
@inproceedings{ buhrman01quantum,
author = "Buhrman and Durr and Heiligman and Hoyer and Magniez and Santha and de Wolf",
title = "Quantum Algorithms for Element Distinctness",
booktitle = "{SCT}: Annual Conference on Structure in Complexity Theory",
year = "2001",
url = "citeseer.ist.psu.edu/article/buhrman01quantum.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996 ACM DBLP
173 Quantum complexity theory - Bernstein, Vazirani - 1997 ACM DBLP
167 Property testing and its connection to learning and approxim.. - Goldreich, Goldwasser et al. - 1998 ACM DBLP
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000 ACM
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997 ACM DBLP
144 the power of quantum computation - Simon - 1997
115 Robust characterizations of polynomials with applications to.. - Rubinfeld, Sudan - 1996 DBLP
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986 ACM DBLP
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997 ACM DBLP
49 Quantum lower bounds by polynomials - Beals, Buhrman et al. - 1998 ACM DBLP
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, yer - 1997 ACM DBLP
33 Regular languages are testable with a constant number of que.. - Alon, Newman et al. - 1999 ACM DBLP
24 Property testing - Ron - 2000 ACM
23 Probabilistic computations: Toward a unied measure of comple.. (context) - C-C - 1977
19 Ecient testing of large graphs - Alon, Fischer et al. - 1999
14 Three theorems regarding testing graph properties - Goldreich, Trevisan - 2001 ACM DBLP
13 Testing subgraphs in large graphs (context) - Alon - 2001 ACM DBLP
11 Testing graphs for colorability properties - Fischer - 2001 DBLP
9 Testing of matrix properties - Fischer - 2001 ACM DBLP
8 Self-testing and self-correcting programs (context) - Blum, Luby et al. - 1993
6 Combinatorial property testing (context) - Goldreich - 1998
5 Journal of Computer and System Sciences (context) - Erg, Kannan et al. - 2000
2 Private communication (context) - yer - 2001
2 Private communication (context) - Szegedy - 1999
Documents on the same site (http://www.neci.nj.nec.com/homepages/fortnow/papers/): More
Diagonalization - Fortnow (2000) (Correct)
Time-Space Tradeoffs for Nondeterministic Computation - Fortnow, van Melkebeek (2000) (Correct)
Computational Depth - Antunes, Fortnow (2001) (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