Related papers: A quantum dynamical approach to matrix Khrushchev'…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
We propose a class of continuous-time quantum walk models on graphs induced by a certain class of discrete-time quantum walk models with the parameter $\epsilon\in [0,1]$. Here the graph treated in this paper can be applied both finite and…
We apply a theorem of Geronimus to derive some new formulas connecting Schur functions with orthogonal polynomials on the unit circle. The applications include the description of the associated measures and a short proof of Boyd's result…
A major advantage in using Szegedy's formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk on directed and weighted graphs. In this paper, we present a general scheme to…
In this paper, we study the discrete-time quantum walks on 1D Chain with the moving and swapping shift operators. We derive analytical solutions for the eigenvalues and eigenstates of the evolution operator $\hat{U}$ using the Chebyshev…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…
In this paper we extend the study of three state lively quantum walks on cycles by considering the coin operator as a linear sum of permutation matrices, which is a generalization of the Grover matrix. First we provide a complete…
The conventional spectral mapping theorem for quantum walks can only be applied for walks employing a shift operator whose square is the identity. This theorem gives most of the eigenvalues of the time evolution $U$ by lifting the…
We examine several numerical techniques for the calculation of the dynamics of quantum systems. In particular, we single out an iterative method which is based on expanding the time evolution operator into a finite series of Chebyshev…
Introduced by Okounkov and Reshetikhin, the Schur process is known to be a determinantal point process, meaning that its correlation functions are minors of a single correlation kernel matrix. Previously, this was derived using…
We present a simple technique to compute moments of derivatives of unitary characteristic polynomials. The first part of the technique relies on an idea of Bump and Gamburd: it uses orthonormality of Schur functions over unitary groups to…
The Schur basis on n d-dimensional quantum systems is a generalization of the total angular momentum basis that is useful for exploiting symmetry under permutations or collective unitary rotations. We present efficient (size…
An algebraic structure for one-dimensional quantum walks is introduced. This structure characterizes, in some sense, one-dimensional quantum walks. A natural computation using this algebraic structure leads us to obtain an effective formula…
The original Grover's algorithm suffers from the souffle problem, which means that the success probability of quantum search decreases dramatically if the iteration time is too small or too large from the right time. To overcome the souffle…
Quantum trajectories are Markov processes describing the evolution of a quantum system subject to indirect measurements. They can be viewed as place dependent iterated function systems or the result of products of dependent and non…
A quantum measurement, often referred to as positive operator-valued measurement (POVM), is a set of positive operators $P_j=P_j^\dag\geq 0$ summing to identity, $\sum_jP_j=\mathbb{1}$. This can be seen as a generalization of a probability…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of…