Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables

Information Processing Letters

Volumn 75, Issue 1, 2000, Pages 79-83

  Shi, Yaoyun ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; FOURIER TRANSFORMS; POLYNOMIALS; SENSITIVITY ANALYSIS; VECTORS;

HILBERT SPACE; QUANTUM COMPUTATION;

COMPUTATIONAL COMPLEXITY;

EID: 0034227575     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00069-7     Document Type: Article

References (17)

1. Ambainis A. A note on quantum black-box complexity of almost all Boolean functions. LANL e-print, quantum-ph/9811080:1998.
2. Beals R., Buhrman H., Cleve R., Mosca M., de Wolf R. Quantum lower bounds by polynomials. Proc. 39th Annual Symposium on Foundations of Computer Science. 1998;352-361 IEEE Computer Society Press, Los Alamitos, CA.
3. Boyer M., Brassard G., Høyer P., Tap A. Tight bounds on quantum searching. Fortschritte der Physik. Vol. 46:(4-5):1998;493-505.
4. Bernasconi A. Sensitivity vs. block sensitivity. Inform. Process. Lett. Vol. 59:1996;151-157.
5. Chor B., Gerèb-Grauss M. On the influence of single participants in coin flipping schemes. SIAM J. Discrete Math. Vol. 1:(4):1988;411-415.
6. van Dam W. Quantum oracle interrogation: getting all information for almost half the price. Proc. 39th Annual Symposium on Foundations of Computer Science. 1998;362-367 IEEE Computer Society Press, Los Alamitos, CA.
7. Deutsch D., Jozsa R. Rapid solution of problems by quantum computation. Proc. Roy. Soc. London. Vol. A 439:1992;553-558.
8. Farhi E., Goldstone J., Gutmann S., Sipser M. A limit on the speed of quantum computation in determining parity. Phys. Rev. Lett. Vol. 81:(24):1998;5442-5444.
9. Grover L.K. A fast quantum mechanical algorithm for database search. Proc. 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, PA. 1996;212-219.
10. Kahn J., Kalai G., Linial N. The influence of variables on Boolean functions. Proc. 29th Annual Symposium on Foundations of Computer Science, White Plains, NY. 1988;68-80.
11. Nisan N., Szegedy M. On the degree of Boolean functions as real polynomials. Comput. Complexity. Vol. 4:(4):1994;301-313.
12. Ozhigov Y. Quantum computer cannot speed up iterated applications of a black box. LANL e-print, quant-ph/9712051:1997.
13. Paturi R. On the degree of polynomials that approximate symmetric Boolean functions. Proc. 24th Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia. 1992;468-474.
14. Rubinstein D. Sensitivity vs. black sensitivity of Boolean functions. Combinatorica. Vol. 15:(2):1995;297-299.
15. Simon D. On the power of quantum computation. SIAM J. Comput. Vol. 26:(5):1997;1474-1483.
16. Venkatesh S. Pseudo-average block sensitivity equals average sensitivity. Inform. Process. Lett. Vol. 68:1998;93-95.
17. Zalka C. Grover's quantum searching algorithm is optimal. LANL e-print, quant-ph/9711070:1997.