Related papers: Orthogonal Polynomials and Perfect State Transfer
We present a formulation of quantum mechanics based on orthogonal polynomials. The wavefunction is expanded over a complete set of square integrable basis in configuration space where the expansion coefficients are orthogonal polynomials in…
Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…
We introduce the concept of group state transfer on graphs, summarize its relationship to other concepts in the theory of quantum walks, set up a basic theory, and discuss examples. Let $X$ be a graph with adjacency matrix $A$ and consider…
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator…
Quantum information transfer is an important part of quantum information processing. Several proposals for quantum information transfer along linear arrays of nearest-neighbor coupled qubits or spins were made recently. Perfect transfer was…
For arbitrary $\beta > 0$, we use the orthogonal polynomials techniques developed by R. Killip and I. Nenciu to study certain linear statistics associated with the circular and Jacobi $\beta$ ensembles. We identify the distribution of these…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
An $s$-pair state in a graph is a quantum state of the form $\mathbf{e}_u+s\mathbf{e}_v$, where $u$ and $v$ are vertices in the graph and $s$ is a non-zero complex number. If $s=-1$ (resp., $s=1$), then such a state is called a pair state…
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which…
A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
In this article, we will explore why Karlin-McGregor method of using orthogonal polynomials in the study of Markov processes was so successful for one dimensional nearest neighbor processes, but failed beyond nearest neighbor transitions.…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
New exactly solvable one-dimensional XX spin chain models that exhibit perfect state transfer are defined. These models have inhomogeneous couplings and magnetic fields determined from the three-term recurrence relations satisfied by the…
The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…
The transfer of information from one part of a quantum system to another is fundamental to the understanding and design of quantum information processing devices. In the realm of discrete systems such as spin chains, inhomogeneous networks…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
For the filtering of peaks in periodic signals, we specify polynomial filters that are optimally localized in space. The space localization of functions having an expansion in terms of orthogonal polynomials is thereby measured by a…
Transfer matrices and matrix product operators play an ubiquitous role in the field of many body physics. This paper gives an ideosyncratic overview of applications, exact results and computational aspects of diagonalizing transfer matrices…