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:1310.7486 · Quantum Information Processing

Quantum walk with a general coin: exact solution and asymptotic properties

Miquel Montero

Published Jan 6, 2015• 10 citations
arXivHTMLPDF
DOI
10.1007/s11128-014-0908-6

Related papers

Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations

André Ahlbrecht, Christopher Cedzich, R. Matjeschk +3 more

arXiv:1201.4839•Quantum Information Processing•Mar 24, 2012•54 citations

Asymptotic distributions of quantum walks on the line with two entangled coins

Chaobin Liu

arXiv:1107.3346•Quantum Information Processing•Jan 25, 2012•21 citations

Quantum walks driven by many coins

Todd A. Brun, Hilary A. Carteret, Andris Ambainis

Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple quantum ``coins'' (or more generally, coins of higher dimension) in order to diminish the effects of interference between paths. We find solutions to this system in terms of the single-coin random walk, and compare the asymptotic limit of these solutions to numerical simulations. We find exact analytical expressions for the time dependence of the first two moments, and show that in the long-time limit the ``quantum-mechanical'' behavior of the one-coin walk persists, even if each coin is flipped only twice. We further show that this is generic for a very broad class of possible walks, and that this behavior disappears only in the limit of a new coin for every step of the walk.

arXiv:quant-ph/0210161•Physical Review A•May 30, 2003•178 citations

Asymptotic reduced density matrix of discrete-time quantum walks

Mostafa Annabestani

Abstract In this article we show that for any quantum walker with m -dimensional coin subspace, we have m 2 × m 2 specific constant matrix C where it completely determines the asymptotic reduced density matrix of the walker. We show that for any initial state with P 0 projector, the reduced density matrix can be obtained by T r 1 P 0 ⊗ I C or equivalently T r 2 I ⊗ P 0 C . It is worth mentioning that the characteristic matrix C is independent of the initial state and just depends on the coin operator, so by finding this matrix for a specific type of quantum walks (QW), the long-time behavior of it, such as local state of the coin after a long-time walk and asymptotic entanglement between the coin and position will be completely known for any initial state. We have found the characteristic matrix C for the general coin operator, U 2 , as well as the exact form of this matrix for the local initial state.

arXiv:1909.09214•Journal of Physics A Mathematical and Theoretical•Feb 28, 2020•1 citation

Asymptotic behavior of quantum walks on the line

Toshikazu Sunada, Tatsuya Tate

arXiv:1108.1878•Journal of Functional Analysis•Jan 25, 2012•44 citations

Properties of open quantum walks on Z\mathbb {Z}Z

Ilya Sinayskiy, Francesco Petruccione

The connection between the asymptotic behavior of the open quantum walk and the spectrum of generalized quantum coins was studied. In the case of simultaneously diagonalizable transition operators, an exact expression for the probability distribution of the position of the walker for an arbitrary number of steps was found. For a large number of steps, the probability distribution consists of, maximally, two ‘soliton’-like solutions and a certain number of Gaussian distributions. The number of different contributions to the final probability distribution is equal to the number of distinct absolute values in the spectrum of the transition operators. The presence of the zeros in the spectrum is an indicator of the ‘soliton’-like solutions in the probability distribution.

arXiv:1402.1468•Physica Scripta•Nov 1, 2012•16 citations
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple quantum ``coins'' (or more generally, coins of higher dimension) in order to diminish the effects of interference between paths. We find solutions to this system in terms of the single-coin random walk, and compare the asymptotic limit of these solutions to numerical simulations. We find exact analytical expressions for the time dependence of the first two moments, and show that in the long-time limit the ``quantum-mechanical'' behavior of the one-coin walk persists, even if each coin is flipped only twice. We further show that this is generic for a very broad class of possible walks, and that this behavior disappears only in the limit of a new coin for every step of the walk.
Abstract In this article we show that for any quantum walker with m -dimensional coin subspace, we have m 2 × m 2 specific constant matrix C where it completely determines the asymptotic reduced density matrix of the walker. We show that for any initial state with P 0 projector, the reduced density matrix can be obtained by T r 1 P 0 ⊗ I C or equivalently T r 2 I ⊗ P 0 C . It is worth mentioning that the characteristic matrix C is independent of the initial state and just depends on the coin operator, so by finding this matrix for a specific type of quantum walks (QW), the long-time behavior of it, such as local state of the coin after a long-time walk and asymptotic entanglement between the coin and position will be completely known for any initial state. We have found the characteristic matrix C for the general coin operator, U 2 , as well as the exact form of this matrix for the local initial state.
The connection between the asymptotic behavior of the open quantum walk and the spectrum of generalized quantum coins was studied. In the case of simultaneously diagonalizable transition operators, an exact expression for the probability distribution of the position of the walker for an arbitrary number of steps was found. For a large number of steps, the probability distribution consists of, maximally, two ‘soliton’-like solutions and a certain number of Gaussian distributions. The number of different contributions to the final probability distribution is equal to the number of distinct absolute values in the spectrum of the transition operators. The presence of the zeros in the spectrum is an indicator of the ‘soliton’-like solutions in the probability distribution.