Quantum algorithms for evaluating min-max trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5106 LNCS, Issue , 2008, Pages 11-15

  Cleve, Richard ^a,b   Gavinsky, Dmitry ^a   Yonge Mallo, D L ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORESTRY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; QUANTUM THEORY; TREES (MATHEMATICS);

BOUNDED ERRORS; MIN-MAX; QUANTUM ALGORITHMS; QUANTUM LOWER BOUNDS;

QUANTUM COMMUNICATION;

EID: 58049102742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89304-2_2     Document Type: Conference Paper

References (11)

1. Ambainis, A.: Quantum search with variable times (arXiv:quant-ph/0609168)
2. Ambainis, A.: A nearly optimal discrete query quantum algorithm for evaluating NAND formulas (arXiv:quant-ph/0704.3628)
3. Barnum, H., Saks, M.: A lower bound on the query complexity of read-once functions. Journal of Computer and System Science 69(2), 244-258 (2004)
4. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing, SIAM Journal on Computing 26(5), 1510-1523 (1997)
5. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte Der Physik 46(4-5), 493-505 (1998)
6. Childs, A.M., Cleve, R., Jordan, S.P., Yeung, D.L.: Discrete-query quantum algorithm for NAND trees (arXiv:quant-ph/070 (2160))
7. 1/2+ε) (arXiv:quant-ph/0703015)
8. Dudie;rr, C., Høyer, P.: A quantum algorithm for finding the minimum (arXiv:quant-ph/9607014)
9. Farhi, E., Goldstone, J., Gutmann, S.: A Quantum Algorithm for the Hamiltonian NAND Tree (arXiv:quant-ph/0702144)
10. Grover, L.K.: A fast quantum mechanical algorithm for database search, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 212-219 (1996)
11. Saks, M., Wigderson, A.: Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1986), pp. 29-38 (1986)