Patel, Apoorva and Raghunathan, KS and Rungta, Pranaw (2005) Quantum Random Walks without Coin Toss. In: Workshop on Quantum Information, Computation and Communication QICC-2005, February 2005, IIT Kharagpur.
Quantum_Random.pdf - Published Version
Restricted to Registered users only
Download (595Kb) | Request a copy
We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Allied Publishers.|
|Department/Centre:||Division of Physical & Mathematical Sciences > Centre for High Energy Physics|
|Date Deposited:||22 Nov 2011 10:14|
|Last Modified:||22 Nov 2011 10:14|
Actions (login required)