Patel, Apoorva and Raghunathan, KS and Rungta, Pranaw (2005) Quantum random walks do not need a coin toss. In: Physical Review A, 71 (3). 032347-1-6.
Restricted to Registered users only
Download (156Kb) | Request a copy
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 evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement between the coin and the position degrees of freedom from the algorithm, and the results match those obtained with a quantum coin toss instruction.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to American Physical Society.|
|Department/Centre:||Division of Physical & Mathematical Sciences > Centre for High Energy Physics|
|Date Deposited:||30 Apr 2007|
|Last Modified:||19 Sep 2010 04:37|
Actions (login required)