23 citations · 34 across the 10 of their papers we have counts for
Showing 2004 · quant-phShow all
2 papers · 2 filters
quant-ph2004
Quantum Random Walks do not need a Coin Toss
Apoorva Patel, K. S. Raghunathan, Pranaw Rungta
Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evo…
quant-ph2004
Optimal Database Search: Waves and Catalysis
Apoorva Patel
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical r…