112 citations · 350 across the 23 of their papers we have counts for
Showing 2015 · quant-phShow all
2 papers · 2 filters
quant-ph2015★ 4 cited
NAND-Trees, Average Choice Complexity, and Effective Resistance
Stacey Jeffery, Shelby Kimmel
We show that the quantum query complexity of evaluating NAND-tree instances with average choice complexity at most is , where average choice complexity is a measure of th…
quant-ph2015
Approximate Span Programs
Tsuyoshi Ito, Stacey Jeffery
Span programs are a model of computation that have been used to design quantum algorithms, mainly in the query model. For any decision problem, there exists a span program that lea…