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

Indian Journal of Physics

Continuous-time quantum walk based on cycle under broken-line decoherent noise

Wei‐Min Shi, Pan Tian, Yi‐Hua Zhou, Yu‐Guang Yang

Published Dec 25, 2023• 0 citations
Publisher

Abstract

Abstract At present, decoherence continuous-time quantum walks are only based on measurement decoherence, but a new broken-line noise model for continuous-time quantum walks on the cycle is proposed. In this scheme, we first construct the Hamiltonian H according to four cases including no broken links, the link to the left of the node is broken, the link to the right of the node is broken, and both links are broken, and then the probability of a walker is reconstructed. The analysis shows that with the increase of the probability of disconnection, the oscillation of the walk gradually weakens and becomes a peak distribution, and with the continuous increase of the walk time, the probability distribution of each vertex tends to be uniform. In addition, we also analyze the mixing time of this walk model and find that a small amount of broken chain decoherence can help reduce the mixing time, thereby improving the performance of quantum walks.

DOI
10.1007/s12648-023-03032-z

Related papers

Quantum hash function of continuous-time quantum walk based on cycle under broken-line decoherent noise

Wei‐Min Shi, Pan Tian, Yi‐Hua Zhou +1 more

The existing hash functions based on quantum walk construction are all proposed under the ideal closed environment. In order to better conform to the actual situation and improve the relevant performance of Hash functions, we propose a quantum hash function constructed by continuous quantum walk on the basis of broken-line noise model. We first propose a continuous-time quantum walk model on cycle under the influence of broken-line decoherence, after that apply this model to the construction process of the quantum hash function and put forward a building method of the hash function on the basis of the broken-line decoherent continuous-time quantum walk on the one-dimensional cycle. The safety analysis and numerical simulation indicate that our hash function has greater anti-collision performance than the existing hash function based on the quantum walk.

International Conference on Computer Network Security and Software Engineering (CNSSE)•Jun 26, 2023•0 citations

Decoherence in two-dimensional quantum walks

Amanda C. Oliveira, Renato Portugal, R. Donangelo

We analyze the decoherence in quantum walks in two-dimensional lattices generated by broken-link-type noise. In this type of decoherence, the links of the lattice are randomly broken with some given constant probability. We obtain the evolution equation for a quantum walker moving on two-dimensional (2D) lattices subject to this noise, and we point out how to generalize for lattices in more dimensions. In the nonsymmetric case, when the probability of breaking links in one direction is different from the probability in the perpendicular direction, we have obtained a nontrivial result. If one fixes the link-breaking probability in one direction, and gradually increases the probability in the other direction from 0 to 1, the decoherence initially increases until it reaches a maximum value, and then it decreases. This means that, in some cases, one can increase the noise level and still obtain more coherence. Physically, this can be explained as a transition from a decoherent 2D walk to a coherent 1D walk.

Physical Review A•Jul 18, 2006•94 citations

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

Decoherence versus entanglement in coined quantum walks

Olivier Maloyer, Viv M. Kendon

Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreading rate and mixing times respectively. The addition of decoherence to the quantum walk produces a more uniform distribution on the line, and even faster mixing on the cycle by removing the need for time-averaging to obtain a uniform distribution. We calculate numerically the entanglement between the coin and the position of the quantum walker and show that the optimal decoherence rates are such that all the entanglement is just removed by the time the final measurement is made.

arXiv:quant-ph/0612229•New Journal of Physics•Apr 11, 2007•67 citations

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 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•1 citation
Abstract At present, decoherence continuous-time quantum walks are only based on measurement decoherence, but a new broken-line noise model for continuous-time quantum walks on the cycle is proposed. In this scheme, we first construct the Hamiltonian H according to four cases including no broken links, the link to the left of the node is broken, the link to the right of the node is broken, and both links are broken, and then the probability of a walker is reconstructed. The analysis shows that with the increase of the probability of disconnection, the oscillation of the walk gradually weakens and becomes a peak distribution, and with the continuous increase of the walk time, the probability distribution of each vertex tends to be uniform. In addition, we also analyze the mixing time of this walk model and find that a small amount of broken chain decoherence can help reduce the mixing time, thereby improving the performance of quantum walks.
The existing hash functions based on quantum walk construction are all proposed under the ideal closed environment. In order to better conform to the actual situation and improve the relevant performance of Hash functions, we propose a quantum hash function constructed by continuous quantum walk on the basis of broken-line noise model. We first propose a continuous-time quantum walk model on cycle under the influence of broken-line decoherence, after that apply this model to the construction process of the quantum hash function and put forward a building method of the hash function on the basis of the broken-line decoherent continuous-time quantum walk on the one-dimensional cycle. The safety analysis and numerical simulation indicate that our hash function has greater anti-collision performance than the existing hash function based on the quantum walk.
We analyze the decoherence in quantum walks in two-dimensional lattices generated by broken-link-type noise. In this type of decoherence, the links of the lattice are randomly broken with some given constant probability. We obtain the evolution equation for a quantum walker moving on two-dimensional (2D) lattices subject to this noise, and we point out how to generalize for lattices in more dimensions. In the nonsymmetric case, when the probability of breaking links in one direction is different from the probability in the perpendicular direction, we have obtained a nontrivial result. If one fixes the link-breaking probability in one direction, and gradually increases the probability in the other direction from 0 to 1, the decoherence initially increases until it reaches a maximum value, and then it decreases. This means that, in some cases, one can increase the noise level and still obtain more coherence. Physically, this can be explained as a transition from a decoherent 2D walk to a coherent 1D walk.
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.
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreading rate and mixing times respectively. The addition of decoherence to the quantum walk produces a more uniform distribution on the line, and even faster mixing on the cycle by removing the need for time-averaging to obtain a uniform distribution. We calculate numerically the entanglement between the coin and the position of the quantum walker and show that the optimal decoherence rates are such that all the entanglement is just removed by the time the final measurement is made.
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.