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 Walk with a Bit Flip

C. M. Chandrashekar, R. Srikanth

Published Jul 27, 2006• 0 citations
OpenAlex

Related papers

Analysis of Decoherence in Linear and Cyclic Quantum Walks

Mahesh N. Jayakody, Asiri Nanayakkara, Eliahu Cohen

We theoretically analyze the case of noisy Quantum walks (QWs) by introducing four qubit decoherence models into the coin degree of freedom of linear and cyclic QWs. These models include flipping channels (bit flip, phase flip and bit-phase flip), depolarizing channel, phase damping channel and generalized amplitude damping channel. Explicit expressions for the probability distribution of QWs on a line and on a cyclic path are derived under localized and delocalized initial states. We show that QWs which begin from a delocalized state generate mixture probability distributions, which could give rise to useful algorithmic applications related to data encoding schemes. Specifically, we show how the combination of delocalzed initial states and decoherence can be used for computing the binomial transform of a given set of numbers. However, the sensitivity of QWs to noisy environments may negatively affect various other applications based on QWs.

Optics•Oct 22, 2021•5 citations

Quantum walk with jumps

Hynek Lavička, Václav Potoček, T. Kiss +2 more

arXiv:1106.2036•The European Physical Journal D•Jul 27, 2011•18 citations

Strolling Out on a Quantum Walk

Science•Jul 9, 2009•0 citations

Quantum walks over a square lattice

Arkaprabha Ghosal, Prasenjit Deb

Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in the presence of dynamic percolation and decoherence. We consider bit-flip and phase damping noise, and evaluate the instantaneous mixing time for both the cases. Using numerical analysis we show that, in the case of phase damping noise, the probability distribution of walker's position is sufficiently close to the uniform distribution after infinite time. However, during the action of bit-flip noise, even after infinite time the total variational distance between the two probability distributions is large enough.

arXiv:1803.05152•Physical Review A•Sep 6, 2018•7 citations

Symmetries and noise in quantum walk

C. M. Chandrashekar, R. Srikanth, Subhashish Banerjee

We study some discrete symmetries of unbiased (Hadamard) and biased quantum walk on a line, which are shown to hold even when the quantum walker is subjected to environmental effects. The noise models considered in order to account for these effects are the phase flip, bit flip, and generalized amplitude damping channels. The numerical solutions are obtained by evolving the density matrix, but the persistence of the symmetries in the presence of noise is proved using the quantum trajectories approach. We also briefly extend these studies to quantum walk on a cycle. These investigations can be relevant to the implementation of quantum walks in various known physical systems. We discuss the implementation in the case of NMR quantum information processor and ultracold atoms.

arXiv:quant-ph/0607188•Physical Review A•Aug 16, 2007•67 citations

Qubit Twist

Charles Q. Choi

Scientific American•Apr 1, 2005•2 citations
We theoretically analyze the case of noisy Quantum walks (QWs) by introducing four qubit decoherence models into the coin degree of freedom of linear and cyclic QWs. These models include flipping channels (bit flip, phase flip and bit-phase flip), depolarizing channel, phase damping channel and generalized amplitude damping channel. Explicit expressions for the probability distribution of QWs on a line and on a cyclic path are derived under localized and delocalized initial states. We show that QWs which begin from a delocalized state generate mixture probability distributions, which could give rise to useful algorithmic applications related to data encoding schemes. Specifically, we show how the combination of delocalzed initial states and decoherence can be used for computing the binomial transform of a given set of numbers. However, the sensitivity of QWs to noisy environments may negatively affect various other applications based on QWs.
Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in the presence of dynamic percolation and decoherence. We consider bit-flip and phase damping noise, and evaluate the instantaneous mixing time for both the cases. Using numerical analysis we show that, in the case of phase damping noise, the probability distribution of walker's position is sufficiently close to the uniform distribution after infinite time. However, during the action of bit-flip noise, even after infinite time the total variational distance between the two probability distributions is large enough.
We study some discrete symmetries of unbiased (Hadamard) and biased quantum walk on a line, which are shown to hold even when the quantum walker is subjected to environmental effects. The noise models considered in order to account for these effects are the phase flip, bit flip, and generalized amplitude damping channels. The numerical solutions are obtained by evolving the density matrix, but the persistence of the symmetries in the presence of noise is proved using the quantum trajectories approach. We also briefly extend these studies to quantum walk on a cycle. These investigations can be relevant to the implementation of quantum walks in various known physical systems. We discuss the implementation in the case of NMR quantum information processor and ultracold atoms.