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:1112.1287 · Physical Review A

Trapping a particle of a quantum walk on the line

Antoni Wójcik, Tomasz Łuczak, Paweł Kurzyński, Andrzej Grudka, Tomasz Gdala, Małgorzata Bednarska-Bzdȩga

Published Jan 27, 2012• 79 citations
arXivHTMLPDF

Abstract

We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal coin state of the walker.
DOI
10.1103/physreva.85.012329

Related papers

1D Discrete-Time Random Walk

Guillaume Mastio, P. Milman

In quantum walk, the walker’s spreading expands faster than in its classical version. The use of a biased coin on a unidimensional lattice shows interesting behaviour as the coin is strongly entangled with the walker state.

Quantum Information and Measurement (QIM)•Jan 1, 2017•0 citations

One-dimensional quantum walks with single-point phase defects

Rong Zhang, Peng Xue, Jason Twamley

We observe the localization effect of one-dimensional quantum walks with single-point phase defects. The walker's spread velocity is dramatically suppressed by interference effects due to the phase defect. We show that the localization effect depends on four factors: the value and the position of the phase defect, the parameter of coin flipping, and the initial state of the walker + coin system.

Physical Review A•Apr 21, 2014•47 citations

Localization of an inhomogeneous discrete-time quantum walk on the line

Norio Konno

arXiv:0908.2213•Quantum Information Processing•Oct 13, 2009•97 citations

Quantum Walk-based Generation of Entanglement Between Two Walkers

Salvador Elías Venegas-Andraca, Sougato Bose

Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.

arXiv:0901.3946•Jan 26, 2009•12 citations

The Effect of Quantum Coins on the Spreading of Binary Disordered Quantum Walk

赵静, 胡亚运, 童培庆

Chinese Physics Letters•Jan 1, 2015•0 citations

Disordered quantum walks in two-dimensional lattices

Rong Zhang, Yun-Qiu Xu, Peng Xue

The properties of the two-dimensional quantum walk with point, line, and circle disorders in phase are reported. Localization is observed in the two-dimensional quantum walk with certain phase disorder and specific initial coin states. We give an explanation of the localization behavior via the localized stationary states of the unitary operator of the walker + coin system and the overlap between the initial state of the whole system and the localized stationary states.

Chinese Physics B•Jan 1, 2015•11 citations
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.