2001
DOI: 10.1090/conm/287/04779
|View full text |Cite
|
Sign up to set email alerts
|

Krawtchouk matrices from classical and quantum random walks

Abstract: 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 t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2005
2005
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 18 publications
(25 citation statements)
references
References 17 publications
(19 reference statements)
0
25
0
Order By: Relevance
“…For more properties we refer the reader to [Feinsilver, 2001]. For more properties we refer the reader to [Feinsilver, 2001].…”
Section: Definition 1 Thementioning
confidence: 99%
See 3 more Smart Citations
“…For more properties we refer the reader to [Feinsilver, 2001]. For more properties we refer the reader to [Feinsilver, 2001].…”
Section: Definition 1 Thementioning
confidence: 99%
“…Background note. For some further development of this idea, see [Feinsilver, 2001]. The idea of setting them in a matrix form appeared in the 1985 work of N. Bose [Bose, 1985] on digital filtering in the context of the Cayley transform on the complex plane.…”
Section: Symmetric Krawtchouk Matricesmentioning
confidence: 99%
See 2 more Smart Citations
“…From manipulations of a rank four spinorial tensor introduced in [1], we are able to find a general class of identities which, upon specializing from four spinors to two spinors and one spinor in signatures (1,3) and (10,1), yield some well-known Fierz identities. We will see, surprisingly, that the identities we construct are partly encoded in certain involutory real matrices that resemble the Krawtchouk matrices [4] [5]. …”
mentioning
confidence: 99%