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:0901.2244

Matrix valued Szego polynomials and quantum random walks

Maŕıa José Cantero, F. Alberto Grünbaum, Moral, L., L. Velázquez

Published Jan 15, 2009• 1 citation
arXivHTMLPDF

Abstract

We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes and to give results that are analogous to those that Karlin and McGregor developed to study (classical) birth-and-death processes using orthogonal polynomials on the real line. In perfect analogy with the classical case the study of QRWs on the set of non-negative integers can be handled using scalar valued (Laurent) polynomials and a scalar valued measure on the circle. In the case of classical or quantum random walks on the integers one needs to allow for matrix valued versions of these notions. We show how our tools yield results in the well known case of the Hadamard walk, but we go beyond this translation invariant model to analyze examples that are hard to analyze using other methods. More precisely we consider QRWs on the set of non- negative integers. The analysis of these cases leads to phenomena that are absent in the case of QRWs on the integers even if one restricts oneself to a constant coin. This is illustrated here by studying recurrence properties of the walk, but the same method can be used for other purposes. The presentation here aims at being selfcontained, but we re- frain from trying to give an introduction to quantum random walks, a subject well surveyed in the literature we quote. For two excellent reviews, see [1, 18]. See also the recent notes [19].

DOI
10.48550/arxiv.0901.2244

Related papers

Matrix‐valued Szegő polynomials and quantum random walks

Maŕıa José Cantero, L. Moral, F. Alberto Grünbaum +1 more

Abstract We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes and to give results that are analogous to those that Karlin and McGregor developed to study (classical) birth‐and‐death processes using orthogonal polynomials on the real line. In perfect analogy with the classical case, the study of QRWs on the set of nonnegative integers can be handled using scalar‐valued (Laurent) polynomials and a scalar‐valued measure on the circle. In the case of classical or quantum random walks on the integers, one needs to allow for matrix‐valued versions of these notions. We show how our tools yield results in the well‐known case of the Hadamard walk, but we go beyond this translation‐invariant model to analyze examples that are hard to analyze using other methods. More precisely, we consider QRWs on the set of nonnegative integers. The analysis of these cases leads to phenomena that are absent in the case of QRWs on the integers even if one restricts oneself to a constant coin. This is illustrated here by studying recurrence properties of the walk, but the same method can be used for other purposes. The presentation here aims at being self‐contained, but we refrain from trying to give an introduction to quantum random walks, a subject well surveyed in the literature we quote. For two excellent reviews, see [1, 9]. See also the recent notes [20]. © 2009 Wiley Periodicals, Inc.

Communications on Pure and Applied Mathematics•Dec 29, 2009•105 citations

Spectral analysis of quantum Markov chains on the line and their statistics.

Manuel D. de la Iglesia, Carlos F. Lardizabal, Newton Loebens

Inspired by the classical spectral analysis of birth-death chains using orthogonal polynomials, we study an analogous set of constructions in the context of open quantum dynamics and related walks. In such setting, block tridiagonal matrices and matrix-valued orthogonal polynomials are the natural objects to be considered. We recall the problems of the existence of a matrix of measures or weight matrix together with concrete calculations of basic statistics of the walk, such as site recurrence and first passage time probabilities, with these notions being defined in terms of a quantum trajectories formalism. The discussion concentrates on the models of quantum Markov chains, due to S. Gudder, and on the particular class of open quantum walks, due to S. Attal et al. The folding trick for birth-death chains on the integers is revisited in this setting together with applications of the matrix-valued Stieltjes transform associated with the measures, thus extending recent results on the subject. Finally, we consider the case of non-symmetric weight matrices and explore some examples.

•Jul 21, 2021•0 citations

Krawtchouk matrices from classical and quantum random walks

Philip Feinsilver, Jerzy Kocik

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic properties of these matrices provide a very interesting and accessible example in the approach to probability theory known as quantum probability. First it is noted how the Krawtchouk matrices are connected to the classical symmetric Bernoulli random walk. And we show how to derive Krawtchouk matrices in the quantum probability context via tensor powers of the elementary Hadamard matrix. Then connections with the classical situation are shown by calculating expectation values in the quantum case.

arXiv:quant-ph/0702173•Feb 16, 2007•0 citations

Localization of quantum walks via the CGMV method

Norio Konno, Etsuo Segawa

We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle, expresses the dynamics of the quantum walk. Using the CGMV method introduced by them, the name is taken from their initials, we obtain the spectral measure for the quantum walk. As a corollary, we give another proof for localization of the quantum walk on homogeneous trees shown by Chisaki et al.

Quantum Information and Computation•May 1, 2011•26 citations

ON ALGEBRAIC AND QUANTUM RANDOM WALKS

Demosthenes Ellinas

Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and the canonical Heisenberg-Weyl algebra hw, and by introducing appropriate functionals on those algebras, examples of ARWs are constructed. These walks involve short and long range transition probabilities as in the case of R walk, bistochastic matrices as for the case of Z_N walk, or coherent state vectors as in the case of hw walk. The increase of classical entropy due to majorization order of those ARWs is shown, and further their corresponding evolution equations are obtained. Especially for the case of hw ARW, the diffusion limit of evolution equation leads to a quantum master equation for the density matrix of a boson system interacting with a bath of quantum oscillators prepared in squeezed vacuum state. A number of generalizations to other types of ARWs and some open problems are also stated. Next, QRWs are briefly presented together with some of their distinctive properties, such as their enhanced diffusion rates, and their behavior in respect to the relation of majorization to quantum entropy. Finally, the relation of ARWs to QRWs is investigated in terms of the theorem of unitary extension of completely positive trace preserving (CPTP) evolution maps by means of auxiliary vector spaces. It is applied to extend the CPTP step evolution map of a ARW for a quantum walker system into a unitary step evolution map for an associated QRW of a walker+quantum coin system. Examples and extensions are provided.

