相关论文: Krawtchouk matrices from classical and quantum ran…

In the study of chaotic behaviour of systems of many hard spheres, Lyapunov exponents of small absolute value exhibit interesting characteristics leading to speculations about connections to non-equilibrium statistical mechanics. Analytical…

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration…

The (standard) average mixing matrix of a continuous-time quantum walk is computed by taking the expected value of the mixing matrices of the walk under the uniform sampling distribution on the real line. In this paper we consider…

In [J. Phys. A: Math. Theor. 45 (2012)], while looking for spin chains that admit perfect state transfer, Vinet and Zhedanov found an apparently new sequence of orthogonal polynomials, that they called para-Krawtchouk polynomials, defined…

We give a hypergeometric proof involving a family of 2-variable Krawtchouk polynomials that were obtained earlier by Hoare and Rahman [SIGMA 4 (2008), 089, 18 pages] as a limit of the 9-j symbols of quantum angular momentum theory, and…

We study the dynamics of a "kicked" quantum system undergoing repeated measurements of momentum. A diffusive behavior is obtained for a large class of Hamiltonians, even when the dynamics of the classical counterpart is not chaotic. These…

When confined to a topological environment consisting of a cycle coupled with a half-line, quantum walks exhibit long-term statistical tendencies which differ dramatically from the tendencies of classical random walks in the same…

In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…

We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…

Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…

Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…

We investigate the linear statistics of random matrices with purely imaginary Bernoulli entries of the form $H_{pq} = \overline{H}_{qp} = \pm i$, that are either independently distributed or exhibit global correlations imposed by the…

Probabilistic description of results of measurements and its consequences for understanding quantum mechanics are discussed. It is shown that the basic mathematical structure of quantum mechanics like the probability amplitudes, Born rule,…

A central problem in quantum information is determining quantum-classical boundaries. A useful notion of classicality is provided by the quasiprobability formulation of quantum theory. In this framework, a state is called classical if it is…

We define a map which relates four dimensional classical stochastic matrices to qubit quantum channels. The map preserves the spectrum and the composition of processes. To do this we introduce the concept of Bloch tetrahedron which plays…

This paper is a brief review of classical and quantum transport phenomena, as well as related spectral properties, exhibited by one-dimensional periodically kicked systems. Two representative and fundamentally different classes of systems…

This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…

Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time it allows for internal…

A coinless quantisation procedure of general reversible Markov chains on graphs is presented. A quantum Hamiltonian H is obtained by a similarity transformation of the fundamental transition probability matrix K in terms of the square root…

In this paper we study a one-dimensional quantum random walk with the Hadamard transformation which is often called the Hadamard walk. We construct the Hadamard walk using a transition matrix on probability amplitude and give some results…