23 citations
Showing quant-phShow all
3 papers · 1 filter
quant-ph2004★ 9 cited
Coins Make Quantum Walks Faster
Andris Ambainis, Julia Kempe, Alexander Rivosh
We show how to search N items arranged on a grid in time , using a discrete time quantum walk. This result for the first time exhibits a…
quant-ph2004★ 3 cited
A polynomial quantum query lower bound for the set equality problem
Gatis Midrijanis
The set equality problem is to tell whether two sets and are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorp…
quant-ph2003
The Complexity of Probabilistic versus Quantum Finite Automata
Gatis Midrijanis
We present a language which is recognizable by a probabilistic finite automaton (PFA) with probability for all with states, with a deterministic fi…