14 citations · 69 across the 19 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
quant-ph2015★ 6 cited
Doubling the Success of Quantum Walk Search Using Internal-State Measurements
Krišjānis Prūsis, Jevgēnijs Vihrovs, Thomas G. Wong
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in thi…
cs.CC2015★ 2 cited
Sensitivity versus Certificate Complexity of Boolean Functions
Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomia…