Quantum Random Walks do not need a Coin Toss

Details Quantum Random Walks do not need a Coin Toss Quantum Random Walks do not need a Coin Toss

2004-05-21

arxiv.org/abs/quant-ph/0405128v2

Phys. Rev. A71 (2005) 032347

Physics

Quantum Physics

6 pages, 4 figures, RevTeX (v2) Expanded to include relation to quantum walk with a coin. Connection with Dirac equation point

Scientific paper

10.1103/PhysRevA.71.032347

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 from the algorithm, and the results match those obtained with a quantum coin toss instruction.

Affiliated with

Also associated with

No associations

Rating

Quantum Random Walks do not need a Coin Toss does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Random Walks do not need a Coin Toss, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Random Walks do not need a Coin Toss will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680084