Robust polynomials and quantum algorithms

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 593-604

  Buhrman, Harry ^a,b   Newman, Ilan ^c   Röhrig, Hein ^d   De Wolf, Ronald ^a  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UNIVERSITY OF HAIFA   (Israel)

^d UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACOUSTIC NOISE; ALGORITHMS; BOOLEAN FUNCTIONS; QUERY LANGUAGES; ROBUSTNESS (CONTROL SYSTEMS);

QUANTUM ALGORITHMS; QUANTUM DECISION TREES; ROBUST POLYNOMIALS;

POLYNOMIALS;

EID: 24144449501     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_49     Document Type: Conference Paper

References (11)

1. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001. Earlier version in FOCS 98.
2. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science, 288(1):21-43, 2002.
3. U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM Journal on Computing, 23(5): 1001-1018, 1994.
4. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of 28th ACM STOC, pages 212-219, 1996.
5. P. Høyer, M. Mosca, and R. de Wolf. Quantum search on bounded-error inputs. In Proceedings of 30th ICALP, volume 2719 of Lecture Notes in Computer Science, pages 291-299. Springer, 2003.
6. K. Iwama, R. Putra, and S. Yamashita. Quantum query complexity of biased oracles. Unpublished manuscript and talk at EQIS conference, September 2003.
7. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
8. G. L. Long, Y. S. Li, W. L. Zhang, and C. C. Tu. Dominant gate imperfection in Grover's quantum search algorithm. Physical Review A, 61:042305, 2000.
9. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. Computational Complexity, 4(4):301-313, 1994. Earlier version in STOC'92.
10. N. Shenvi, K. R. Brown, and K. B. Whaley. Effects of a random noisy oracle on search algorithm complexity. Physical Review A, 68:052313, 2003.
11. M. Szegedy and X. Chen. Computing Boolean functions from multiple faulty copies of input bits. In Proceedings of 5th LATIN, volume 2286 of Lecture Notes in Computer Science, pages 539-553, 2002.