Related papers: A quantum dynamical approach to matrix Khrushchev'…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all…
Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation, meaning that any computation done by a general purpose quantum computer can either be done using the UC-DTQW framework. In the last…
We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time…
Several well-known results from the random matrix theory, such as Wigner's law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the…
Perturbation theory is a powerful tool for studying large-scale structure formation in the universe and calculating observables such as the power spectrum or bispectrum. However, beyond linear order, typically this is done by assuming a…
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial…
We study the connection between block Krylov subspaces and matrix orthogonal functions. Under a no-deflation assumption, we show that polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
Unitary matrix integrals over symmetric polynomials play an important role in a wide variety of applications, including random matrix theory, gauge theory, number theory, and enumerative combinatorics. We derive novel results on such…
We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential…
In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in…
We present an explicit formula for the characteristic polynomial of the transition matrix of the discrete-time quantum walk on a graph via the second weighted zeta function. As applications, we obtain new proofs for the results on spectra…
This paper defines the multivariate Krawtchouk polynomials, orthogonal on the multinomial distribution, and summarizes their properties as a review. The multivariate Krawtchouk polynomials are symmetric functions of orthogonal sets of…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
This paper is motivated by the following problem. Define a quantum walk on a positively weighted path (linear chain). Can the weights be tuned so that perfect state transfer occurs between the first vertex and any other position? We do not…
In this paper we obtain new results about the orthogonality measure of orthogonal polynomials on the unit circle, through the study of unitary truncations of the corresponding unitary multiplication operator, and the use of the…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…