Showing 2000Show all
2 papers · 1 filter
quant-ph2000
Quantum Walk on the Line
Ashwin Nayak, Ashvin Vishwanath
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behav…
quant-ph2000
Interaction in Quantum Communication Complexity
Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet th…