arXiv:quant-ph/0510128•Quantum Probability and Infinite Dimensional Analysis•Jan 1, 2005•7 citations

Localization of discrete-time quantum walks on a half line via the CGMV method

Norio Konno, Etsuo Segawa

We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. [1] showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle [2], expresses the dynamics of the quantum walk. Using the CGMV method introduced by them, the name is taken from their initials, we obtain the spectral measure for the quantum walk. As a corollary, we give another proof for localization of the quantum walk on homogeneous trees shown by Chisaki et al. [3].

arXiv:1008.5109•Aug 30, 2010•7 citations
We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes and to give results that are analogous to those that Karlin and McGregor developed to study (classical) birth-and-death processes using orthogonal polynomials on the real line. In perfect analogy with the classical case the study of QRWs on the set of non-negative integers can be handled using scalar valued (Laurent) polynomials and a scalar valued measure on the circle. In the case of classical or quantum random walks on the integers one needs to allow for matrix valued versions of these notions. We show how our tools yield results in the well known case of the Hadamard walk, but we go beyond this translation invariant model to analyze examples that are hard to analyze using other methods. More precisely we consider QRWs on the set of non- negative integers. The analysis of these cases leads to phenomena that are absent in the case of QRWs on the integers even if one restricts oneself to a constant coin. This is illustrated here by studying recurrence properties of the walk, but the same method can be used for other purposes. The presentation here aims at being selfcontained, but we re- frain from trying to give an introduction to quantum random walks, a subject well surveyed in the literature we quote. For two excellent reviews, see [1, 18]. See also the recent notes [19].
Abstract We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes and to give results that are analogous to those that Karlin and McGregor developed to study (classical) birth‐and‐death processes using orthogonal polynomials on the real line. In perfect analogy with the classical case, the study of QRWs on the set of nonnegative integers can be handled using scalar‐valued (Laurent) polynomials and a scalar‐valued measure on the circle. In the case of classical or quantum random walks on the integers, one needs to allow for matrix‐valued versions of these notions. We show how our tools yield results in the well‐known case of the Hadamard walk, but we go beyond this translation‐invariant model to analyze examples that are hard to analyze using other methods. More precisely, we consider QRWs on the set of nonnegative integers. The analysis of these cases leads to phenomena that are absent in the case of QRWs on the integers even if one restricts oneself to a constant coin. This is illustrated here by studying recurrence properties of the walk, but the same method can be used for other purposes. The presentation here aims at being self‐contained, but we refrain from trying to give an introduction to quantum random walks, a subject well surveyed in the literature we quote. For two excellent reviews, see [1, 9]. See also the recent notes [20]. © 2009 Wiley Periodicals, Inc.
Inspired by the classical spectral analysis of birth-death chains using orthogonal polynomials, we study an analogous set of constructions in the context of open quantum dynamics and related walks. In such setting, block tridiagonal matrices and matrix-valued orthogonal polynomials are the natural objects to be considered. We recall the problems of the existence of a matrix of measures or weight matrix together with concrete calculations of basic statistics of the walk, such as site recurrence and first passage time probabilities, with these notions being defined in terms of a quantum trajectories formalism. The discussion concentrates on the models of quantum Markov chains, due to S. Gudder, and on the particular class of open quantum walks, due to S. Attal et al. The folding trick for birth-death chains on the integers is revisited in this setting together with applications of the matrix-valued Stieltjes transform associated with the measures, thus extending recent results on the subject. Finally, we consider the case of non-symmetric weight matrices and explore some examples.
Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic properties of these matrices provide a very interesting and accessible example in the approach to probability theory known as quantum probability. First it is noted how the Krawtchouk matrices are connected to the classical symmetric Bernoulli random walk. And we show how to derive Krawtchouk matrices in the quantum probability context via tensor powers of the elementary Hadamard matrix. Then connections with the classical situation are shown by calculating expectation values in the quantum case.
We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle, expresses the dynamics of the quantum walk. Using the CGMV method introduced by them, the name is taken from their initials, we obtain the spectral measure for the quantum walk. As a corollary, we give another proof for localization of the quantum walk on homogeneous trees shown by Chisaki et al.
Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and the canonical Heisenberg-Weyl algebra hw, and by introducing appropriate functionals on those algebras, examples of ARWs are constructed. These walks involve short and long range transition probabilities as in the case of R walk, bistochastic matrices as for the case of Z_N walk, or coherent state vectors as in the case of hw walk. The increase of classical entropy due to majorization order of those ARWs is shown, and further their corresponding evolution equations are obtained. Especially for the case of hw ARW, the diffusion limit of evolution equation leads to a quantum master equation for the density matrix of a boson system interacting with a bath of quantum oscillators prepared in squeezed vacuum state. A number of generalizations to other types of ARWs and some open problems are also stated. Next, QRWs are briefly presented together with some of their distinctive properties, such as their enhanced diffusion rates, and their behavior in respect to the relation of majorization to quantum entropy. Finally, the relation of ARWs to QRWs is investigated in terms of the theorem of unitary extension of completely positive trace preserving (CPTP) evolution maps by means of auxiliary vector spaces. It is applied to extend the CPTP step evolution map of a ARW for a quantum walker system into a unitary step evolution map for an associated QRW of a walker+quantum coin system. Examples and extensions are provided.
We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. [1] showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle [2], expresses the dynamics of the quantum walk. Using the CGMV method introduced by them, the name is taken from their initials, we obtain the spectral measure for the quantum walk. As a corollary, we give another proof for localization of the quantum walk on homogeneous trees shown by Chisaki et al. [3].