Optimal computation with non-unitary quantum walks

Details Optimal computation with non-unitary quantum walks Optimal computation with non-unitary quantum walks

2006-10-27

arxiv.org/abs/quant-ph/0610240v3

Theoretical Computer Science 394(3) pp187-196 2008

Physics

Quantum Physics

16 pages, 3 eps figures, ELsevier style; v2 clarification added to start of Sec. 4, typos fixed & refs updated; v3 error fixed

Scientific paper

10.1016/j.tcs.2007.12.011

Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random dynamics by comparing the resources required, and examining numerically how the level of quantum correlations varies during the walk. We show numerically that the optimal non-unitary quantum walk proceeds such that the quantum correlations are nearly all removed at the point of the final measurement. This requires only O(log T) random bits for a quantum walk of T steps

Affiliated with

Also associated with

No associations

Rating

Optimal computation with non-unitary quantum walks 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 Optimal computation with non-unitary quantum walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal computation with non-unitary quantum walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170158