Krawtchouk matrices from classical and quantum random walks (original) (raw)

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 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.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (22)

  1. N. Bose, Digital filters: theory and applications, North-Holland, 1985.
  2. W.Y.C. Chen and J.D. Louck, The combinatorics of a class of represen- tation functions, Adv. in Math., 140 (1998), 207-236.
  3. P. Delsarte, Bounds for restricted codes, by linear programming, Philips Res. Reports, 27 (1972) 272-289.
  4. P. Delsarte, Four fundamental parameters of a code and their combina- torial significance, Info. & Control, 23 (1973) 407-438.
  5. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Supplements, No. 10, 1973.
  6. C.F. Dunkl, A Krawtchouk polynomial addition theorem and wreath products of symmetric groups, Indiana Univ. Math. J., 25 (1976) 335- 358.
  7. C.F. Dunkl and D.F. Ramirez, Krawtchouk polynomials and the sym- metrization of hypergraphs, SIAM J. Math. Anal., 5 (1974) 351-366.
  8. G.K. Eagelson, A characterization theorem for positive definite se- quences of the Krawtchouk polynomials, Australian J. Stat, 11 (1969) 29-38.
  9. P. Feinsilver and R. Fitzgerald, The spectrum of symmetric Krawtchouk matrices, Lin. Alg. & Appl., 235 (1996) 121-139.
  10. P. Feinsilver and R. Schott, Krawtchouk polynomials and finite prob- ability theory, Probability Measures on Groups X, Plenum, 1991, pp. 129-135.
  11. W. Fulton and J. Harris, Representation theory, a first course, Graduate texts in mathematics, 129, Springer-Verlag, 1991.
  12. M. Krawtchouk, Sur une generalisation des polynomes d'Hermite, Comptes Rendus, 189 (1929) 620-622.
  13. M. Krawtchouk, Sur la distribution des racines des polynomes orthogo- naux, Comptes Rendus, 196 (1933) 739-741.
  14. V.I. Levenstein, Krawtchouk polynomials and universal bounds for codes and design in Hamming spaces, IEEE Transactions on Information The- ory, 41 5 (1995) 1303-1321.
  15. S.J. Lomonaco, Jr., A Rosetta Stone for quantum me- chanics with an introduction to quantum computation, http://www.arXiv.org/abs/quant-ph/0007045
  16. P.A. MacMahon, Combinatory analysis, Chelsea, New York, 1960.
  17. F.J. MacWilliams and N.J.A. Sloane, The theory of Error-Correcting Codes, The Netherlands, North Holland, 1977.
  18. K.R. Parthasarathy, An introduction to quantum stochastic calculus, Birkhäuser, 1992.
  19. T.A. Springer, Invariant theory, Lecture notes in mathematics, 585, Springer-Verlag, 1977.
  20. G. Szegö, Orthogonal Polynomials, Colloquium Publications, Vol. 23, New York, AMS, revised eddition 1959, 35-37.
  21. D. Vere-Jones, Finite bivariate distributions and semi-groups of nonneg- ative matrices, Q. J. Math. Oxford, 22 2 (1971) 247-270.
  22. R.K. Rao Yarlagadda and J.E. Hershey, Hadamard matrix analysis and synthesis: with applications to communications and signal/image pro- cessing, Kluwer Academic Publishers, 1997.