Topics in matrix analysis
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
An Example of the Difference Between Quantum and Classical Random Walks
Quantum Information Processing
Quantum Walks on the Hypercube
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On mixing in continuous-time quantum walks on some circulant graphs
Quantum Information & Computation
Mixing of quantum walk on circulant bunkbeds
Quantum Information & Computation
Decoherence in quantum walks – a review
Mathematical Structures in Computer Science
The Quantum Complexity of Markov Chain Monte Carlo
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Localization of quantum walks on a deterministic recursive tree
Quantum Information & Computation
Universal mixing of quantum walk on graphs
Quantum Information & Computation
Quantum Information & Computation
Limit theorems for decoherent two dimensional quantum walks
Quantum Information Processing
Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks
Quantum Information Processing
Hi-index | 0.00 |
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315) of a similar phenomenon for discrete-time quantum walks. Our analygicM treatment of continuous-time quantum walks includes a continuous monitoring of all vertices that induces the decoherence process. We identify the dymamics of the probability distribution and observe how mixing times undergo the transition from quantum to classical behavior as our decoherence parameter grows from zero to infinity. Our results show that, for small rates of decoherence, the mixing time improves linearly with decoherence, whereas for large rates of decoherence, the mixing time deteriorates linearly towards the classical limit. In the middle region of decoherence rates, our numerical data confirnm the existence of a unique optimal rate for which the mixing time is minimized.