Quantum search with variable times

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 49-60

  Ambainis, Andris ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

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

INFORMATION DISSEMINATION;

EID: 45749127417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

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