Krawtchouk matrices from classical and quantum random walks

作者: Jerzy Kocik , Philip Feinsilver

DOI:

关键词:

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

参考文章(14)
P. Feinsilver, R. Schott, Krawtchouk Polynomials and Finite Probability Theory Probability Measures on Groups X. pp. 129- 135 ,(1991) , 10.1007/978-1-4899-2364-6_9
Florence Jessie MacWilliams, Neil James Alexander Sloane, The Theory of Error-Correcting Codes ,(1977)
D. VERE-JONES, FINITE BIVARIATE DISTRIBUTIONS AND SEMIGROUPS OF NON-NEGATIVE MATRICES Quarterly Journal of Mathematics. ,vol. 22, pp. 247- 270 ,(1971) , 10.1093/QMATH/22.2.247
Charles F. Dunkl, Donald E. Ramirez, Krawtchouk Polynomials and the Symmetrization of Hypergroups SIAM Journal on Mathematical Analysis. ,vol. 5, pp. 351- 366 ,(1974) , 10.1137/0505039
Philippe Delsarte, Four fundamental parameters of a code and their combinatorial significance Information & Computation. ,vol. 23, pp. 407- 438 ,(1973) , 10.1016/S0019-9958(73)80007-5
William Y.C. Chen, James D. Louck, The Combinatorics of a Class of Representation Functions Advances in Mathematics. ,vol. 140, pp. 207- 236 ,(1998) , 10.1006/AIMA.1998.1769