Quantum search with variable times

Theory of Computing Systems

Volumn 47, Issue 3, 2010, Pages 786-807

  Ambainis, Andris ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

Quantum algorithms; Quantum search

Indexed keywords

LOWER BOUNDS; POLYLOGARITHMIC; QUANTUM ALGORITHMS; QUANTUM SEARCH; READ-ONCE FUNCTIONS; SEARCH ALGORITHMS; SEARCH PROBLEM; VARIABLE TIME;

ALGORITHMS; QUANTUM THEORY;

INFORMATION DISSEMINATION;

EID: 77953324460     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-009-9219-1     Document Type: Article

References (17)

1. Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory Comput. 1, 47-79 (2005). quant-ph/0303041.
2. Ambainis, A.: Quantum search algorithms. SIGACT News 35, 22-35 (2004). quant-ph/0504012.
3. Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37, 210-239 (2007). Also FOCS'04 and quant-ph/0311001.
4. 1/2+o(1) on a quantum computer. In: Proceedings of FOCS'07, pp. 363-372 (2007).
5. Barnum, H., Saks, M.: A lower bound on the quantum complexity of read once functions. J. Comput. Syst. Sci. 69, 244-258 (2004).
6. Brassard, G., Høyer, P., Tapp, A.: Quantum counting. In: Proceedings of ICALP'98, pp. 820-831 (1998). quant-ph/9805082.
7. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information Science. AMS Contemporary Mathematics Series, vol. 305, pp. 53-74. AMS, Providence (2002). quant-ph/0005055.
8. Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: Proceedings of SODA'06, pp. 880-889 (2006). quant-ph/0409035.
9. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of STOC'98, pp. 63-68 (1998). quant-ph/9702040.
10. Buhrman, H., Durr, C., Heiligman, M., Høyer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum algorithms for element distinctness. SIAM J. Comput. 34(6), 1324-1330 (2005). quant-ph/0007016.
11. Farhi, E., Goldstone, J., Gutman, S.: A quantum algorithm for the Hamiltonian NAND tree. quant-ph/0702144.
12. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of STOC'96, pp. 212-219 (1996).
13. Høyer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Proceedings of ICALP'03. Lecture Notes in Computer Science, vol. 2719, pp. 291-299. Springer, Berlin (2003). quant-ph/0304052.
14. Høyer, P., Lee, T., Špalek, R.: Tight adversary bounds for composite functions. quant-ph/0509067.
15. Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. Algorithmica 48(3), 221-232 (2007). Also ICALP'05 and quant-ph/0506265.
16. Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413-424 (2007). Also SODA'05 and quant-ph/0310134.
17. Reichardt, B., Spalek, R.: Span-program-based quantum algorithm for evaluating formulas. In: Proceedings of STOC'2008, pp. 103-112 (2008).