Span programs for functions with constant-sized 1-certificates

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 77-84

  Belovs, Aleksandrs ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

quantum algorithms

Indexed keywords

COMPUTATIONAL MODEL; GROVER ALGORITHM; HIDDEN SUBGROUP PROBLEM; QUANTUM ALGORITHMS; QUANTUM QUERY ALGORITHM; QUANTUM WALK; QUERY COMPLEXITY; SPAN PROGRAMS;

ALGORITHMS; QUANTUM THEORY;

COMPUTATION THEORY;

EID: 84862590731     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2213985     Document Type: Conference Paper

References (18)

1. S. Aaronson and Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM, 51(4):595-605, 2004.
2. A. Ambainis. Quantum lower bounds for collision and element distinctness with small range. Theory of Computing, 1:37-46, 2005.
3. A. Ambainis. Quantum walk algorithm for element distinctness. SIAM Journal on Computing, 37:210-239, 2007. (Pubitemid 351321994)
4. A. Belovs and T. Lee. Quantum algorithm for k-distinctness with prior knowledge on the input. Technical Report 1108.3022, arXiv, 2011.
5. A. Belovs and B. Reichardt. Span programs and quantum algorithms for st-connectivity and claw detection. Technical Report 1203.2603, arXiv, 2012.
6. B. Bollobás. Modern Graph Theory. Springer, 1998.
7. G. Brassard, P. H. yer, and A. Tapp. Quantum algorithm for the collision problem. In Proc. 3rd LATIN, pages 163-169, 1998.
8. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288.
9. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. SIAM Journal on Computing, 34(6):1324-1330.
10. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proc. 28th ACM STOC, pages 212-219.
11. R. Kothari and R. Mittal. Personal communication, 2011.
12. T. Lee, F. Magniez, and M. Santha. A learning graph based quantum query algorithm for finding constant-size subgraphs. Technical Report 1109.5135, arXiv, 2011.
13. F. Magniez, M. Santha, and M. Szegedy. Quantum algorithms for the triangle problem. SIAM Journal on Computing, 37(2):413-424.
14. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000.
15. B. Reichardt. Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function. Technical Report 0904.2759, arXiv, 2009.
16. B. Reichardt. Reflections for quantum query algorithms. In Proc. 22nd ACM-SIAM SODA, pages 560-569, 2011.
17. B. Reichardt and R. Špalek. Span-program-based quantum algorithm for evaluating formulas. In Proc. 40th ACM STOC, pages 103-112.
18. Y. Zhu. Quantum query complexity of subgraph containment with constant-sized certificates. Technical Report 1109.4165, arXiv, 2011.