Faster quantum algorithm for evaluating game trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 546-559

  Reichardt, Ben W ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; QUANTUM THEORY;

COMPOSITION METHOD; DIRECT SUM; GAME TREES; QUANTUM ALGORITHMS; QUANTUM WALK; SPAN PROGRAMS; TENSOR PRODUCTS;

TREES (MATHEMATICS);

EID: 79955709465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.43     Document Type: Conference Paper

References (19)

1. Andris Ambainis. A nearly optimal discrete query quantum algorithm for evaluating NAND formulas. 2007, arXiv:0704.3628 [quant-ph].
2. Andris Ambainis. Quantum search with variable times. In Proc. 25th STAGS, pages 49-61, 2008, arXiv:quant-ph/0609168.
3. 1/2+0(1) on a quantum computer. SIAM J. Comput., 39(6):2513-2530, 2010. Earlier version in FOCS'07.
4. Howard Barnum and Michael Saks. A lower bound on the quantum query complexity of read-once functions. J. Comput. Syst. Sci., 69(2):244-258, 2004, arXiv:quant-ph/0201007.
5. Maria Luisa Bonet and Samuel R. Buss. Size-depth tradeoffs for Boolean formulae. Information Processing Letters, 49(3):151-155, 1994. (Pubitemid 124012538)
6. Nader H. Bshouty, Richard Cleve, and Wayne Eberly. Size-depth tradeoffs for algebraic formulae. In Proc. 32nd IEEE FOCS, pages 334-341, 1991.
7. Harry Buhrman, Richard Cleve, and Avi Wigderson. Quantum vs. classical communication and computation. In Proc. 30th ACM STOC, pages 63-68, 1998, arXiv:quant-ph/9802040.
8. Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum algorithm for the Hamiltonian NAND tree. Theory of Computing, 4:169-190, 2008, arXiv:quant-ph/0702144.
9. Lov K. Grover. A fast quantum mechanical algorithm for database search. In Proc. 28th ACM STOC, pages 212-219, 1996, arXiv:quant-ph/9605043.
10. Peter Høyer, Troy Lee, and Robert Špalek. Negative weights make adversaries stronger. In Proc. 39th ACM STOC, pages 526-535, 2007, arXiv:quant-ph/0611054. (Pubitemid 47630772)
11. Peter Høyer, Michele Mosca, and Ronald de Wolf. Quantum search on bounded-error inputs. In Proc. 30th ICALP, pages 291-299, 2003, LNCS 2719, arXiv:quant-ph/0304052.
12. Mauricio Karchmer and Avi Wigderson. On span programs. In Proc. 8th IEEE Symp. Structure in Complexity Theory, pages 102-111, 1993. (Pubitemid 23688021)
13. Ben W. Reichardt. Span-program-based quantum algorithm for evaluating unbalanced formulas. 2009, arXiv:0907.1622 [quant-ph].
14. Ben W. Reichardt. Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function. 2009, arXiv:0904.2759 [quant-ph]. Extended abstract in Proc. 50th IEEE FOCS, pages 544-551, 2009.
15. Ben W. Reichardt. Least span program witness size equals the general adversary lower bound on quantum query complexity. Technical Report TR10-075, Electronic Colloquium on Computational Complexity, http://eccc.hpi-web.de, 2010.
16. Ben W. Reichardt. Reflections for quantum query algorithms. 2010, arXiv: 1005.1601 [quant-ph].
17. Ben W. Reichardt. Span programs and quantum query algorithms. Technical Report TR10-110, Electronic Colloquium on Computational Complexity, http://eccc.hpi-web.de, 2010.
18. Ben W. Reichardt and Robert Spalek. Span-program-based quantum algorithm for evaluating formulas. In Proc. 40th ACM STOC, pages 103-112, 2008, arXiv:0710.2630 [quant-ph].
19. Mario Szegedy. Quantum speed-up of Markov chain based algorithms. In Proc. 45th IEEE FOCS, pages 32-41, 2004. (Pubitemid 40575264)