Related papers: A quantum dynamical approach to matrix Khrushchev'…
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…
It is shown that monic orthogonal polynomials on the unit circle are the characteristic polynomials of certain five-diagonal matrices depending on the Schur parameters. This result is achieved through the study of orthogonal Laurent…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Classical and quantum walks on some finite paths are introduced. It is shown that these walks have explicit solutions given in terms of exceptional Krawtchouk polynomials and their properties are explored. In particular, fractional revival…
Quantum magnetometry uses quantum resources to measure magnetic fields with precision and accuracy that cannot be achieved by its classical counterparts. In this paper, we propose a scheme for quantum magnetometry using discrete-time…
The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…
We analyze the Schr\"{o}dinger dynamics and the Schr\"{o}dinger function (or the so-called wavefunction) in the following four aspects. (1) The Schr\"{o}dinger equation is reconstructed from scratch in the real field only, without referring…
If $X$ is a graph with adjacency matrix $A$, then we define $H(t)$ to be the operator $\exp(itA)$. The Schur (or entrywise) product $H(t)\circ H(-t)$ is a doubly stochastic matrix and, because of work related to quantum computing, we are…
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity…
In this paper we show how to generalize the quantum approximate counting technique developed by Brassard, H{\o}yer and Tapp [ICALP 1998] to a more general setting: estimating the number of marked states of a Markov chain (a Markov chain can…
We introduce and study a generalization of Schur's $P$-/$Q$-functions associated to a polynomial sequence, which can be viewed as ``Macdonald's ninth variation'' for $P$-/$Q$-functions. This variation includes as special cases Schur's…
This paper elucidates the dual structure of the Schr\"{o}dinger dynamics in two correlated stages: (1) We first derive the real-valued Schr\"{o}dinger equation from scratch without referring to classical mechanics, wave mechanics, nor…
We study the "improved dynamics" for the treatment of spherically symmetric space-times in loop quantum gravity introduced by Chiou {\em et al.} in analogy with the one that has been constructed by Ashtekar, Pawlowski and Singh for the…
An algebraic interpretation of the bivariate Krawtchouk polynomials is provided in the framework of the 3-dimensional isotropic harmonic oscillator model. These polynomials in two discrete variables are shown to arise as matrix elements of…
We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
The purpose of this paper is to give a direct proof of an eigenfunction expansion formula for one-dimensional 2-state quantum walks, which is an analog of that for Sturm-Liouville operators due to Weyl, Stone, Titchmarsh and Kodaira. In the…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian…
We study the problem of "isotropically rounding" a polytope $K\subset\mathbb{R}^n$, that is, computing a linear transformation which makes the uniform distribution on the polytope have roughly identity covariance matrix. We assume $K$ is…