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
An Example of the Difference Between Quantum and Classical Random Walks
Quantum Information Processing
Quantum Description of Classical Apparatus: Zeno Effect and Decoherence
Quantum Information Processing
One-Dimensional Continuous-Time Quantum Walks
Quantum Information Processing
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Decoherence in quantum walks – a review
Mathematical Structures in Computer Science
One-dimensional discrete-time quantum walks on random environments
Quantum Information Processing
Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
Quantum Information Processing
Mixing and decoherence in continuous-time quantum walks on cycles
Quantum Information & Computation
Quantum Information & Computation
| Hi-index | 0.00 |
In this paper, we study mixing and large decoherence in continuous-time quantum walks on one dimensional regular networks, which are constructed by connecting each node to its 2l nearest neighbors (l on either side). In our investigation, the nodes of network are represented by a set of identical tunnel-coupled quantum dots in which decoherence is induced by continuous monitoring of each quantum dot with nearby point contact detector. To formulate the decoherent CTQWs, we use Gurvitz model and then calculate probability distribution and the bounds of instantaneous and average mixing times. We show that the mixing times are linearly proportional to the decoherence rate. Moreover, adding links to cycle network, in appearance of large decoherence, decreases the mixing times.