Related papers: A quantum dynamical approach to matrix Khrushchev'…
Split-step quantum walk operators can be expressed as a generalised version of CMV operators with complex transmission coefficients, which we call rotated CMV operators. Following the idea of Cantero, Moral and Velazquez's original…
Recently, the quaternionic quantum walk was formulated by the first author as a generalization of discrete-time quantum walks. We treat the right eigenvalue problem of quaternionic matrices to analysis the spectra of its transition matrix.…
We prove that the Nevalinna-Pick algorithm provides different homeomorphisms between certain topological spaces of measures, analytic functions and sequences of complex numbers. This algorithm also yields a continued fraction expansion of…
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for…
We consider CMV matrices with Verblunsky coefficients determined in an appropriate way by the Fibonacci sequence and present two applications of the spectral theory of such matrices to problems in mathematical physics. In our first…
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…
M. Derevyagin, L. Vinet and A. Zhedanov introduced in Constr. Approx. 36 (2012) 513-535 a new connection between orthogonal polynomials on the unit circle and the real line. It maps any real CMV matrix into a Jacobi one depending on a real…
The Schur functions play a crucial role in the modern description of HOMFLY polynomials for knots and of topological vertices in DIM-based network theories, which could merge into a unified theory still to be developed. The Macdonald…
We take inspiration from the Okounkov-Vershik approach to the representation theory of the symmetric groups to develop a new way of understanding how the Schur-Weyl duality can be used to perform the Quantum Schur Transform. The Quantum…
We present an approach to simulate the Schr\"odinger equation through continuous time quantum walks. The CTQW-based simulation applies unitary evolution driven by a quantum walk to generate probability amplitude distributions at various…
A notion of monitored recurrence for discrete-time quantum processes was recently introduced in [Commun. Math. Phys., DOI 10.1007/s00220-012-1645-2] (see also arXiv:1202.3903) taking the initial state as an absorbing one. We extend this…
Quantum trajectories are Markov processes that describe the time-evolution of a quantum system undergoing continuous indirect measurement. Mathematically, they are defined as solutions of the so-called "Stochastic Schr\"odinger Equations",…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
The Szegedy quantum walk is a discrete time quantum walk model which defines a quantum analogue of any Markov chain. The long-term behavior of the quantum walk can be encoded in a matrix called the average mixing matrix, whose columns give…
Let $G$ be a strongly regular graph of prime order $p$ with connection degree $k \geq 6$. We prove that the \emph{quantum walk characteristic polynomial} $\chi_q(G,\lambda) \coloneqq \det(\lambda I - U_G)$, where $U_G$ is the coined quantum…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
The Schur-Horn theorem is a well-known result that characterizes the relationship between the diagonal elements and eigenvalues of a symmetric (Hermitian) matrix. In this paper, we extend this theorem by exploring the eigenvalue…
We investigate the dynamics of discrete-time quantum walk subject to time correlated noise. Noise is described as an unitary coin-type operator before each step, and attention is focused on the noise generated by a Gaussian Ornstein…
We study the dynamics given by the iteration of a (half-line) CMV matrix with sparse, high barriers. Using an approach of Tcheremchantsev, we are able to explicitly compute the transport exponents for this model in terms of the given…
The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…