Span programs for functions with constant-sized 1-certificates: extended abstract

@inproceedings{Belovs2012SpanPF,
  title={Span programs for functions with constant-sized 1-certificates: extended abstract},
  author={Aleksandrs Belovs},
  booktitle={STOC},
  year={2012}
}
Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the element distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 107 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

01020302012201320142015201620172018
Citations per Year

107 Citations

Semantic Scholar estimates that this publication has 107 citations based on the available data.

See our FAQ for additional information.