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

arXiv:quant-ph/0509163 · Quantum Information and Computation

Mixing and decoherence in quantum walks on cycles

Leonid Evgenevich Fedichkin, Dmitry Solenov, Christino Tamon

Published May 1, 2006• 53 citations
arXivHTMLPDF

Abstract

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 analytical treatment of continuous-time quantum walks includes a continuous monitoring of all vertices that induces the decoherence process. We identify the dynamics 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 confirms the existence of a unique optimal rate for which the mixing time is minimized.

DOI
10.26421/qic6.3-3

Related papers

Mixing and decoherence in continuous-time quantum walks on long-range interacting cycles

S. Salimi, Roya Radgohar

We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles, which are constructed by connecting all the two nodes of distance m on the cycle graph. In our investigation, each node is continuously monitored by an individual point contact, which induces the decoherence process. We obtain the analytical probability distribution and the mixing time upper bound. Our results show that, for small rates of decoherence, the mixing time upper bound is independent of distance parameter m and is proportional to inverse of decoherence rate.

arXiv:0904.1952•Journal of Physics A Mathematical and Theoretical•Oct 29, 2009•8 citations

Continuous-time Quantum Walks on a Cycle

Dmitry Solenov, Leonid Evgenevich Fedichkin

We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point contact. We derive the analytical expression of the probability distribution along the cycle. Upper bound to mixing time is obtained. It is found to be linear in the graph size.

•Jun 13, 2005•2 citations

The effect of large decoherence on mixing time in continuous-time quantum walks on long-range interacting cycles

S. Salimi, R Radgohar

In this paper, we consider decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are the extensions of the cycle graphs. For this purpose, we use Gurvitz's model and assume that every node is monitored by the corresponding point-contact induced by the decoherence process. Then, we focus on large rates of decoherence and calculate the probability distribution analytically and obtain the lower and upper bounds of the mixing time. Our results prove that the mixing time is proportional to the rate of decoherence and the inverse of the square of the distance parameter ( m ). This shows that the mixing time decreases with increasing range of interaction. Also, what we obtain for m = 0 is in agreement with Fedichkin, Solenov and Tamon's results [48] for cycle, and we see that the mixing time of CTQWs on cycle improves with adding interacting edges.

arXiv:0910.5795•Journal of Physics B Atomic Molecular and Optical Physics•Jan 8, 2010•4 citations

Continuous-time quantum walks on a cycle graph

Dmitry Solenov, Leonid Evgenevich Fedichkin

We present an analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with a nearby quantum point contact. We derive an analytical expression of the probability distribution along the cycle. An upper-bound estimate to the mixing time is shown.

arXiv:quant-ph/0506096•Physical Review A•Jan 11, 2006•80 citations

Quantum-classical crossover in quantum walks mixing time

Leonid Evgenevich Fedichkin, Fedor Pavlovich Meshchaninov

Continuous-time quantum walks on a cycle graph are analyzed in the presence of decoherence. The electron evolution in the nanostructure composed of ring of tunnel-coupled semiconductor quantum dots is considered as realistic model for quantum walks on a cycle graph. Quantum-classical crossover from fast quantum dynamics to classical diffusive behavior is observed as decoherence rate parameter grows. The dependence of transition decoherence rate and mixing time versus size of the graph are studied both analytically and numerically.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 30, 2016•5 citations

THE EFFECT OF DECOHERENCE ON MIXING TIME IN CONTINUOUS-TIME QUANTUM WALKS ON ONE-DIMENSIONAL REGULAR NETWORKS

S. Salimi, Roya Radgohar

In this paper, we study decoherence in continuous-time quantum walks (CTQWs) on one-dimensional regular networks. For this purpose, we assume that every node is represented by a quantum dot continuously monitored by an individual point contact (Gurvitz's model). This measuring process induces decoherence. We focus on small rates of decoherence and then obtain the mixing time bound of the CTQWs on the one-dimensional regular network, whose distance parameter is l ≥ 2. Our results show that the mixing time is inversely proportional to the rate of decoherence, which is in agreement with the mentioned results for cycles in Refs. 29 and 37. Also, the same result is provided in Ref. 38 for long-range interacting cycles. Moreover, we find that this quantity is independent of the distance parameter l (l ≥ 2) and that the small values of decoherence make short the mixing time on these networks.

arXiv:0911.4898•International Journal of Quantum Information•Aug 1, 2010•3 citations
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 analytical treatment of continuous-time quantum walks includes a continuous monitoring of all vertices that induces the decoherence process. We identify the dynamics 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 confirms the existence of a unique optimal rate for which the mixing time is minimized.
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles, which are constructed by connecting all the two nodes of distance m on the cycle graph. In our investigation, each node is continuously monitored by an individual point contact, which induces the decoherence process. We obtain the analytical probability distribution and the mixing time upper bound. Our results show that, for small rates of decoherence, the mixing time upper bound is independent of distance parameter m and is proportional to inverse of decoherence rate.
In this paper, we consider decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are the extensions of the cycle graphs. For this purpose, we use Gurvitz's model and assume that every node is monitored by the corresponding point-contact induced by the decoherence process. Then, we focus on large rates of decoherence and calculate the probability distribution analytically and obtain the lower and upper bounds of the mixing time. Our results prove that the mixing time is proportional to the rate of decoherence and the inverse of the square of the distance parameter ( m ). This shows that the mixing time decreases with increasing range of interaction. Also, what we obtain for m = 0 is in agreement with Fedichkin, Solenov and Tamon's results [48] for cycle, and we see that the mixing time of CTQWs on cycle improves with adding interacting edges.
Continuous-time quantum walks on a cycle graph are analyzed in the presence of decoherence. The electron evolution in the nanostructure composed of ring of tunnel-coupled semiconductor quantum dots is considered as realistic model for quantum walks on a cycle graph. Quantum-classical crossover from fast quantum dynamics to classical diffusive behavior is observed as decoherence rate parameter grows. The dependence of transition decoherence rate and mixing time versus size of the graph are studied both analytically and numerically.
In this paper, we study decoherence in continuous-time quantum walks (CTQWs) on one-dimensional regular networks. For this purpose, we assume that every node is represented by a quantum dot continuously monitored by an individual point contact (Gurvitz's model). This measuring process induces decoherence. We focus on small rates of decoherence and then obtain the mixing time bound of the CTQWs on the one-dimensional regular network, whose distance parameter is l ≥ 2. Our results show that the mixing time is inversely proportional to the rate of decoherence, which is in agreement with the mentioned results for cycles in Refs. 29 and 37. Also, the same result is provided in Ref. 38 for long-range interacting cycles. Moreover, we find that this quantity is independent of the distance parameter l (l ≥ 2) and that the small values of decoherence make short the mixing time on these networks.