A quantum dynamical approach to matrix Khrushchev's formulas

DOI10.1002/CPA.21579MaRDI QIDQ2802032zbMATH OpenOpenAlexFDO

Authors C. Cedzich, L. Velázquez, Albert H. Werner, F. Alberto Grünbaum, Reinhard F. Werner

Publication date 22 April 2016

Published in Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.0985

Mathematics Subject Classification ID

Polynomials and rational functions of one complex variable (30C10) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Abstract: Khrushchev's formula is the cornerstone of the so called Khrushchev theory, a body of results which has revolutionized the theory of orthogonal polynomials on the unit circle. This formula can be understood as a factorization of the Schur function for an orthogonal polynomial modification of a measure on the unit circle. No such formula is known in the case of matrix-valued measures. This constitutes the main obstacle to generalize Khrushchev theory to the matrix-valued setting which we overcome in this paper. It was recently discovered that orthogonal polynomials on the unit circle and their matrix-valued versions play a significant role in the study of quantum walks, the quantum mechanical analogue of random walks. In particular, Schur functions turn out to be the mathematical tool which best codify the return properties of a discrete time quantum system, a topic in which Khrushchev's formula has profound and surprising implications. We will show that this connection between Schur functions and quantum walks is behind a simple proof of Khrushchev's formula via `quantum' diagrammatic techniques for CMV matrices. This does not merely give a quantum meaning to a known mathematical result, since the diagrammatic proof also works for matrix-valued measures. Actually, this path counting approach is so fruitful that it provides different matrix generalizations of Khrushchev's formula, some of them new even in the case of scalar measures. Furthermore, the path counting approach allows us to identify the properties of CMV matrices which are responsible for Khrushchev's formula. On the one hand, this helps to formalize and unify the diagrammatic proofs using simple operator theory tools. On the other hand, this is the origin of our main result which extends Khrushchev's formula beyond the CMV case, as a factorization rule for Schur functions related to general unitary operators.

Recommendations

• scientific article; zbMATH DE number 1341976
• scientific article; zbMATH DE number 2019894
• Quantization of formal classical dynamical \(r\)-matrices: the reductive case
• Quasi-exactly solvable matrix Schrödinger operators
• Dynamical aspects in the quantizer-dequantizer formalism
• Quantization of symplectic dynamical \(r\)-matrices and the quantum composition formula
• A quantum-trace determinantal formula for matrix commutators, and applications
• Dynamical quantum determinants and Pfaffians
• Quasi-exactly-solvable models from finite-dimensional matrices
• Triangular dynamical \(r\)-matrices and quantization

Cites work

• scientific article; zbMATH DE number 2134205 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A random walk approach to quantum algorithms
• Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations
• Asymptotic evolution of quantum walks with random coin
• CMV matrices: Five years after
• Classification theorems for general orthogonal polynomials on the unit circle
• Disordered quantum walks in one lattice dimension
• Dynamical localization for \(d\)-dimensional random quantum walks
• Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
• Index theory of one dimensional quantum walks and cellular automata
• Matrix-valued SzegoÌ polynomials and quantum random walks
• One-dimensional quantum walks with one defect
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum recurrence of a subspace and operator-valued Schur functions
• Recurrence for discrete time unitary evolutions
• Schur's algorithm, orthogonal polynomials, and convergence of Wall's continued fractions in \(L^2(\mathbb{T})\).
• Some Perspectives on the Eigenvalue Problem
• The Analytic Theory of Matrix Orthogonal Polynomials
• The CGMV method for quantum walks

Cited in

(12)

• The Schur-Potapov algorithm in the general matrix case and its application to the matricial Schur problem
• On matrix-model approach to simplified Khovanov-Rozansky calculus
• Description of the set of all possible masses at a fixed point of solutions of a truncated matricial Hamburger moment problem
• Kronecker product-forms of steady-state probabilities with \(C_k/C_m/1\) by matrix polynomial approaches
• Singular continuous Cantor spectrum for magnetic quantum walks
• Wiener-Hopf factorization approach to a bulk-boundary correspondence and stability conditions for topological zero-energy modes
• Wall polynomials on the real line: a classical approach to OPRL Khrushchev's formula
• A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks
• Quantum walks: Schur functions meet symmetry protected topological phases
• Quantum Markov chains: recurrence, Schur functions and splitting rules
• A condition for purely absolutely continuous spectrum for CMV operators using the density of states
• The topological classification of one-dimensional symmetric quantum walks

This page was built for publication: A quantum dynamical approach to matrix Khrushchev's formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802032)