Related papers: A quantum dynamical approach to matrix Khrushchev'…
We find a new formula for the orthonormal polynomials corresponding to a measure mu on the unit circle whose Verblunsky coefficients are periodic. The formula is presented using the Chebyshev polynomials of the second kind 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.…
In this paper, we consider a spectral analysis of discrete time quantum walks on the path. For isospectral coin cases, we show that the time averaged distribution and stationary distributions of the quantum walks are described by the pair…
We develop a paradigm for building quantum models in the orthonormal space of Chebyshev polynomials. We show how to encode data into quantum states with amplitudes being Chebyshev polynomials with degree growing exponentially in the system…
In this expository note, we discuss spatially inhomogeneous quantum walks in one dimension and describe a genre of mathematical methods that enables one to translate information about the time-independent eigenvalue equation for the unitary…
In this paper, we consider stationary measures of discrete-time three-state quantum walks including the Fourier and Grover walks in the one-dimensional lattice. We give non-uniform stationary measures by solving the corresponding eigenvalue…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
This paper combines mathematical, philosophical, and historical analyses in a comprehensive investigation of the dynamical foundations of the formalism of orthodox quantum mechanics. The results obtained include: (i) A deduction of the…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
"Quantum trajectories" are solutions of stochastic differential equations also called Belavkin or Stochastic Schr\"odinger Equations. They describe random phenomena in quantum measurement theory. Two types of such equations are usually…
A central question in rough path theory is characterising the law of stochastic processes on path spaces. It is established in [I. Chevyrev & T. Lyons, Characteristic functions of measures on geometric rough paths, Ann. Probab. 44 (2016),…
This paper posits the existence of, and finds a candidate for, a variable change that allows quantum mechanics to be interpreted as quantum geometry. The Bohr model of the Hydrogen atom is thought of in terms of an indeterministic electron…
A brief review of a self-contained genuinely three-dimensional monodromy-matrix based non-perturbative covariant path-integral approach to {\it polynomial invariants} of knots and links in the framework of (topological) quantum Chern-Simons…
We characterize the asymptotic performance of a class of positive operator valued measurements (POVMs) where the only task is to make measurements on independent and identically distributed quantum states on finite-dimensional systems. The…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
A quantum trajectory describes the evolution of a quantum system undergoing indirect measurement. In the discrete-time setting, the state of the system is updated by applying Kraus operators according to the measurement results. From an…
We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian matrix-valued…
Suppose we have k matrices of size n by n. We are given an oracle that knows all the entries of k matrices, that is, we can query the oracle an (i,j) entry of the l-th matrix. The goal is to test if each pair of k matrices commute with each…
Quantum circuits offer a versatile platform for simulating digital quantum dynamics and uncovering novel states of non-equilibrium quantum matter. One principal example are measurement-induced phase transitions arising from non-unitary…
We propose a quantum walk defined by digraphs (mixed graphs). This is like Grover walk that is perturbed by a certain complex-valued function defined by digraphs. The discriminant of this quantum walk is a matrix that is a certain…