Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks

Roya Radgohar, S. Salimi

Published Feb 28, 2012• 2 citations
Publisher
DOI
10.1007/s11128-012-0377-8

Related papers

Quantum transport on large-scale sparse regular networks by using continuous-time quantum walk

Xi Li, Hanwu Chen, Mingyou Wu +3 more

Quantum Information Processing•Jul 9, 2020•3 citations

Mixing and Decoherence in Continuous-Time Quantum Walks

Leonid Evgenevich Fedichkin, Dmitry Solenov, Christino Tamon +1 more

APS•Mar 1, 2006•0 citations

Decoherence in quantum walks on one-dimensional regular networks

Roya Radgohar

•Jan 1, 2011•0 citations

Factoring discrete-time quantum walks on distance regular graphs into continuous-time quantum walks

Hanmeng Zhan

Linear Algebra and its Applications•Apr 28, 2022•1 citation

Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks

S. Salimi, Roya Radgohar

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.

arXiv:1001.1034•Jan 7, 2010•0 citations

Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory

S. Salimi

arXiv:0908.4546•Quantum Information Processing•Sep 3, 2009•26 citations
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 2l2l2l nearest neighbors(lll 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.